Eurocrypt 2020
103 talks · 2020 · indexed by Breach Arc Archive. Links open each talk on YouTube.
Browse with filters →- (One) failure is not an option: Bootstrapping the search for failures in lattice-based encrypti... 2020
- Adaptively Secure ABE for DFA from k-Lin and More 2020
- An Algebraic Attack on Rank Metric Code-Based Cryptosystems 2020
- Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionles... 2020
- Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model 2020
- Broadcast-Optimal Two-Round MPC 2020
- Candidate iO From Homomorphic Encryption Schemes 2020
- Combiners for Functional Encryption, Unconditionally 2020
- Compact Adaptively Secure ABE from k-Lin: Beyond NC1 and towards NL 2020
- Compact NIZKs from Standard Assumptions on Bilinear Maps 2020
- Continuous Verifiable Delay Functions 2020
- Double-Base Chains for Scalar Multiplications on Elliptic Curves 2020
- Efficient Constructions for Almost-everywhere Secure Computation 2020
- Efficient simulation of random states and random unitaries 2020
- Everybody’s a Target: Scalability in Public-Key Encryption 2020
- Evolving Ramp Secret Sharing with a Small Gap 2020
- Extracting Randomness from Extractor-Dependent Sources 2020
- Fault Template Attacks on Block Ciphers Exploiting Fault Propagation 2020
- Finding Hash Collisions with Quantum Computers by Using Differential Trails with Smaller Probab... 2020
- Formalizing Data Deletion in the Context of the Right to be Forgotten 2020
- Fractal: Post-Quantum and Transparent Recursive Proofs from Holography 2020
- Friet: an Authenticated Encryption Scheme with Built-in Fault Detection 2020
- Generic-Group Delay Functions Require Hidden-Order Groups 2020
- Hardness of LWE on General Entropic Distributions 2020
- He Gives C-Sieves on the CSIDH 2020
- How to Extract Useful Randomness from Unreliable Sources 2020
- Implementing Grover oracles for quantum key search on AES and LowMC 2020
- Impossibility Results for Lattice-Based Functional Encryption Schemes 2020
- Improving Key-Recovery in Linear Attacks: Application to 28-round PRESENT 2020
- Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE 2020
- Integral Matrix Gram Root and Lattice Gaussian Sampling without Floats 2020
- Key Recovery from Gram--Schmidt Norm Leakage in Hash-and-Sign Signatures over NTRU Lattices 2020
- Key-Homomorphic Pseudorandom Functions from LWE with Small Modulus 2020
- Lightweight Authenticated Encryption Mode Suitable for Threshold Implementation 2020
- Low Error Efficient Computational Extractors in the CRS Model 2020
- Low Weight Discrete Logarithms and Subset Sum in $2^{0.65n}$ with Polynomial Memory 2020
- Lower Bounds for Leakage-Resilient Secret Sharing 2020
- Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS 2020
- Mathematics and Cryptography: A Marriage of Convenience? 2020
- Measure-Rewind-Measure: Tighter Quantum Random Oracle Model Proofs for One-Way to Hiding and CC... 2020
- Mind the Composition: Birthday Bound Attacks on EWCDMD and SoKAC21 2020
- Modeling for Three-Subset Division Property without Unknown Subset -- Improved Cube Attacks aga... 2020
- New Constructions of Statistical NIZKs: Dual-Mode DV-NIZKs and More 2020
- New Slide Attacks on Almost Self-Similar Ciphers 2020
- Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions 2020
- On a Generalization of Substitution-Permutation Networks: The HADES Design Strategy 2020
- On Instantiating the Algebraic Group Model from Falsifiable Assumptions 2020
- On the Memory-Tightness of Hashed ElGamal 2020
- On the Quantum Complexity of the Continuous Hidden Subgroup Problem 2020
- On the Streaming Indistinguishability of a Random Permutation and a Random Function 2020
- Optimal Merging in Quantum $k$-xor and $k$-sum Algorithms 2020
- OptORAMa: Optimal Oblivious RAM 2020
- Private Aggregation from Fewer Anonymous Messages 2020
- Private Information Retrieval with Sublinear Online Time 2020
- PSI from PaXoS: Fast, Malicious Private Set Intersection 2020
- Quantum Security Analysis of CSIDH 2020
- Quantum-access-secure message authentication via blind-unforgeability 2020
- Rational isogenies from irrational endomorphisms 2020
- Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era 2020
- s-178 Opening Remarks and Number-theoretic Cryptography 2020
- s-180 Best Paper Award 2020
- s-182 Obfuscation, Functional Encryption, and Attribute-Based Encryption 2020
- s-184 Best Young Researcher Award 2020
- s-185 Symmetric Cryptanalysis 2020
- s-186 Quantum Cryptography 2020
- s-188 Quantum Cryptanalysis 2020
- s-190 Secure Computation 2020
- s-192 IACR Membership Meeting: Part I 2020
- s-193 Symmetric Designs 2020
- s-194 Zero Knowledge 2020
- s-196 Succinct and Concretely Efficient Proof Systems 2020
- s-198 Mathematics and Cryptography: A Marriage of Convenience? 2020
- s-200 IACR Fellows Ceremony and Rump Session 2020
- s-201 Side-Channel and Fault Attacks 2020
- s-202 Verifiable Delay Functions and Randomness Extraction 2020
- s-204 Secret Sharing and Information Privacy 2020
- s-206 Fine-Grained Cryptography: A New Frontier? 2020
- s-207 Lattice-Based and Code-Based Cryptography 2020
- s-209 Public-Key Encryption and Generic Models 2020
- s-211 Closing Remarks + Feedback Session 2020
- s-212 Panel Discussion on Contact Tracing 2020
- Secure Multi-party Quantum Computation with a Dishonest Majority 2020
- Security of Hedged Fiat-Shamir Signatures under Fault Attacks 2020
- Security under Message-Derived Keys: Signcryption in iMessage 2020
- Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability 2020
- Side-channel Masking with Pseudo-Random Generator 2020
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes 2020
- Signatures from Sequential-OR Proofs 2020
- SPARKs: Succinct Parallelizable Arguments of Knowledge 2020
- Stacked Garbling for Disjunctive Zero-Knowledge Proofs 2020
- Statistical ZAP Arguments 2020
- Statistical ZAPR Arguments from Bilinear Maps 2020
- Statistical Zaps and New Oblivious Transfer Protocols 2020
- Succinct Non-Interactive Secure Computation 2020
- The Price of Active Security in Cryptographic Protocols 2020
- The Retracing Boomerang Attack 2020
- Tight Security Bounds for Double-block Hash-then-Sum MACs 2020
- Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications 2020
- TNT: How to Tweak a Block Cipher 2020
- Tornado: Automatic Generation of Probing-Secure Masked Bitsliced Implementations 2020
- Transparent SNARKs from DARK Compilers 2020
- Two-Round Oblivious Transfer from CDH or LPN 2020
- Which Languages Have 4-Round Fully Black-Box Zero-Knowledge Arguments from One-Way Functions? 2020