Theory of Cryptography (TCC) 2022: 
Chicago USA
November 7-11, 2022
cryptodb information for TCC 2022
Organizational Committee
Program Chairs:
Eike Kiltz and Vinod Vaikuntanathan
General Chair:
David Cash
Eike Kiltz and Vinod Vaikuntanathan
General Chair:
David Cash
Program Committee
Gilad Asharov
Marshall Ball
Amos Beimel
Fabrice Benhamouda
Nir Bitansky
Zvika Brakerski
Anne Broadbent
Yilei Chen
Ran Cohen
Geoffroy Couteau
Nils Fleischhacker
Rishab Goyal
Siyao Guo
Dennis Hofheinz
Gabe Kaptchuk
Jonathan Katz
Dakshita Khurana
Susumu Kiyoshima
Karen Klein
Venkata Koppula
Eyal Kushilevitz
Alex Lombardi
Julian Loss
Fermi Ma
Mohammad Mahmoody
Ryo Nishimaki
Adam O'Neill
Emmanuela Orsini
Omer Paneth
Alon Rosen
Lior Rotem
Ron Rothblum
Peter Scholl
Sruthi Sekar
Katerina Sotiraki
Nicholas Spooner
Noah Stephens-Davidowitz
Stefano Tessaro
Prashant Vasudevan
David Wu
Yu Yu
Mark Zhandry
- Post-Quantum Cryptography
- Post-Quantum Insecurity from LWE,
Daniel Wichs, Alex Lombardi, Willy Quach, Ethan Mook,
bibinfo - Adaptive versus Static Multi-oracle Algorithms, and Quantum Security of a Split-key PRF,
Serge Fehr, Jelle Don, Yu-Hsuan Huang,
bibinfo - The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs,
Jeremiah Blocki, Seunghoon Lee, Blake Holman,
bibinfo - Quantum Rewinding for Many-Round Protocols,
Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner,
bibinfo
- Post-Quantum Insecurity from LWE,
- Invited Talk I: Rahul Santhanam
- Interactive Proofs
- Fiat-Shamir Transformation of Multi-Round Interactive Proofs,
Serge Fehr, Michael Klooß, Thomas Attema,
bibinfo - Steganography-Free Zero-Knowledge,
Vipul Goyal, Abhishek Jain, Nils Fleischhacker, Behzad Abdolmaleki, Giulio Malavolta,
bibinfo - Vector Commitments over Rings and Compressed Σ-Protocols,
Ronald Cramer, Ignacio Cascudo, Ivan Damgård, Daniel Escudero, Thomas Attema,
bibinfo - Universally Composable Sigma-protocols in the Global Random-Oracle Model,
Anna Lysyanskaya, Leah Namisa Rosenbloom,
bibinfo
- Fiat-Shamir Transformation of Multi-Round Interactive Proofs,
- Quantum Cryptography
- Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications,
Prabhanjan Ananth, Henry Yuen, Luowen Qian, Aditya Gulati,
bibinfo - Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols,
Giulio Malavolta, Navid Alamati, Ahmadreza Rahimi,
bibinfo - Collusion-Resistant Copy-Protection for Watermarkable Functionalities,
Mark Zhandry, Qipeng Liu, Luowen Qian, Jiahui Liu,
bibinfo
- Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications,
- Secret-Sharing and ORAM
- On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing,
Divesh Aggarwal, Maciej Obremski, João Ribeiro, Eldon Chung,
bibinfo - Leakage-resilient Linear Secret-sharing against arbitrary Bounded-size Leakage Family,
Hemanta K. Maji, Anat Paskin-Cherniavsky, Hai H. Nguyen, Mingyuan Wang, Tom Suad, Xiuyu Ye, Albert Yu,
bibinfo - Random-Index Oblivious RAM,
Shai Halevi, Eyal Kushilevitz,
bibinfo
- On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing,
- ABE and FE
- Multi-Input Quadratic Functional Encryption: Stronger Security, Broader Functionality,
Shweta Agrawal, Rishab Goyal, Junichi Tomida,
bibinfo - Bounded Functional Encryption for Turing Machines: Adaptive Security from General Assumptions,
Shweta Agrawal, Ryo Nishimaki, Shota Yamada, Takashi Yamakawa, Fuyuki Kitagawa, Anuja Modi,
bibinfo - ABE for Circuits with Constant-Size Secret Keys and Adaptive Security,
Huijia Lin, Ji Luo, Hanjun Li,
bibinfo
- Multi-Input Quadratic Functional Encryption: Stronger Security, Broader Functionality,
- Succinct Proofs
- On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives,
Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Laasya Bangalore, Rishabh Bhadauria,
bibinfo - A Toolbox for Barriers on Interactive Oracle Proofs,
Alessandro Chiesa, Eylon Yogev, Gal Arnon, Amey Bhangale,
bibinfo - Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT Part II),
Eli Ben Sasson, Dan Carmon, Swastik Kopparty, David Levit,
bibinfo - Doubly Efficient Interactive Proofs over Infinite and Non-Commutative Rings,
Eduardo Soria-Vazquez,
bibinfo - Fully Succinct Batch Arguments for NP from Indistinguishability Obfuscation,
Brent Waters, David J. Wu, Rachit Garg, Kristin Sheridan,
bibinfo
- On Black-Box Constructions of Time and Space Efficient Sublinear Arguments from Symmetric-Key Primitives,
- IBE and FE
- Multi-Authority ABE from Lattices without Random Oracles,
Brent Waters, Hoeteck Wee, David J. Wu,
bibinfo - Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption,
Wen-Feng Qi, Mohammad Mahmoody, Ahmadreza Rahimi,
bibinfo - IBE with Incompressible Master Secret and Small Identity Secrets,
Sanjam Garg, Nico Döttling, Sruthi Sekar, Mingyuan Wang,
bibinfo
- Multi-Authority ABE from Lattices without Random Oracles,
- Encryption Galore!
- Forward-Secure Encryption with Fast Forwarding,
Yevgeniy Dodis, Harish Karthikeyan, Daniel Jost,
bibinfo - Rate-1 Incompressible Encryption from Standard Assumptions,
Nico Döttling, Pedro Branco, Jesko Dujmović,
bibinfo - Achievable CCA2 Relaxation for Homomorphic Encryption,
Shai Halevi, Craig Gentry, Adi Akavia, Margarita Vald,
bibinfo
- Forward-Secure Encryption with Fast Forwarding,
- Test of Time Award and Talk
- From 2011: Perfectly Secure Oblivious RAM Without Random
Oracles
by Ivan Damgård, Sigurd Medgaard, and Jesper Buus Nielsen
talk given by Jesper Buus Nielsen: "A Walk in the ORAM Forest: About oblivious RAMs and something about trees"
- From 2011: Perfectly Secure Oblivious RAM Without Random
Oracles
- Multi-Party Computation I
- Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security,
Benny Applebaum, Arpita Patra, Eliran Kachlon,
bibinfo - Sublinear Secure Computation from New Assumptions,
Elette Boyle, Geoffroy Couteau, Pierre Meyer,
bibinfo - Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT,
Amit Sahai, Yuval Ishai, Dakshita Khurana, Akshayaram Srinivasan,
bibinfo - SCALES: MPC with Small Clients and Larger Ephemeral Servers,
Vladimir Kolesnikov, Manoj Prabhakaran, Carmit Hazay, Anasuya Acharya,
bibinfo
- Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security,
- Invited Talk II: Eran Tromer
- Protocols: Key Agreement and Commitments
- On the Worst-Case Inefficiency of CGKA,
Yevgeniy Dodis, Sanjam Garg, Mohammad Hajiabadi, Paul Rösler, Alexander Bienstock, Garrison Grogan,
bibinfo - Adaptive Multiparty NIKE,
Brent Waters, Mark Zhandry, Venkata Koppula,
bibinfo - On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups,
Dario Catalano, Rosario Gennaro, Dario Fiore, Emanuele Giunta,
bibinfo - Four-Round Black-Box Non-Malleable Commitments from One-Way Permutations,
Emmanuela Orsini, Michele Ciampi, Luisa Siniscalchi,
bibinfo
- On the Worst-Case Inefficiency of CGKA,
- Theory I: Sampling and Friends
- Best Young Researcher Award
A Tight Computational Indistinguishability Bound of Product Distributions,
Nathan Geier,
bibinfo - Secure Sampling with Sublinear Communication,
Seung Geol Choi, S. Dov Gordon, Dana Dachman-Soled, Arkady Yerukhimovich, Linsheng Liu,
bibinfo - Secure Non-interactive Simulation from Arbitrary Joint Distributions,
Hemanta K. Maji, Hai H. Nguyen, Hamidreza Amini Khorasgani,
bibinfo - Secure Non-Interactive Reducibility is Decidable,
Manoj Prabhakaran, Varun Narayanan, Kaartik Bhushan, Ankit Kumar Misra,
bibinfo
- Best Young Researcher Award
- Multi-Party Computation II
- How to Obfuscate MPC Inputs,
Mike Rosulek, Jiayu Xu, Ian McQuoid,
bibinfo - Fully-Secure MPC with Minimal Trust,
Yuval Ishai, Arpita Patra, Sikhar Patranabis, Akshayaram Srinivasan, Divya Ravi,
bibinfo - Statistical Security in Two-Party Computation Revisited,
Sikhar Patranabis, Saikrishna Badrinarayanan, Pratik Sarkar,
bibinfo - On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness,
Arpita Patra, Eran Omri, Anat Paskin-Cherniavsky, Bar Alon, Olga Nissenbaum,
bibinfo
- How to Obfuscate MPC Inputs,
- Lattices
- Public-Key Encryption from Homogeneous CLWE,
Alon Rosen, Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann,
bibinfo - PPAD is as Hard as LWE and Iterated Squaring,
Nir Bitansky, Omer Paneth, Ron D. Rothblum, Justin Holmgren, Chethan Kamath, Arka Rai Choudhuri, Alex Lombardi,
bibinfo - Parallelizable Delegation from LWE,
Rafael Pass, Cody Freitag, Naomi Sirkin,
bibinfo - How to Sample a Discrete Gaussian (and more) from a Random Oracle,
Brent Waters, George Lu,
bibinfo
- Bet-or-Pass: Adversarially Robust Bloom Filters,
Moni Naor, Noa Oved,
bibinfo - Anonymous Whistleblowing over Authenticated Channels,
Geoffroy Couteau, Thomas Agrikola, Sven Maier,
bibinfo - Poly Onions: Achieving Anonymity in the Presence of Churn,
Anna Lysyanskaya, Tal Malkin, Megumi Ando, Miranda Christ,
bibinfo - The Price of Verifiability: Lower Bounds for Verifiable Random Functions,
Dennis Hofheinz, Julia Kastner, Akın Ünal, Nicholas Brandt,
bibinfo
- Public-Key Encryption from Homogeneous CLWE,
- OT, PIR and Secret Sharing
- Verifiable Private Information Retrieval,
Yael Tauman Kalai, Omer Paneth, Shany Ben-David,
bibinfo - Asymptotically Free Broadcast in Constant Expected Time via Packed VSS,
Ittai Abraham, Arpita Patra, Gilad Asharov, Shravani Patil,
bibinfo - On the Optimal Communication Complexity of Error-Correcting Multi-Server PIR,
Kaoru Kurosawa, Koji Nuida, Reo Eriguchi,
bibinfo - Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication Reductions,
Manoj Prabhakaran, Varun Narayanan, Saumya Goyal,
bibinfo
- Permissionless Clock Synchronization with Public Setup,
Aggelos Kiayias, Juan A. Garay, Yu-Ching Shen,
bibinfo - One-Time Programs from Commodity Hardware,
Matthew Green, Abhishek Jain, Aarushi Goel, Harry Eldridge, Maximilian Zinkus,
bibinfo - Universal Reductions: Reductions Relative to Stateful Oracles,
Rafael Pass, Cody Freitag, Benjamin Chan,
bibinfo - Beyond Uber: Instantiating Generic Groups via PGGs,
Adam O'Neill, Pooya Farshim, Balthazar Bauer, Patrick Harasser,
bibinfo
- Verifiable Private Information Retrieval,