Theory of Cryptography Conference (TCC) 2020: 
Krzysztof Pietrzak and Rafael Pass (Eds.):
TCC 2020,
Virtual
Nov 16-19 2020
Proceedings.
Crypto database info for TCC 2020
Organizational Committee
Program Chairs:
General Chair:
Krzysztof Pietrzak and Rafael Pass
Alessandra Scafuro
General Chair:
Krzysztof Pietrzak and Rafael Pass
Alessandra Scafuro
Prabhanjan Ananth
Marshall Ball
Sonia Belaïd
Jeremiah Blocki
Andrej Bogdanov
Chris Brzuska
Ignacio Cascudo
Kai-Min Chung
Aloni Cohen
Ran Cohen
Nico Döttling
Stefan Dziembowski
Oriol Farràs
Georg Fuchsbauer
Niv Gilboa
Vipul Goyal
Mohammad Hajiabadi
Justin Holmgren
Zahra Jafargholi
Yael Tauman Kalai
Seny Kamara
Dakshita Khurana
Markulf Kohlweiss
Ilan Komargodski
Huijia Lin
Mohammad Mahmoody
Jesper Buus Nielsen
Emmanuela Orsini
Sunoo Park
Anat Paskin-Cherniavsky
Oxana Poburinnaya
Silas Richelson
Alon Rosen
Abhi Shelat
Nicholas Spooner
Uri Stemmer
Justin Thaler
Daniel Wichs
Eylon Yogev
- LWE and Encryption
- Lossiness and Entropic Hardness for Ring-LWE
Zvika Brakerski, Nico Döttling,
bibinfo - Multi-key Fully-Homomorphic Encryption in the Plain Model
Abhishek Jain, Prabhanjan Ananth, Giulio Malavolta, Zhengzhong Jin,
bibinfo - Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions
Sanjam Garg, Zvika Brakerski, Nico Döttling, Giulio Malavolta, Pedro Branco,
bibinfo - Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More
Rafail Ostrovsky, Sanjam Garg, Mohammad Hajiabadi,
bibinfo - CP-ABE for Circuits (and more) in the Symmetric Key Setting
Shweta Agrawal, Shota Yamada,
bibinfo - Optimal Broadcast Encryption from LWE and Pairings in the Standard Model
Daniel Wichs, Shweta Agrawal, Shota Yamada,
bibinfo - Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark)
Ryo Nishimaki,
bibinfo - Functional Encryption for Quadratic Functions from k-Lin, Revisited
Hoeteck Wee,
bibinfo
- Lossiness and Entropic Hardness for Ring-LWE
- Blockchains
- Can a Blockchain Keep a Secret?
Leonid Reyzin, Shai Halevi, Craig Gentry, Hugo Krawczyk, Tal Rabin, Sergey Gorbunov, Fabrice Benhamouda, Chengyu Lin,
bibinfo - Expected Constant Round Byzantine Broadcast under Dishonest Majority
Elaine Shi, Hanshen Xiao, Jun Wan, Srini Devadas,
bibinfo - Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions
Srinivas Devadas, Elaine Shi, Hanshen Xiao, Jun Wan,
bibinfo - Blockchains from Non-Idealized Hash Functions
Aggelos Kiayias, Juan A. Garay, Giorgos Panagiotakos,
bibinfo - Ledger Combiners for Fast Settlement
Matthias Fitzi, Aggelos Kiayias, Alexander Russell, Peter Gaži,
bibinfo - Asynchronous Byzantine Agreement with Subquadratic Communication
Jonathan Katz, Julian Loss, Chen-Da Liu-Zhang, Erica Blum,
bibinfo - On the Security of Time-Lock Puzzles and Timed Commitments
Jonathan Katz, Julian Loss, Jiayu Xu,
bibinfo
- Can a Blockchain Keep a Secret?
- Oblivious structures, Key-exchange and Group messaging
- A Lower Bound for One-Round Oblivious RAM
David Cash, Andrew Drucker, Alexander Hoover,
bibinfo - Lower Bounds for Multi-Server Oblivious RAMs
Mark Simkin, Kasper Green Larsen, Kevin Yeo,
bibinfo - On Computational Shortcuts for Information-Theoretic PIR
Yuval Ishai, Russell W. F. Lai, Matthew M. Hong, Victor I. Kolobov,
bibinfo - On the Price of Concurrency in Group Ratcheting Protocols
Yevgeniy Dodis, Paul Rösler, Alexander Bienstock,
bibinfo - Stronger Security and Constructions of Multi-Designated Verifier Signatures
Claudio Orlandi, Sophia Yakoubov, Anca Nitulescu, Helene Haagh, Ivan Damgård, Rebekah Mercer,
bibinfo - Continuous Group Key Agreement with Active Security
Joël Alwen, Sandro Coretti, Daniel Jost, Marta Mularczyk,
bibinfo - Security analysis of SPAKE2+
Victor Shoup,
bibinfo
- A Lower Bound for One-Round Oblivious RAM
- Succinct Arguments
- Proof-Carrying Data from Accumulation Schemes
Alessandro Chiesa, Benedikt Bünz, Nicholas Spooner, Pratyush Mishra,
bibinfo - Linear-Time Arguments with Sublinear Verification from Tensor Codes
Jens Groth, Alessandro Chiesa, Jonathan Bootle,
bibinfo - Barriers for Succinct Arguments in the Random Oracle Model
Alessandro Chiesa, Eylon Yogev,
bibinfo - Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction
Gil Segev, Gili Schul-Ganz,
bibinfo - Batch Verification for Statistical Zero Knowledge Proofs
Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Inbar Kaslasi, Prashant N. Vasudevan,
bibinfo - Batch Verification and Proofs of Proximity with Polylog Overhead
Guy N. Rothblum, Ron D. Rothblum,
bibinfo - Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads
Alon Rosen, Ron D. Rothblum, Justin Holmgren, Pratik Soni, Alexander R. Block,
bibinfo
- Proof-Carrying Data from Accumulation Schemes
- Zero Knowledge
- Characterizing Deterministic-Prover Zero Knowledge
Arka Rai Choudhuri, Nir Bitanksy,
bibinfo - NIZK from SNARG
Takahiro Matsuda, Takashi Yamakawa, Fuyuki Kitagawa,
bibinfo - Weakly Extractable One-Way Functions
Nir Bitansky, Omer Paneth, Noa Eizenstadt,
bibinfo - Towards Non-Interactive Witness Hiding
Mark Zhandry, Benjamin Kuykendall,
bibinfo - Perfect Zero Knowledge: New Upperbounds and Relativized Separations
Peter Dixon, Sutanu Gayen, A. Pavan, N. V. Vinodchandran,
bibinfo - FHE-Based Bootstrapping of Designated-Prover NIZK
Sanjam Garg, Zvika Brakerski, Rotem Tsabary,
bibinfo - On Average-Case Hardness in TFNP from One-Way Functions
Pavel Hubáček, Chethan Kamath, Karel Král, Veronika Slívová,
bibinfo
- Characterizing Deterministic-Prover Zero Knowledge
- Secure Computation I
- Round Optimal Secure Multiparty Computation from Minimal Assumptions
Rafail Ostrovsky, Vipul Goyal, Abhishek Jain, Michele Ciampi, Arka Rai Choudhuri,
bibinfo - Reusable Two-Round MPC from DDH
Sanjam Garg, Daniel Masny, Pratyay Mukherjee, James Bartusek,
bibinfo - Mr NISC: Multiparty Reusable Non-Interactive Secure Computation
Huijia Lin, Fabrice Benhamouda,
bibinfo - Secure Massively Parallel Computation for Dishonest Majority
Elaine Shi, Ilan Komargodski, Rex Fernando, Yanyi Liu,
bibinfo - On Statistical Security in Two-Party Computation
Dakshita Khurana, Muhammad Haris Mughees,
bibinfo - Universal Composition with Global Subroutines: Capturing Global Setup within plain UC
Ran Canetti, Vassilis Zikas, Julia Hesse, Christian Badertscher, Bjoern Tackmann,
bibinfo - Universal Composition with Global Subroutines: Capturing Global Setup within plain UC
Ran Canetti, Vassilis Zikas, Julia Hesse, Christian Badertscher, Bjoern Tackmann,
bibinfo
- Round Optimal Secure Multiparty Computation from Minimal Assumptions
- Secure Computation II
- Topology-Hiding Communication from Minimal Assumptions.
Tal Malkin, Tal Moran, Elette Boyle, Ran Cohen, Marshall Ball, Lisa Kohl, Pierre Meyer,
bibinfo - Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More
Hoeteck Wee, Huijia Lin, Tianren Liu,
bibinfo - Towards Multiparty Computation Withstanding Coercion of All Parties
Ran Canetti, Oxana Poburinnaya,
bibinfo - The Resiliency of MPC with Low Interaction: The Benefit of Making Errors
Benny Applebaum, Arpita Patra, Eliran Kachlon,
bibinfo - Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures
Dana Dachman-Soled,
bibinfo - On the Power of an Honest Majority in Three-Party Computation Without Broadcast
Eran Omri, Ran Cohen, Bar Alon, Tom Suad,
bibinfo - A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity
Ignacio Cascudo, Jaron Skovsted Gundersen,
bibinfo
- Topology-Hiding Communication from Minimal Assumptions.
- TCC Test of Time Award
-
Perfectly-Secure MPC with Linear Communication Complexity, TCC 2008,
Zuzana Beerliová-Trubíniová, Martin Hirt
Talk: "Hyper-Invertible Matrices and Applications to Multi-Party Computation"
-
Perfectly-Secure MPC with Linear Communication Complexity, TCC 2008,
Zuzana Beerliová-Trubíniová, Martin Hirt
- Quantum & Sampling
- Schröodinger's Pirate: How To Trace a Quantum Decoder
Mark Zhandry,
bibinfo - Quantum encryption with certified deletion
Anne Broadbent, Rabib Islam,
bibinfo - Secure Quantum Extraction Protocols
Prabhanjan Ananth, Rolando L. La Placa,
bibinfo - Non-interactive classical verification of quantum computation
Gorjan Alagic, Alex B. Grilo, Andrew M. Childs, Shih-Han Hung,
bibinfo - Classical Verification of Quantum Computations with Efficient Verifier
Kai-Min Chung, Takashi Yamakawa, Nai-Hui Chia,
bibinfo - On Perfect Correctness in (Lockable) Obfuscation
Brent Waters, Venkata Koppula, Rishab Goyal, Satyanarayana Vusirikala,
bibinfo - On Pseudorandom Encodings
Stanislaw Jarecki, Amit Sahai, Yuval Ishai, Geoffroy Couteau, Thomas Agrikola,
bibinfo
- Schröodinger's Pirate: How To Trace a Quantum Decoder
- Information-theoretic Crypto and Idealized Models
- Coupling of Random Systems
Ueli Maurer, David Lanzenberger,
bibinfo - Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity
Yevgeniy Dodis, Stefano Tessaro, Pooya Farshim, Sogol Mazaheri,
bibinfo - Zero-Communication Reductions
Manoj Prabhakaran, Varun Narayanan, Vinod Prabhakaran,
bibinfo - Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
Gil Segev, Lior Rotem,
bibinfo - Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Iftach Haitner, Noam Mazor, Dror Chawin,
bibinfo - Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
Stefano Tessaro, Wei Dai, Xihu Zhang,
bibinfo - Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness
Stefano Tessaro, Joseph Jaeger,
bibinfo
- Coupling of Random Systems
- Secret Sharing & Coding
- On the Complexity of Arithmetic Secret Sharing
Ronald Cramer, Chaoping Xing, Chen Yuan,
bibinfo - Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
Serge Fehr, Chen Yuan,
bibinfo - The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
Amos Beimel, Oriol Farràs,
bibinfo - Transparent Error Correcting in a Computationally Bounded World
Eylon Yogev, Justin Holmgren, Ofer Grossman,
bibinfo - New Techniques in Replica Encodings with Client Setup
Brent Waters, Rachit Garg, George Lu,
bibinfo - Non-Malleable Codes, Extractors and Secret Sharing for Interleaved Tampering and Composition of Tampering
Xin Li, Eshan Chattopadhyay,
bibinfo - On the Round Complexity of the Shuffle Model
Amos Beimel, Kobbi Nissim, Iftach Haitner, Uri Stemmer,
bibinfo
- On the Complexity of Arithmetic Secret Sharing