Crypto 2020

100 talks · 2020 · indexed by Breach Arc Archive. Links open each talk on YouTube.

• 2020 IACR Distinguished Lecture by Silvio Micali: Our Models and Us 2020
• A Classification of Computational Assumptions in the Algebraic Group Model 2020
• A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformati... 2020
• A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge 2020
• A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem 2020
• A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth ... 2020
• Adaptively Secure Constrained Pseudorandom Functions in the Standard Model 2020
• Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback 2020
• Alzette: a 64-bit ARX-box (feat. CRAX and TRAX) 2020
• Amplifying the Security of Functional Encryption, Unconditionally 2020
• Anonymous Tokens with Private Metadata Bit 2020
• Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields 2020
• Automatic Verification of Differential Characteristics: Application to Reduced Gimli 2020
• Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting) 2020
• Black-Box Transformations from Passive to Covert Security with Public Verifiability 2020
• Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing 2020
• Collusion Resistant Watermarkable PRFs from Standard Assumptions 2020
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment 2020
• Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics 2020
• Cryptanalysis of LEDAcrypt 2020
• Cryptanalysis of The Lifted Unbalanced Oil Vinegar Signature Scheme 2020
• Cryptanalysis Results on Spook: Bringing Full-round Shadow-512 to the Light 2020
• Cryptanalytic Extraction of Neural Network Models 2020
• Crypto for the People, Invited talk at Crypto 2020 by Seny Kamara 2020
• Delegation with Updatable Unambiguous Proofs and PPAD-Hardness 2020
• Dynamic Decentralized Functional Encryption 2020
• Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability 2020
• Efficient Pseudorandom Correlation Generators from Ring-LPN 2020
• Fast and Secure Updatable Encryption 2020
• Fast reduction of algebraic lattices over cyclotomic fields 2020
• Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k... 2020
• Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs 2020
• Fully Deniable Interactive Encryption 2020
• Functional Encryption for Attribute-Weighted Sums from k-Lin 2020
• Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All ... 2020
• Guaranteed Output Delivery Comes Free in Honest Majority MPC 2020
• Handling Adaptive Compromise for Practical Encryption Schemes 2020
• Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits 2020
• Incompressible Encodings 2020
• Indifferentiability for Public Key Cryptosystems 2020
• Interactive Proofs for Social Graphs 2020
• Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP 2020
• Lattice-Based Blind Signatures, Revisited 2020
• Leakage-Resilient Key Exchange and Two-Seed Extractors 2020
• Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model 2020
• LWE with Side Information: Attacks and Concrete Security Estimation 2020
• Mode-Level vs. Implementation-Level Physical Security in Symmetric Cryptography: A Practical Gu... 2020
• MPC with Friends and Foes 2020
• Multiparty Generation of an RSA Modulus 2020
• Nearly Optimal Robust Secret Sharing against Rushing Adversaries 2020
• New Constructions of Hinting PRGs, OWFs with Encryption, and more 2020
• New Techniques for Traitor Tracing: Size N^{1/3} and More from Pairings 2020
• New Techniques for Zero-Knowledge: Leveraging Inefficient Provers to Reduce Assumptions, Intera... 2020
• NIZK from LPN and Trapdoor Hash via Approximate-Correlation Intractability 2020
• Non-Interactive Zero-Knowledge Arguments for QMA, with preprocessing 2020
• Non-Malleability against Polynomial Tampering 2020
• Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model 2020
• On Succinct Arguments and Witness Encryption from Groups 2020
• Order-Fairness for Byzantine Consensus 2020
• Out of Oddity -- New Cryptanalytic Techniques against Symmetric Primitives Optimized for Integr... 2020
• Overcoming Impossibility Results in Composable Security using Interval-Wise Guarantees 2020
• Practical Product Proofs for Lattice Commitments 2020
• Private Set Intersection in the Internet Setting From Lightweight Oblivious PRF 2020
• Quantifying the Security Cost of Migrating Protocols to Practice 2020
• Random Probing Security: Verification, Composition, Expansion and New Constructions 2020
• Random Self-reducibility of Ideal-SVP via Arakelov Random Walks 2020
• Reverse Firewalls for Actively Secure MPCs 2020
• Round-optimal Black-box Commit-and-prove with Succinct Communication 2020
• Rounding in the Rings 2020
• s-10: Rump Session 2020
• s-121: Multiparty Computation 3 2020
• s-124: Lattices and Related Problems 2020
• s-126: Post Quantum Crypto 2 2020
• s-128: Post Quantum Crypto 1 2020
• s-12: Multiparty Computation 1 2020
• s-130: Test of Time Award Ceremony + Cryptanalysis 1 2020
• s-14: Real-world Crypto 2020
• s-16: Zero Knowledge Proofs 2020
• s-1: Opening remarks + Security Models 2020
• s-20: NIZKs, Consensus, Delay Functions 2020
• s-22: Leakage and Outsourced Encryption 2020
• s-26: Cryptanalysis 2 2020
• s-28: Constructions 2020
• s-30: Multiparty Computation 2 2020
• s-6: Public-key, Functional, & Witness Encryption 2020
• Scalable Pseudorandom Quantum States 2020
• Security Analysis and Improvements for the IETF MLS Standard for Group Messaging 2020
• Security Analysis of NIST CTR-DRBG 2020
• Shorter Non-Interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages 2020
• Slide Reduction, Revisited—Filling the Gaps in SVP Approximation 2020
• Spartan: Efficient and general-purpose zkSNARKs without trusted setup 2020
• Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path 2020
• The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers 2020
• The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More 2020
• The Memory-Tightness of Authenticated Encryption 2020
• The Summation-Truncation Hybrid: Reusing Discarded Bits for Free 2020
• Time-Space Tradeoffs and Short Collisions in Merkle-Damgård Hash Functions 2020
• Two-Sided Malicious Security for Private Intersection-Sum with Cardinality 2020
• Universally Composable Relaxed Password Authenticated Key Exchange 2020
• Verifiable Registration-Based Encryption 2020