Year | Title | Venue |

2019 | Hardness-Preserving Reductions via Cuckoo Hashing | jofc |

2019 | Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting | jofc |

2019 | (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens | jofc |

2019 | TFHE: Fast Fully Homomorphic Encryption Over the Torus | jofc |

2019 | Constant-Round Maliciously Secure Two-Party Computation in the RAM Model | jofc |

2019 | Cryptanalysis of the CLT13 Multilinear Map | jofc |

2019 | On Black-Box Complexity of Universally Composable Security in the CRS Model | jofc |

2019 | Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ | jofc |

2019 | Multi-theorem Preprocessing NIZKs from Lattices | jofc |

2019 | Blockcipher-Based Authenticated Encryption: How Small Can We Go? | jofc |

2012 | Efficient Set Operations in the Presence of Malicious Adversaries | jofc |

2012 | Ideal Multipartite Secret Sharing Schemes | jofc |

2012 | Programmable Hash Functions and Their Applications | jofc |

2012 | Security Analysis of Randomize-Hash-then-Sign Digital Signatures | jofc |

2012 | Perfectly Balanced Boolean Functions and Golić Conjecture | jofc |

2012 | Batch Verification of Short Signatures | jofc |

2012 | Bonsai Trees, or How to Delegate a Lattice Basis | jofc |

2012 | Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer | jofc |

2012 | Graph Coloring Applied to Secure Computation in Non-Abelian Groups | jofc |

2012 | On-line Ciphers and the Hash-CBC Constructions | jofc |

2013 | A Note on the Bivariate Coppersmith Theorem | jofc |

2013 | Quark: A Lightweight Hash | jofc |

2013 | Enhancements of Trapdoor Permutations | jofc |

2013 | Fully Leakage-Resilient Signatures | jofc |

2013 | Polynomial Runtime and Composability | jofc |

2013 | A Comparison of Cryptanalytic Tradeoff Algorithms | jofc |

2013 | FlipIt: The Game of “Stealthy Takeover” | jofc |

2013 | Compact Proofs of Retrievability | jofc |

2013 | A Note on Constant-Round Zero-Knowledge Proofs of Knowledge | jofc |

2013 | Round-Optimal Password-Based Authenticated Key Exchange | jofc |

2016 | Engineering Code Obfuscation | eurocrypt |

2019 | Durandal: A Rank Metric Based Signature Scheme | eurocrypt |

2019 | SeaSign: Compact Isogeny Signatures from Class Group Actions | eurocrypt |

2019 | Multi-target Attacks on the Picnic Signature Scheme and Related Protocols | eurocrypt |

2019 | New Techniques for Obfuscating Conjunctions | eurocrypt |

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

2019 | Worst-Case Hardness for LPN and Cryptographic Hashing via Code Smoothing | 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 | From Collisions to Chosen-Prefix Collisions Application to Full SHA-1 | eurocrypt |

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

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

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

2019 | Quantum Lightning Never Strikes the Same State Twice | eurocrypt |

2019 | A Modular Treatment of Blind Signatures from Identification Schemes | eurocrypt |

2019 | Efficient Verifiable Delay Functions | eurocrypt |

2019 | Ring Signatures: Logarithmic-Size, No Setup—from Standard Assumptions | eurocrypt |

2019 | Group Signatures Without NIZK: From Lattices in the Standard Model | eurocrypt |

2019 | Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources | eurocrypt |

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

2019 | On Finding Quantum Multi-collisions | eurocrypt |

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

2019 | Covert Security with Public Verifiability: Faster, Leaner, and Simpler | eurocrypt |

2019 | Efficient Circuit-Based PSI with Linear Communication | eurocrypt |

2019 | Symbolic Encryption with Pseudorandom Keys | eurocrypt |

2019 | New Techniques for Efficient Trapdoor Functions and Applications | eurocrypt |

2019 | On ELFs, Deterministic Encryption, and Correlated-Input Security | eurocrypt |

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

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

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

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

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

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

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

2019 | Two Round Information-Theoretic MPC with Malicious Security | 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 | A Quantum-Proof Non-malleable Extractor | eurocrypt |

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

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

2019 | Tight Proofs of Space and Replication | eurocrypt |

2019 | Founding Secure Computation on Blockchains | eurocrypt |

2019 | Incremental Proofs of Sequential Work | eurocrypt |

2019 | Reversible Proofs of Sequential Work | eurocrypt |

2019 | Locality-Preserving Oblivious RAM | eurocrypt |

2019 | Private Anonymous Data Access | eurocrypt |

2019 | Computationally Volume-Hiding Structured Encryption | eurocrypt |

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

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

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

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

2019 | Improved Bootstrapping for Approximate Homomorphic Encryption | eurocrypt |

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

2019 | Proof-of-Stake Protocols for Privacy-Aware Blockchains | eurocrypt |

2019 | Consensus Through Herding | eurocrypt |

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

2019 | Multi-party Virtual State Channels | eurocrypt |

2019 | Revisiting Non-Malleable Secret Sharing | eurocrypt |

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

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

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

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

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

2019 | Lower Bounds for Differentially Private RAMs | eurocrypt |

2019 | Linear Equivalence of Block Ciphers with Partial Non-Linear Layers: Application to LowMC | eurocrypt |

2019 | Distributed Differential Privacy via Shuffling | eurocrypt |

2019 | DLCT: A New Tool for Differential-Linear Cryptanalysis | eurocrypt |

2019 | XOR-Counts and Lightweight Multiplication with Fixed Elements in Binary Finite Fields | eurocrypt |

2019 | How to Leverage Hardness of Constant-Degree Expanding Polynomials over $$\mathbb {R}$$R to build $$i\mathcal {O}$$iO | eurocrypt |

2019 | Sum-of-Squares Meets Program Obfuscation, Revisited | eurocrypt |