| 2026 | EuroCrypt | Computationally Succinct Authentication from DCR - Attribute-Based Laconic Function Evaluation and More. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2026 | SP | A Maliciously-Secure Post-Quantum OPRF from Crypto Dark Matter. | Diego F. Aranha, Aron van Baarsen, Adam Blatchley Hansen, Kent Nielsen, Peter Scholl |
| 2025 | CCS | Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-Head. | James Hsin-yu Chiang, Ivan Damgrd, William R. Duro, Sunniva Engan, Sebastian Kolby, Peter Scholl |
| 2025 | CRYPTO | Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures. | Carsten Baum, Ward Beullens, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Kloo, Christian Majenz, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl |
| 2025 | CRYPTO | Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2025 | EuroCrypt | Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs. | Amit Agarwal, Carsten Baum, Lennart Braun, Peter Scholl |
| 2025 | SP | Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations. | Alexander Kyster, Frederik Huss Nielsen, Sabine Oechsner, Peter Scholl |
| 2025 | TCC | On the Impossibility of Actively Secure Distributed Samplers. | Damiano Abram, Serge Fehr, Maciej Obremski, Peter Scholl |
| 2025 | TCC | Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. | Amik Raj Behera, Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2024 | ASIACRYPT | One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. | Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl |
| 2024 | ASIACRYPT | Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. | Elette Boyle, Lisa Kohl, Zhe Li, Peter Scholl |
| 2024 | CRYPTO | Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. | Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl |
| 2024 | EuroCrypt | Succinct Homomorphic Secret Sharing. | Damiano Abram, Lawrence Roy, Peter Scholl |
| 2024 | TCC | Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing. | Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl |
| 2023 | ASIACRYPT | Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. | Katharina Boudgoust, Peter Scholl |
| 2023 | CRYPTO | Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. | Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Kloo, Emmanuela Orsini, Lawrence Roy, Peter Scholl |
| 2023 | EuroCrypt | Oblivious Transfer with Constant Computational Overhead. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl |
| 2022 | CCS | Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. | Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart |
| 2022 | CRYPTO | An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. | Damiano Abram, Ivan Damgrd, Claudio Orlandi, Peter Scholl |
| 2022 | CRYPTO | Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$. | Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl |
| 2022 | CRYPTO | Correlated Pseudorandomness from Expand-Accumulate Codes. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl |
| 2022 | CRYPTO | Le Mans: Dynamic and Fluid MPC for Dishonest Majority. | Rahul Rachuri, Peter Scholl |
| 2022 | EuroCrypt | Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. | Damiano Abram, Peter Scholl, Sophia Yakoubov |
| 2022 | PKC | Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. | Damiano Abram, Peter Scholl |
| 2022 | PKC | On the Bottleneck Complexity of MPC with Correlated Randomness. | Claudio Orlandi, Divya Ravi, Peter Scholl |
| 2022 | SP | Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. | Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits |
| 2022 | SCN | Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. | Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen |
| 2021 | CCS | Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. | Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benot Razet, Peter Scholl |
| 2021 | CRYPTO | Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. | Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl |
| 2021 | CRYPTO | Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl |
| 2021 | EuroCrypt | The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. | Claudio Orlandi, Peter Scholl, Sophia Yakoubov |
| 2021 | PKC | Banquet: Short and Fast Signatures from AES. | Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha |
| 2020 | CRYPTO | Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. | Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl |
| 2020 | CRYPTO | Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. | Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez |
| 2020 | CRYPTO | Efficient Pseudorandom Correlation Generators from Ring-LPN. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl |
| 2020 | FOCS | Correlated Pseudorandom Functions from Variable-Density LPN. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl |
| 2020 | SCN | Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. | Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramn Troncoso-Pastoriza |
| 2019 | CCS | Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl |
| 2019 | CRYPTO | Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. | Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl |
| 2019 | EuroCrypt | Homomorphic Secret Sharing from Lattices Without FHE. | Elette Boyle, Lisa Kohl, Peter Scholl |
| 2019 | SP | New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. | Ivan Damgrd, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev |
| 2018 | ASIACRYPT | Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). | Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez |
| 2018 | CRYPTO | SPDℤ | Ronald Cramer, Ivan Damgrd, Daniel Escudero, Peter Scholl, Chaoping Xing |
| 2018 | CRYPTO | TinyKeys: A New Approach to Efficient Multi-Party Computation. | Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez |
| 2018 | PKC | Compact Zero-Knowledge Proofs of Small Hamming Weight. | Ivan Damgrd, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin |
| 2018 | PKC | Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. | Peter Scholl |
| 2017 | ACNS | Faster Secure Multi-party Computation of AES and DES Using Lookup Tables. | Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek |
| 2017 | ASIACRYPT | Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. | Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez |
| 2016 | CCS | MPC-Friendly Symmetric Key Primitives. | Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, Nigel P. Smart |
| 2016 | CCS | MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. | Marcel Keller, Emmanuela Orsini, Peter Scholl |
| 2016 | TCC | Efficient Secure Multiparty Computation with Identifiable Abort. | Carsten Baum, Emmanuela Orsini, Peter Scholl |
| 2015 | ASIACRYPT | A Unified Approach to MPC with Preprocessing Using OT. | Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, Peter Scholl |
| 2015 | CRYPTO | Actively Secure OT Extension with Optimal Overhead. | Marcel Keller, Emmanuela Orsini, Peter Scholl |
| 2014 | ASIACRYPT | Efficient, Oblivious Data Structures for MPC. | Marcel Keller, Peter Scholl |
| 2013 | CCS | An architecture for practical actively secure MPC with dishonest majority. | Marcel Keller, Peter Scholl, Nigel P. Smart |
| 2013 | ESORICS | Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits. | Ivan Damgrd, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, Nigel P. Smart |