PPaperPicks
← All conferences
Editions202620252024

TCC 2024

A

Theory of Cryptography Conference

Official site ↗
68
accepted papers
176
authors
Dec 2 - 6, 2024
dates
Italy
location

68 / 68 papers

  1. 1
    A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction
    Pierre Charbit
    ,
    Geoffroy Couteau
    ,
    Pierre Meyer
    ,
    Reza Naserasr
  2. 2
    Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC
    Nishanth Chandran
    ,
    Juan A. Garay
    ,
    Ankit Kumar Misra
    ,
    Rafail Ostrovsky
    ,
    Vassilis Zikas
  3. 3
    Adaptively Secure Attribute-Based Encryption from Witness Encryption
    Brent Waters
    ,
    Daniel Wichs
  4. 4
    An Improvement Upon the Bounds for the Local Leakage Resilience of Shamir's Secret Sharing Scheme
    Dustin Kasser
  5. 5
    Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC
    Ittai Abraham
    ,
    Gilad Asharov
    ,
    Arpita Patra
    ,
    Gilad Stern
  6. 6
    Batch Arguments to NIZKs from One-Way Functions
    Eli Bradley
    ,
    Brent Waters
    ,
    David J. Wu
  7. 7
    Batching Adaptively-Sound SNARGs for NP
    Lalita Devadas
    ,
    Brent Waters
    ,
    David J. Wu
  8. 8
    Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis
    Daniele Micciancio
    ,
    Mark Schultz-Wu
  9. 9
    Bit-Security Preserving Hardness Amplification
    Shun Watanabe
    ,
    Kenji Yasunaga
  10. 10
    Black-Box Timed Commitments from Time-Lock Puzzles
    Hamza Abusalah
    ,
    Gennaro Avitabile
  11. 11
    Bruisable Onions: Anonymous Communication in the Asynchronous Model
    Megumi Ando
    ,
    Anna Lysyanskaya
    ,
    Eli Upfal
  12. 12
    Compact Key Storage in the Standard Model
    Yevgeniy Dodis
    ,
    Daniel Jost
  13. 13
    Composability in Watermarking Schemes
    Jiahui Liu
    ,
    Mark Zhandry
  14. 14
    Consensus in the Presence of Overlapping Faults and Total Omission
    Julian Loss
    ,
    Kecheng Shi
    ,
    Gilad Stern
  15. 15
    Cryptography in the Common Haar State Model: Feasibility Results and Separations
    Prabhanjan Ananth
    ,
    Aditya Gulati
    ,
    Yao-Ting Lin
  16. 16
    Distributed Broadcast Encryption from Lattices
    Jeffrey Champion
    ,
    David J. Wu
  17. 17
    Distributing Keys and Random Secrets with Constant Complexity
    Benny Applebaum
    ,
    Benny Pinkas
  18. 18
    Doubly-Efficient Batch Verification in Statistical Zero-Knowledge
    Or Keret
    ,
    Ron D. Rothblum
    ,
    Prashant Nalini Vasudevan
  19. 19
    Efficient Secure Communication over Dynamic Incomplete Networks with Minimal Connectivity
    Ivan Damgård
    ,
    Divya Ravi
    ,
    Lawrence Roy
    ,
    Daniel Tschudi
    ,
    Sophia Yakoubov
  20. 20
    From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking
    Lior Rotem
    ,
    Gil Segev
    ,
    Eylon Yogev
  21. 21
    General Adversary Structures in Byzantine Agreement and Multi-party Computation with Active and Omission Corruption
    Konstantinos Brazitikos
    ,
    Vassilis Zikas
  22. 22
    Hamming Weight Proofs of Proximity with One-Sided Error
    Gal Arnon
    ,
    Shany Ben-David
    ,
    Eylon Yogev
  23. 23
    Hide-and-Seek and the Non-resignability of the BUFF Transform
    Jelle Don
    ,
    Serge Fehr
    ,
    Yu-Hsuan Huang
    ,
    Jyun-Jie Liao
    ,
    Patrick Struck
  24. 24
    Homomorphic Secret Sharing with Verifiable Evaluation
    Arka Rai Choudhuri
    ,
    Aarushi Goel
    ,
    Aditya Hegde
    ,
    Abhishek Jain
  25. 25
    Indistinguishability Obfuscation from Bilinear Maps and LPN Variants
    Seyoon Ragavan
    ,
    Neekon Vafa
    ,
    Vinod Vaikuntanathan
  26. 26
    Information-Theoretic Multi-server Private Information Retrieval with Client Preprocessing
    Jaspal Singh
    ,
    Yu Wei
    ,
    Vassilis Zikas
  27. 27
    Instance-Hiding Interactive Proofs - (Extended Abstract)
    Changrui Mu
    ,
    Prashant Nalini Vasudevan
  28. 28
    Key-Homomorphic and Aggregate Verifiable Random Functions
    Giulio Malavolta
  29. 29
    Limits on Adaptive Security for Attribute-Based Encryption
    Zvika Brakerski
    ,
    Stav Medina
  30. 30
    Low-Degree Security of the Planted Random Subgraph Problem
    Andrej Bogdanov
    ,
    Chris Jones
    ,
    Alon Rosen
    ,
    Ilias Zadik
  31. 31
    Lower Bounds for Levin-Kolmogorov Complexity
    Nicholas Brandt
  32. 32
    Monotone Policy BARGs from BARGs and Additively Homomorphic Encryption
    Shafik Nassar
    ,
    Brent Waters
    ,
    David J. Wu
  33. 33
    More Efficient Functional Bootstrapping for General Functions in Polynomial Modulus
    Han Xia
    ,
    Feng-Hao Liu
    ,
    Han Wang
  34. 34
    Multi-authority Functional Encryption with Bounded Collusions from Standard Assumptions
    Rishab Goyal
    ,
    Saikumar Yadugiri
  35. 35
    Multi-client Attribute-Based and Predicate Encryption from Standard Assumptions
    David Pointcheval
    ,
    Robert Schädlich
  36. 36
    New Upper Bounds for Evolving Secret Sharing via Infinite Branching Programs
    Bar Alon
    ,
    Amos Beimel
    ,
    Tamar Ben David
    ,
    Eran Omri
    ,
    Anat Paskin-Cherniavsky
  37. 37
    On Black-Box Separations of Quantum Digital Signatures from Pseudorandom States
    Andrea Coladangelo
    ,
    Saachi Mutreja
  38. 38
    On Bounded Storage Key Agreement and One-Way Functions
    Chris Brzuska
    ,
    Geoffroy Couteau
    ,
    Christoph Egger
    ,
    Willy Quach
  39. 39
    On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational Depth
    Yanyi Liu
    ,
    Rafael Pass
  40. 40
    On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols
    Ohad Klein
    ,
    Ilan Komargodski
    ,
    Chenzhi Zhu
  41. 41
    On the Black-Box Complexity of Private-Key Inner-Product Functional Encryption
    Mohammad Hajiabadi
    ,
    Roman Langrehr
    ,
    Adam O'Neill
    ,
    Mingyuan Wang
  42. 42
    One-Way Functions and pKt Complexity
    Shuichi Hirahara
    ,
    Zhenjian Lu
    ,
    Igor C. Oliveira
  43. 43
    Perfectly-Secure MPC with Constant Online Communication Complexity
    Yifan Song
    ,
    Xiaxi Ye
  44. 44
    Quantum Key-Revocable Dual-Regev Encryption, Revisited
    Prabhanjan Ananth
    ,
    Zihan Hu
    ,
    Zikuan Huang
  45. 45
    Quantum Pseudorandom Scramblers
    Chuhan Lu
    ,
    Minglong Qin
    ,
    Fang Song
    ,
    Penghui Yao
    ,
    Mingnan Zhao
  46. 46
    Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing
    Pierre Meyer
    ,
    Claudio Orlandi
    ,
    Lawrence Roy
    ,
    Peter Scholl
  47. 47
    Rate-1 Zero-Knowledge Proofs from One-Way Functions
    Noor Athamnah
    ,
    Eden Florentz-Konopnicki
    ,
    Ron D. Rothblum
  48. 48
    Real-Valued Somewhat-Pseudorandom Unitaries
    Zvika Brakerski
    ,
    Nir Magrafta
  49. 49
    Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation
    Oriol Farràs
    ,
    Miquel Guiot
  50. 50
    Robust Combiners and Universal Constructions for Quantum Cryptography
    Taiga Hiroka
    ,
    Fuyuki Kitagawa
    ,
    Ryo Nishimaki
    ,
    Takashi Yamakawa