TCC 2021
77 talks · 2021 · indexed by Breach Arc Archive. Links open each talk on YouTube.
Browse with filters →- Acyclicity Programming for Sigma-Protocols 2021
- Adaptive Security of Multi-Party Protocols, Revisited 2021
- Amortizing Rate-1 OT and Applications to PIR and PSI 2021
- BKW Meets Fourier: New Algorithms for LPN with Sparse Parities 2021
- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness 2021
- Blockchains Enable Non-Interactive MPC 2021
- Classical Binding for Quantum Commitments 2021
- Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy 2021
- Concurrent Composition of Differential Privacy 2021
- Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity 2021
- Covert Learning: How to Learn with an Untrusted Intermediary 2021
- Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption 2021
- Direct Product Hardness Amplification 2021
- Disappearing Cryptography in the Bounded Storage Model 2021
- Distributed Merkle's Puzzles 2021
- Dory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitment... 2021
- Efficient Perfectly Secure Computation with Optimal Resilience 2021
- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (T... 2021
- Forward Secret Encrypted RAM: Lower Bounds and Applications 2021
- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions 2021
- Generalized Proofs of Knowledge with Fully Dynamic Setup 2021
- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation 2021
- Grafting Key Trees: Efficient Key Management for Overlapping Groups 2021
- Information-Theoretically Secure MPC against Mixed Dynamic Adversaries 2021
- Laconic Private Set Intersection and Applications 2021
- Multi-Party Functional Encryption 2021
- Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication 2021
- Non-Malleable Time-Lock Puzzles and Applications 2021
- Non-Malleable Vector Commitments via Local Equivocability 2021
- Oblivious Transfer from Trapdoor Permutations in Minimal Rounds 2021
- On Actively-Secure Elementary MPC Reductions 2021
- On Communication Models and Best-Achievable Security in Two-Round MPC 2021
- On Communication-Efficient Asynchronous MPC with Adaptive Security 2021
- On Derandomizing Yao’s Weak-to-Strong OWF Construction 2021
- On expected polynomial runtime in cryptography 2021
- On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger 2021
- On the Impossibility of Purely Algebraic Signatures 2021
- On Treewidth, Separators and Yao’s Garbling 2021
- Policy-Compliant Signatures 2021
- Polynomial-time targeted attacks on coin-tossing for any number of corruptions 2021
- Quantum Key-length Extension 2021
- Random-Index PIR and Applications 2021
- Rate-1 Quantum Fully Homomorphic Encryption 2021
- Relationships between quantum IND-CPA notions 2021
- Ring-based Identity Based Encryption – Asymptotically Shorter MPK and Tighter Security 2021
- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback 2021
- Secure Quantum Computation with Classical Communication 2021
- Secure Software Leasing from Standard Assumptions 2021
- Secure Software Leasing Without Assumptions 2021
- session-109: Multi-party Computation I 2021
- session-111: Quantum II 2021
- session-113: Foundations II 2021
- session-12: Multi-party Computation II 2021
- session-14: PIR, Encrypted RAM, Commitments 2021
- session-1: Welcome + Foundations I 2021
- session-20: Zero Knowledge, OT, Key Management 2021
- session-22: Routing, Signatures, Commitments, Timelock 2021
- session-4: ABE, FE, Obfuscation and Non Traditional Models 2021
- session-7: Invited talk by Abhishek Jain 2021
- session-98: Quantum I 2021
- session-9: Zero Knowledge and Proof Systems 2021
- Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions 2021
- Simple Constructions from (Almost) Regular One-Way Functions 2021
- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs 2021
- Statistical ZAPs from Group-Based Assumptions 2021
- Succinct LWE Sampling, Random Polynomials, and Obfuscation 2021
- The Cost of Adaptivity in Security Games on Graphs 2021
- The Exciting Conclusion of Tuesday's session on Zero Knowledge and Proof Systems 2021
- The Round Complexity of Quantum Zero-Knowledge 2021
- Tight Security Bounds for Micali’s SNARGs 2021
- Towards Tight Adaptive Security of Non-Interactive Key Exchange 2021
- Trojan-Resilience without Cryptography 2021
- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation 2021
- Unclonable Encryption, Revisited 2021
- Unifying Presampling via Concentration Bounds 2021
- Updatable Public Key Encryption in the Standard Model 2021
- Vector and Functional Commitments from Lattices 2021