Peer-reviewed
2024
- Efficient Maliciously Secure Oblivious Exponentiations, with Jens Berlips, Walther Chen, Ivan Damgård, Kevin M. Esvelt, Leonard Foner, Dana Gretton, Martin Kysel, Ronald L. Rivest, Lawrence Roy, Francesca Sage-Ling, Adi Shamir, Vinod Vaikuntanathan, Lynn Van Hauwe, Theia Vogel, Benjamin Weinstein-Raun, Daniel Wichs, Steve Wooster, Andrew C. Yao, Yu Yu. To appear in Communications in Cryptology 2024, Issue 3
- One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures, with Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, and Peter Scholl. To appear at ASIACRYPT 2024
- CaSCaDE: (Time-Based) Cryptography from Space Communications DElay, with Bernardo David, Elena Pagnin and Akira Takahashi. To appear at SCN 2024
- Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs, with Nikolas Melissaris, Rahul Rachuri and Peter Scholl. CRYPTO 2024
2023
- SoK: Vector OLE-based Zero-Knowledge Protocols, with Samuel Dittmer, Peter Scholl and Xiao Wang. DCC 2023
- SoK: Privacy-Enhancing Technologies in Finance, with James Hsin-Yu Chiang, Bernardo David and Tore Frederiksen. AFT 2023
- Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head, with Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooss, Emmanuela Orsini, Lawrence Roy and Peter Scholl. CRYPTO 2023
- Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions, with Diego F. Aranha, Kristian Gjøsteen and Tjerand Silde. CCS 2023
- CRAFT: Composable Randomness and Almost Fairness from Time, with Bernardo David, Rafael Dowsley, Ravi Kishore, Sabine Oechsner and Jesper Buus Nielsen. PKC 2023
- EAGLE: Efficient Privacy Preserving Smart Contracts, with James Hsin-yu Chiang, Bernardo David and Tore Kasper Frederiksen. Financial Crypto 2023
2022
- A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols, with Bernardo David and Rafael Dowsley. ProvSec 2022
- MoZZarella: Efficient Vector-OLE and Zero-Knowledge proofs over Z2k, with Lennart Braun, Alexander Munch-Hansen and Peter Scholl. CRYPTO 2022
- FETA: Efficient Threshold Designated-Verifier Zero-Knowledge proofs, with Robin Jadoul and Emmanuela Orsini and Peter Scholl and Nigel P. Smart. ACM CCS 2022
- SoK: Mitigation of Front-running in Decentralized Finance, with James Hsin-yu Chiang, Bernardo David, Tore Kasper Frederiksen and Lorenzo Gentile. Financial Crypto DeFi Workshop 2022
2021
- Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k, with Lennart Braun, Alexander Munch-Hansen and Peter Scholl. ACM CCS 2021
- Mac’n’Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions, with Alex J. Malozemoff, Marc Rosen and Peter Scholl. CRYPTO 2021
- Fairness in the Eyes of the Data: Certifying Machine-Learning Models, with Shahar Segal, Yossi Adi, Benny Pinkas, Chaya Ganesh and Joseph Keshet. AAAI/ACM 2021 Conference on Artificial Intelligence, Ethics and Society. There also exists a poster which you can see here
- P2DEX: Privacy-Preserving Decentralized Currency Exchange, with Bernardo David and Tore Frederiksen. ACNS 2021
- Lattice-Based Proof of Shuffle and Applications to Electronic Voting, with Diego Aranha, Kristian Gjøsteen, Tjerand Silde and Thor Tunge. CT-RSA 2021
- Banquet: Short and Fast Signatures from AES, with Cyprien Delpech de Saint Guilhem and Daniel Kales and Emmanuela Orsini and Peter Scholl and Greg Zaverucha. PKC 2021
- A Foundation of Time-Lock Puzzles in UC, with Bernardo David, Rafael Dowsley, Sabine Oechsner and Jesper Buus Nielsen. Eurocrypt 2021
2020
- Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE, with Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl and Juan Ramón Troncoso-Pastoriza, SCN 2020. An extended version of the paper has also been published in the Journal of Computer Security.
- Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability, with Emmanuela Orsini, Peter Scholl and Eduardo Soria-Vazquez, CRYPTO 2020
- PESTO: Proactively Secure Distributed Single Sign-On, or How to Trust a Hacked Server, with Tore K. Frederiksen, Julia Hesse, Anja Lehmann and Avishay Yanai, EuroS&P 2020
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography, with Ariel Nof, PKC 2020
- Insured MPC: Efficient Secure Multiparty Computation with Punishable Abort, with Bernardo David and Rafael Dowsley, Financial Crypto 2020
2019
- Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ, with Daniele Cozzo and Nigel P. Smart, SAC 2019
2018
- Towards Practical Lattice-Based One-Time Linkable Ring Signatures, with Huang Lin and Sabine Oechsner, ICICS 2018
- More Efficient Commitments from Structured Lattice Assumptions, with Ivan Damgård and Vadim Lyubashevsky and Sabine Oechsner and Chris Peikert, SCN 2018
- Turning Your Weakness Into a Strength: Watermarking Deep Neural Networks by Backdooring, with Yossi Adi and Moustapha Cisse and Joseph Keshet and Benny Pinkas, USENIX 2018.
- Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits, with Jonathan Bootle and Andrea Cerulli and Rafael del Pino and Jens Groth and Vadim Lyubashevsky, CRYPTO 2018
2016
- How to prove knowledge of small secrets, with Ivan Damgård and Kasper Green Larsen and Michael Nielsen, CRYPTO 2016
- Efficient Secure Multiparty Computation with Identifiable Abort, with Emmanuela Orsini and Peter Scholl, TCC-B 2016. A poster of this work can be found here
- On Garbling Schemes with and without Privacy, SCN 2016
- Better Preprocessing for Secure Multiparty Computation, with Ivan Damgård and Tomas Toft and Rasmus Lauritzen, ACNS 2016
2014
- Publicly Auditable Secure Multiparty Computation, with Ivan Damgård and Claudio Orlandi, SCN 2014
Peer-reviewed work outside of Cryptography
- Studying the global spatial randomness of impact craters on Mercury, Venus, and the Moon with geodesic neighborhood relationships (together with my childhood friend Christian Riedel and others)
Preprints
- Simple Amortized Proofs of Shortness for Linear Relations over Polynomial Rings, with Vadim Lyubashevsky