Year | Title | Venue |

2019 | Efficient Search for Optimal Diffusion Layers of Generalized Feistel Networks | tosc |

2019 | Reconstructing an S-box from its Difference Distribution Table | tosc |

2016 | Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds | asiacrypt |

2019 | Lower Bounds for Differentially Private RAMs | eurocrypt |

2019 | Beyond Birthday Bound Secure MAC in Faulty Nonce Model | eurocrypt |

2019 | Tight Time-Memory Trade-Offs for Symmetric Encryption | eurocrypt |

2019 | Non-Malleable Codes Against Bounded Polynomial Time Tampering | eurocrypt |

2019 | Continuous Non-Malleable Codes in the 8-Split-State Model | eurocrypt |

2019 | Correlated-Source Extractors and Cryptography with Correlated-Random Tapes | eurocrypt |

2019 | Revisiting Non-Malleable Secret Sharing | eurocrypt |

2019 | Multi-party Virtual State Channels | eurocrypt |

2019 | Aggregate Cash Systems: A Cryptographic Investigation of Mimblewimble | eurocrypt |

2019 | Consensus Through Herding | eurocrypt |

2019 | Homomorphic Secret Sharing from Lattices Without FHE | eurocrypt |

2019 | Improved Bootstrapping for Approximate Homomorphic Encryption | eurocrypt |

2019 | Minicrypt Primitives with Algebraic Structure and Applications | eurocrypt |

2019 | Attacks only Get Better: How to Break FF3 on Large Domains | eurocrypt |

2019 | Session Resumption Protocols and Efficient Forward Security for TLS 1.3 0-RTT | eurocrypt |

2019 | An Analysis of NIST SP 800-90A | eurocrypt |

2019 | Computationally Volume-Hiding Structured Encryption | eurocrypt |

2019 | Locality-Preserving Oblivious RAM | eurocrypt |

2019 | Private Anonymous Data Access | eurocrypt |

2019 | Reversible Proofs of Sequential Work | eurocrypt |

2019 | Incremental Proofs of Sequential Work | eurocrypt |

2019 | Tight Proofs of Space and Replication | eurocrypt |

2019 | Founding Secure Computation on Blockchains | eurocrypt |

2019 | Uncovering Algebraic Structures in the MPC Landscape | eurocrypt |

2019 | Quantum Circuits for the CSIDH: Optimizing Quantum Evaluation of Isogenies | eurocrypt |

2019 | A Quantum-Proof Non-malleable Extractor | eurocrypt |

2019 | A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model | eurocrypt |

2019 | Degree 2 is Complete for the Round-Complexity of Malicious MPC | eurocrypt |

2019 | Two Round Information-Theoretic MPC with Malicious Security | eurocrypt |

2019 | Designated-Verifier Pseudorandom Generators, and Their Applications | eurocrypt |

2019 | Reusable Designated-Verifier NIZKs for all NP from CDH | eurocrypt |

2019 | Designated Verifier/Prover and Preprocessing NIZKs from Diffie-Hellman Assumptions | eurocrypt |

2019 | Building an Efficient Lattice Gadget Toolkit: Subgaussian Sampling and More | eurocrypt |

2019 | Approx-SVP in Ideal Lattices with Pre-processing | eurocrypt |

2019 | The General Sieve Kernel and New Records in Lattice Reduction | eurocrypt |

2019 | Misuse Attacks on Post-quantum Cryptosystems | eurocrypt |

2019 | An Algebraic Approach to Maliciously Secure Private Set Intersection | eurocrypt |

2019 | On Quantum Advantage in Information Theoretic Single-Server PIR | eurocrypt |

2019 | Secret-Sharing Schemes for General and Uniform Access Structures | eurocrypt |

2019 | Towards Optimal Robust Secret Sharing with Security Against a Rushing Adversary | eurocrypt |

2019 | Simple Schemes in the Bounded Storage Model | eurocrypt |

2019 | From Collisions to Chosen-Prefix Collisions Application to Full SHA-1 | eurocrypt |

