PPaperPicks
← All conferences
Editions202620252024

TCC 2025

A

Theory of Cryptography Conference

Official site ↗
74
accepted papers
184
authors
December 1-5, 2025
dates
Denmark
location

74 / 74 papers

  1. 1
    (Multi-input) sfFE for Randomized Functionalities, Revisited
    Pratish Datta
    ,
    Jiaxin Guan
    ,
    Alexis Korb
    ,
    Amit Sahai
  2. 2
    A Fiat-Shamir Transformation from Duplex Sponges
    Alessandro Chiesa
    ,
    Michele Orrù
  3. 3
    A Hidden-Bits Approach to Statistical ZAPs from LWE
    Eli Bradley
    ,
    George Lu
    ,
    Shafik Nassar
    ,
    Brent Waters
    ,
    David J. Wu
  4. 4
    A Meta-complexity Theoretic Approach to Indistinguishability Obfuscation and Witness Pseudo-Canonicalization
    Noam Mazor
    ,
    Rafael Pass
    ,
    Tomer Solomon
  5. 5
    Adaptively Secure Streaming Functional Encryption
    Pratish Datta
    ,
    Jiaxin Guan
    ,
    Alexis Korb
    ,
    Amit Sahai
  6. 6
    An Unstoppable Ideal Functionality for Signatures and a Modular Analysis of the Dolev-Strong Broadcast
    Ran Cohen
    ,
    Jack Doerner
    ,
    Eysa Lee
    ,
    Anna Lysyanskaya
    ,
    Lawrence Roy
  7. 7
    Black-Box Crypto Is Useless for Pseudorandom Codes
    Sanjam Garg
    ,
    Sam Gunn
    ,
    Mingyuan Wang
  8. 8
    Clifford Strategies in Interactive Protocols are Classically Simulatable
    Itay Shalit
  9. 9
    Computational Monogamy of Entanglement and Non-interactive Quantum Key Distribution
    Alex B. Grilo
    ,
    Giulio Malavolta
    ,
    Michael Walter
    ,
    Tianwei Zhang
  10. 10
    Constrained Verifiable Random Functions Without Obfuscation and Friends
    Nicholas Brandt
    ,
    Miguel Cueto Noval
    ,
    Christoph U. Günther
    ,
    Akin Ünal
    ,
    Stella Wohnig
  11. 11
    Cryptography with Weak Privacy
    Amos Beimel
    ,
    Yuval Ishai
    ,
    Eyal Kushilevitz
    ,
    Hanjun Li
  12. 12
    Deniable Secret Sharing
    Ran Canetti
    ,
    Ivan Damgård
    ,
    Sebastian Kolby
    ,
    Divya Ravi
    ,
    Sophia Yakoubov
  13. 13
    Differentially Private Compression and the Sensitivity of LZ77
    Jeremiah Blocki
    ,
    Seunghoon Lee
    ,
    Brayan Sebastián Yepes Garcia
  14. 14
    Differentially Private Learning Beyond the Classical Dimensionality Regime
    Cynthia Dwork
    ,
    Pranay Tankala
    ,
    Linjun Zhang
  15. 15
    Dimensional esfROSion: Improving the sfROS Attack with Decomposition in Higher Bases
    Antoine Joux
    ,
    Julian Loss
    ,
    Giacomo Santato
  16. 16
    Efficient Garbled Pseudorandom Functions and Lookup Tables from Minimal Assumption
    Wei-Kai Lin
    ,
    Zhenghao Lu
    ,
    Hong-Sheng Zhou
  17. 17
    Foundations of Single-Decryptor Encryption
    Fuyuki Kitagawa
    ,
    Takashi Yamakawa
  18. 18
    Four-Round Statistical Non-malleable Zero-Knowledge
    Susumu Kiyoshima
  19. 19
    Fully-Homomorphic Encryption from Lattice Isomorphism
    Pedro Branco
    ,
    Giulio Malavolta
    ,
    Zayd Maradni
  20. 20
    Generalized and Unified Equivalences Between Hardness and Pseudoentropy
    Lunjia Hu
    ,
    Salil P. Vadhan
  21. 21
    Honest Majority Constant-Round MPC with Linear Communication from One-Way Functions
    Junru Li
    ,
    Yifan Song
  22. 22
    How to Verify that a Small Device is Quantum, Unconditionally
    Giulio Malavolta
    ,
    Tamer Mour
  23. 23
    Incompressible Encryption with Everlasting Security
    Shany Ben-David
    ,
    Eylon Yogev
  24. 24
    Information-Theoretic Broadcast-Optimal MPC
    Michele Ciampi
    ,
    Ivan Damgård
    ,
    Divya Ravi
    ,
    Luisa Siniscalchi
    ,
    Sophia Yakoubov
  25. 25
    Is It Even Possible? On the Parallel Composition of Asynchronous MPC Protocols
    Ran Cohen
    ,
    Pouyan Forghani
    ,
    Juan Garay
    ,
    Rutvik Patel
    ,
    Vassilis Zikas
  26. 26
    Large-Plaintext Functional Bootstrapping in FHE with Small Bootstrapping Keys
    Kuiyuan Duan
    ,
    Hongbo Li
    ,
    Dengfa Liu
    ,
    Guangsheng Ma
  27. 27
    Linear Prover IOPs in Log Star Rounds
    Noor Athamnah
    ,
    Noga Ron-Zewi
    ,
    Ron D. Rothblum
  28. 28
    Linear-Time Accumulation Schemes
    Benedikt Bünz
    ,
    Alessandro Chiesa
    ,
    Giacomo Fenzi
    ,
    William Wang
  29. 29
    Lower Bounds on Inner-Product Functional Encryption from All-or-Nothing Encryption Primitives
    Jinye He
    ,
    Shiyu Li
    ,
    Wei-Kai Lin
  30. 30
    Multi-server Doubly Efficient PIR in the Classical Model and Beyond
    Arthur Lazzaretti
    ,
    Zeyu Liu
    ,
    Ben Fisch
    ,
    Peihan Miao
    ,
    Charalampos Papamanthou
  31. 31
    Multiparty Homomorphic Secret Sharing and More from LPN and MQ
    Geoffroy Couteau
    ,
    Naman Kumar
    ,
    Xiaxi Ye
  32. 32
    NISQ Security and Complexity via Simple Classical Reasoning
    Alexandru Cojocaru
    ,
    Juan Garay
    ,
    Qipeng Liu
    ,
    Fang Song
  33. 33
    Obfuscating Pseudorandom Functions is Post-quantum Complete
    Pedro Branco
    ,
    Abhishek Jain
    ,
    Akshayaram Srinivasan
  34. 34
    Offline-Online Indifferentiability of Cryptographic Systems
    Ashrujit Ghoshal
    ,
    Ilan Komargodski
    ,
    Gil Segev
  35. 35
    On Achieving "Best-in-the-Multiverse" MPC
    Anasuya Acharya
    ,
    Carmit Hazay
    ,
    Muthuramakrishnan Venkitasubramaniam
  36. 36
    On the Impossibility of Actively Secure Distributed Samplers
    Damiano Abram
    ,
    Serge Fehr
    ,
    Maciej Obremski
    ,
    Peter Scholl
  37. 37
    On the Limitations of Pseudorandom Unitaries - Or: Cryptographic Applications of LOCC Indistinguishability of Identical Versus Independent Haar Unitaries
    Prabhanjan Ananth
    ,
    Aditya Gulati
    ,
    Yao-Ting Lin
  38. 38
    Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions
    Helger Lipmaa
  39. 39
    Polynomial Secret Sharing Schemes and Algebraic Matroids
    Amos Beimel
    ,
    Oriol Farràs
    ,
    Adriana Moya
  40. 40
    Practical Secure Delegated Linear Algebra with Trapdoored Matrices
    Mark Braverman
    ,
    Stephen Newman
  41. 41
    Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank
    Amik Raj Behera
    ,
    Pierre Meyer
    ,
    Claudio Orlandi
    ,
    Lawrence Roy
    ,
    Peter Scholl
  42. 42
    Provably Memory-Hard Proofs of Work with Memory-Easy Verification
    Jeremiah Blocki
    ,
    Nathan Smearsoll
  43. 43
    Pseudorandom Correlation Functions for Garbled Circuits
    Geoffroy Couteau
    ,
    Srinivas Devadas
    ,
    Alexander Koch
    ,
    Sacha Servan-Schreiber
  44. 44
    Pseudorandom FE, iO and Applications
    Shweta Agrawal
    ,
    Simran Kumari
    ,
    Shota Yamada
  45. 45
    Pseudorandom Function-Like States from Common Haar Unitary
    Minki Hhan
    ,
    Shogo Yamada
  46. 46
    Quantum Interactive Oracle Proofs
    Baocheng Sun
    ,
    Thomas Vidick
  47. 47
    Quantum Rewinding for IOP-Based Succinct Arguments
    Alessandro Chiesa
    ,
    Marcel Dall'Agnol
    ,
    Zijing Di
    ,
    Ziyi Guan
    ,
    Nicholas Spooner
  48. 48
    Relationships Among FuncCPA and Its Related Notions
    Takumi Shinozaki
    ,
    Tatsuaki Okamoto
    ,
    Keisuke Tanaka
    ,
    Masayuki Tezuka
    ,
    Yusuke Yoshida
  49. 49
    Relativized Succinct Arguments in the ROM do not Exist
    Annalisa Barbara
    ,
    Alessandro Chiesa
    ,
    Ziyi Guan
  50. 50
    Sandwich BUFF: Achieving Non-resignability Using Iterative Hash Functions
    Serge Fehr
    ,
    Yu-Hsuan Huang
    ,
    Julia Kastner