Crypto 2021
132 talks · 2021 · indexed by Breach Arc Archive. Links open each talk on YouTube.
Browse with filters →- A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds 2021
- A Compressed Sigma-Protocol Theory for Lattices 2021
- A Logarithmic Lower Bound for Oblivious RAM (for all parameters) 2021
- A New Simple Technique to Bootstrap Various Lattice Zero-Knowledge Proofs to QROM Secure NIZKs 2021
- A Rational Protocol Treatment of 51% Attacks 2021
- Adaptive Extractors and their Application to Leakage Resilient Secret Sharing 2021
- An Algebraic Framework for Universal and Updatable SNARKs 2021
- Asymptotically-Good Arithmetic Secret Sharing over Z/p^{\ell}Z with Strong Multiplication and I... 2021
- ATLAS: Efficient and Scalable MPC in the Honest Majority Setting 2021
- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model 2021
- Broadcast-Optimal Two Round MPC with an Honest Majority 2021
- Compact Ring Signatures from Learning With Errors 2021
- Composition with Knowledge Assumptions 2021
- Compressing Proofs of k-Out-Of-n Partial Knowledge 2021
- Computational Hardness of Optimal Fair Computation: Beyond Minicrypt 2021
- Constructing Locally Leakage-resilient Linear Secret-sharing Schemes 2021
- Counterexamples to New Circular Security Assumptions Underlying iO 2021
- Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques 2021
- Deniable Fully Homomorphic Encryption from Learning With Errors 2021
- Differential-Linear Cryptanalysis from an Algebraic Perspective 2021
- Does Fiat-Shamir Require a Cryptographic Hash Function? 2021
- DualRing: Generic Construction of Ring Signatures with Efficient Instantiations 2021
- Efficient Information-Theoretic Multi-Party Computation over Non-Commutative Rings 2021
- Efficient Key Recovery for all HFE Signature Variants 2021
- Fine-grained Secure Attribute-based Encryption 2021
- Fluid MPC: Secure Multiparty Computation with Dynamic Participants 2021
- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE 2021
- Game-Theoretic Fairness Meets Multi-Party Protocols: The Case of Leader Election 2021
- Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments 2021
- Hidden Cosets and Applications to Unclonable Cryptography 2021
- How to Meet Ternary LWE Keys 2021
- Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits 2021
- Improved Computational Extractors and their Applications 2021
- Improved torsion-point attacks on SIDH variants 2021
- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange 2021
- Large Message Homomorphic Secret Sharing from DCR and Applications 2021
- Lattice Reduction with Approximate Enumeration Oracles: Practical Algorithms and Concrete Perfo... 2021
- Limits on the Adaptive Security of Yao’s Garbling 2021
- Linear Cryptanalysis of FF3-1 and FEA 2021
- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2] 2021
- Lower bounds on lattice sieving and information set decoding 2021
- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunction... 2021
- Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks 2021
- MHz2k: MPC from HE over $\mathbb{Z}_{2^k}$ with New Packing, Simpler Reshare, and Better ZKP 2021
- MoSS: Modular Security Specifications Framework 2021
- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applica... 2021
- Multi-Input Quadratic Functional Encryption from Pairings 2021
- Multi-theorem Designated-Verifier NIZK for QMA 2021
- MuSig2: Simple Two-Round Schnorr Multi-Signatures 2021
- New Approaches for Quantum Copy-Protection 2021
- No Time to Hash:On Super-Efficient Entropy Accumulation 2021
- Non-Interactive Batch Arguments for NP from Standard Assumptions 2021
- Non-Interactive Secure Multiparty Computation for Symmetric Functions, Revisited: More Efficien... 2021
- Non-Malleable Codes for Bounded Parallel-Time Tampering 2021
- Oblivious Key-Value Stores and Amplification for Private Set Intersection 2021
- Oblivious RAM with Worst-Case Logarithmic Overhead 2021
- On the Concurrent Composition of Quantum Zero-Knowledge 2021
- On the Possibility of Basing Cryptography on $\EXP \neq \BPP$ 2021
- On the Round Complexity of Black-Box Secure MPC 2021
- On the Round Complexity of Secure Quantum Computation 2021
- On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model 2021
- One-Way Functions Imply Secure Computation in a Quantum World 2021
- Proof-Carrying Data without Succinct Arguments 2021
- Provable Security Analysis of FIDO2 2021
- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwi... 2021
- Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact 2021
- Quadratic Secret Sharing and Conditional Disclosure of Secrets 2021
- Quantum Collision Attacks on Reduced SHA-256 and SHA-512 2021
- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved 2021
- Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-User Setting 2021
- Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort 2021
- s-10: Lattice Cryptography 2021
- s-12: Lattice Cryptanalysis 2021
- s-136: Quantum Cryptography 1 (continued) 2021
- s-138: Signatures (continued) 2021
- s-140: Multi-Party Computation 1 2021
- s-144: Multi-Party Computation 2 2021
- s-146: Multi-Party Computation 2 (continued) 2021
- s-14: Quantum Cryptography 2 2021
- s-150: Secret Sharing 2021
- s-151: Applied Cryptography and Side Channels 2021
- s-153: Crypto 2021 Rump Session 2021
- s-156: Secret Sharing (continued) 2021
- s-158: Zero-Knowledge 2021
- s-162: Foundations (continued) 2021
- s-164: Low-Complexity Cryptography 2021
- s-166: Protocols + Wrap Up 2021
- s-16: Models 2021
- s-170: Test of Time Awards 2021
- s-17: Invited Talk II (Jens Groth) 2021
- s-18: Succinct Arguments 2021
- s-1: Opening Remarks + Signatures 2021
- s-20: Cryptanalysis 2021
- s-22: Cryptanalysis (continued) 2021
- s-24: Codes and Extractors 2021
- s-26: Multi-Party Computation 3 2021
- s-28: Encryption++ 2021
- s-2: Invited Talk I (Vanessa Teague) 2021
- s-30: Foundations 2021
- s-6: Quantum Cryptography 1 2021
- s-8: Award Papers 2021
- Secure Computation from One-Way Noisy Communication, or: Anti-Correlation via Anti-Concentratio... 2021
- Secure Wire Shuffling in the Probing Model 2021
- Separating Adaptive Streaming from Oblivious Streaming using the Bounded Storage Model 2021
- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes 2021
- SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential... 2021
- Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN 2021
- SSE and SSD: Page-Efficient Searchable Symmetric Encryption 2021
- Sublinear GMW-Style Compiler for MPC with Preprocessing 2021
- Subquadratic SNARGs in the Random Oracle Model 2021
- Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices 2021
- Sumcheck Arguments and their Applications 2021
- Targeted Lossy Functions and Applications 2021
- The $t$-wise Independence of Substitution-Permutation Networks 2021
- The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3 2021
- Thinking Outside the Superbox 2021
- Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits 2021
- Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer 2021
- Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions 2021
- Tight State-Restoration Soundness in the Algebraic Group Model 2021
- Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\... 2021
- Time- and Space-Efficient Arguments from Groups of Unknown Order 2021
- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs 2021
- Towards faster polynomial-time lattice reduction 2021
- Towards Tight Random Probing Security 2021
- Traceable Secret Sharing and Applications 2021
- Two-Round Trip Schnorr Multi-Signatures via Delinearized Witnesses 2021
- Unconditional Communication-Efficient MPC via Hall's Marriage Theorem 2021
- Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$ 2021
- White Box Traitor Tracing 2021
- Witness Authenticating NIZKs and Applications 2021
- You Only Speak Once: Secure MPC with Stateless Ephemeral Roles 2021