2019 | Preimage Attacks on Round-Reduced Keccak-224/256 via an Allocating Approach | eurocrypt |

2019 | bison Instantiating the Whitened Swap-Or-Not Construction | eurocrypt |

2019 | Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing | eurocrypt |

2019 | New Techniques for Obfuscating Conjunctions | eurocrypt |

2019 | Distributional Collision Resistance Beyond One-Way Functions | eurocrypt |

2019 | Quantum Security Analysis of AES | tosc |

2019 | New Conditional Cube Attack on Keccak Keyed Modes | tosc |

2019 | The Exact Security of PMAC with Two Powering-Up Masks | tosc |

2019 | On Beyond-Birthday-Bound Security: Revisiting the Development of ISO/IEC 9797-1 MACs | tosc |

2019 | Classification of Balanced Quadratic Functions | tosc |

2019 | ZOCB and ZOTR: Tweakable Blockcipher Modes for Authenticated Encryption with Full Absorption | tosc |

2004 | Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data | eurocrypt |

1999 | How to Enhance the Security of Public-Key Encryption at Minimum Cost | pkc |

2006 | Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices | tcc |

2005 | Evaluating 2-DNF Formulas on Ciphertexts | tcc |

2006 | Calibrating Noise to Sensitivity in Private Data Analysis | tcc |

2004 | How Far Can We Go Beyond Linear Cryptanalysis? | asiacrypt |

2004 | Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology | tcc |

2004 | Physically Observable Cryptography (Extended Abstract) | tcc |

2000 | Selecting Cryptographic Key Sizes | pkc |

2001 | Selecting Cryptographic Key Sizes | jofc |

2001 | The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes | pkc |

2004 | Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions | crypto |

2009 | Practical Chosen Ciphertext Secure Encryption from Factoring | eurocrypt |

2011 | A Single-Key Attack on the Full GOST Block Cipher | fse |

2011 | Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors | ches |

2012 | Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems | crypto |

2011 | Computer-Aided Security Proofs for the Working Cryptographer | crypto |

2010 | Rotational Rebound Attacks on Reduced Skein | asiacrypt |

2016 | The Magic of ELFs | crypto |

2017 | Nanofocused X-Ray Beam to Reprogram Secure Circuits | ches |

2008 | Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency | tcc |

2013 | On the Function Field Sieve and the Impact of Higher Splitting Probabilities | crypto |

2015 | GCM Security Bounds Reconsidered | fse |

2005 | Finding Collisions in the Full SHA-1 | crypto |

2006 | New Attacks on RSA with Small Secret CRT-Exponents | pkc |

2007 | Side Channel Cryptanalysis of a Higher Order Masking Scheme | ches |

2009 | Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint | pkc |

2011 | Counting Points on Genus 2 Curves with Real Multiplication | asiacrypt |

2011 | A Framework for Practical Universally Composable Zero-Knowledge Protocols | asiacrypt |

2006 | Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures | eurocrypt |

2005 | Cryptanalysis of the Hash Functions MD4 and RIPEMD | eurocrypt |

2016 | Breaking the Circuit Size Barrier for Secure Computation Under DDH | crypto |

2005 | How to Break MD5 and Other Hash Functions | eurocrypt |

2015 | A Physical Approach for Stochastic Modeling of TERO-Based TRNG | ches |

2017 | The First Collision for Full SHA-1 | crypto |

2008 | Lattice-Based Identification Schemes Secure Under Active Attacks | pkc |

2011 | Efficient Authentication from Hard Learning Problems | eurocrypt |

2010 | Parallel Repetition Theorems for Interactive Arguments | tcc |

2013 | Counter-cryptanalysis: reconstructing Flame's new variant collision attack | crypto |

2005 | Successfully Attacking Masked AES Hardware Implementations | ches |

2017 | Identity-Based Encryption from the Diffie-Hellman Assumption | crypto |

2006 | Finding SHA-1 Characteristics: General Results and Applications | asiacrypt |

2018 | On Basing Search SIVP on NP-Hardness | tcc |

2008 | The Random Oracle Model and the Ideal Cipher Model Are Equivalent | crypto |