Peter Scholl


✉


Home  •  Publications  •  Activities

More publication details are available at Google Scholar and dblp.

Preprints and Miscellaneous Works

  1. Covert Attacks on Machine Learning Training in Passively Secure MPC
    Matthew Jagielski, Daniel Escudero, Rahul Rachuri, and Peter Scholl
    (eprint, 2025)
  2. FAEST for Memory-Constrained Devices with Side-Channel Protections
    Diego F Aranha, Johan Degn, Jonathan Eilath, Kent Nielsen, and Peter Scholl
    (eprint, 2025)
  3. Privately constrained PRFs from DCR: Puncturing and bounded waring rank
    Amik Raj Behera, Pierre Meyer, Claudio Orlandi, Lawrence Roy, and Peter Scholl
    (eprint, 2025)
  4. FAEST Signature Algorithm
    Carsten Baum, Ward Beullens, Lennart Braun, Cyprien de Saint Guilhem, Michael Klooß, Christian Majenz, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, and Peter Scholl
    Submission to NIST Post-Quantum Cryptography Standardization Process, 2023
    (website)
  5. On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions
    Damiano Abram, Maciej Obremski, and Peter Scholl
    (eprint, 2023)
  6. Encrypt Your Channels! On the (in)security of GMW with authenticated communication
    Peter Scholl
    Talk at TPMPC 2019 Rump Session, Bar-Ilan University
    (eprint)

Peer-Reviewed Conference Publications

2025

  1. Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-Head
    James Hsin-Yu Chiang, Ivan Damgård, William R Duro, Sunniva Engan, Sebastian Kolby, and Peter Scholl
    ACM CCS 2025
    (eprint)
  2. 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, and Peter Scholl
    CRYPTO 2025
  3. Silent circuit relinearisation: Sublinear-size (boolean and arithmetic) garbled circuits from DCR
    Pierre Meyer, Claudio Orlandi, Lawrence Roy, and Peter Scholl
    CRYPTO 2025
    (eprint)
  4. MAESTRO: Multi-Party AES Using Lookup Tables
    Hiraku Morita, Erik Pohle, Kunihiko Sadakane, Peter Scholl, Kazunari Tozawa, and Daniel Tschudi
    USENIX Security 2025
    (eprint)
  5. Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations
    Alexander Kyster, Frederik Huss Nielsen, Sabine Oechsner, and Peter Scholl
    2025 IEEE Symposium on Security and Privacy (S&P)
    (eprint)
  6. Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs
    Amit Agarwal, Carsten Baum, Lennart Braun, and Peter Scholl
    EUROCRYPT 2025

2024

  1. Rate-1 arithmetic garbling from homomorphic secret sharing
    Pierre Meyer, Claudio Orlandi, Lawrence Roy, and Peter Scholl
    TCC 2024
    (eprint)
  2. Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
    Elette Boyle, Lisa Kohl, Zhe Li, and Peter Scholl
    ASIACRYPT 2024
    (eprint)
  3. 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, and Peter Scholl
    ASIACRYPT 2024
    (eprint)
  4. Cheater identification on a budget: MPC with identifiable abort from pairwise macs
    Carsten Baum, Nikolas Melissaris, Rahul Rachuri, and Peter Scholl
    CRYPTO 2024
    (eprint)
  5. Succinct homomorphic secret sharing
    Damiano Abram, Lawrence Roy, and Peter Scholl
    EUROCRYPT 2024
    (eprint)

2023

  1. Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
    Katharina Boudgoust and Peter Scholl
    ASIACRYPT 2023
    (eprint)
  2. Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head
    Carsten Baum, Lennart Braun, Cyprien de Saint Guilhem, Michael Klooß, Lawrence Roy, and Peter Scholl
    CRYPTO 2023
    (eprint)
  3. Oblivious Transfer with Constant Computational Overhead
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl
    EUROCRYPT 2023
    (eprint)

2022

  1. Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs
    Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, and Nigel P. Smart
    ACM CCS 2022
    (eprint)
  2. Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE
    Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel Paul Smart, and Barry Van Leeuwen
    SCN 2022
    (eprint)
  3. Le Mans: Dynamic and Fluid MPC for Dishonest Majority
    Rahul Rachuri and Peter Scholl
    CRYPTO 2022
    (eprint)
  4. An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security
    Damiano Abram, Ivan Damgård, Claudio Orlandi, and Peter Scholl
    CRYPTO 2022
    (eprint)
  5. Correlated Pseudorandomness from Expand-Accumulate Codes
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl
    CRYPTO 2022
    (eprint)
  6. Moz{Z_2^k}arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over Z_2^k
    Carsten Baum, Lennart Braun, Alexander Munch-Hansen, and Peter Scholl
    CRYPTO 2022
    (eprint)
  7. Multiparty Computation with Covert Security and Public Verifiability
    Peter Scholl, Mark Simkin, and Luisa Siniscalchi
    ITC 2022
    (eprint)
  8. Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round
    Damiano Abram, Peter Scholl, and Sophia Yakoubov
    EUROCRYPT 2022
    (eprint)
  9. On the Bottleneck Complexity of MPC with Correlated Randomness
    Claudio Orlandi, Divya Ravi, and Peter Scholl
    PKC 2022
    (eprint)
  10. Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN
    Damiano Abram and Peter Scholl
    PKC 2022
    (eprint)
  11. Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators
    Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, and Omer Shlomovits
    IEEE Symposium on Security and Privacy, S&P 2022
    (eprint)

2021

  1. Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k
    Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benoît Razet, and Peter Scholl
    ACM CCS 2021
    (eprint)
  2. Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
    Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, and Peter Scholl
    CRYPTO 2021
    (eprint)
  3. Low-Complexity Weak Pseudorandom Functions in AC0[MOD2]
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl
    CRYPTO 2021
    (eprint)
  4. Oblivious TLS via Multi-party Computation
    Damiano Abram, Ivan Damgård, Peter Scholl, and Sven Trieflinger
    CT-RSA 2021
    (eprint)
  5. Banquet: Short and Fast Signatures from AES
    Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, and Greg Zaverucha
    PKC 2021
    (eprint)
  6. The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT
    Claudio Orlandi, Peter Scholl, and Sophia Yakoubov
    EUROCRYPT 2021
    (eprint)

2020

  1. Correlated Pseudorandom Functions from Variable-Density LPN
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl
    FOCS 2020
    (eprint)
  2. Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE
    Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, and Juan Ramón Troncoso-Pastoriza
    SCN 2020
    (eprint)
  3. Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits
    Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, and Peter Scholl
    CRYPTO 2020
    (eprint)
  4. Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
    Carsten Baum, Emmanuela Orsini, Peter Scholl, and Eduardo Soria-Vazquez
    CRYPTO 2020
    (eprint)
  5. Efficient Pseudorandom Correlation Generators From Ring-LPN
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl
    CRYPTO 2020
    (eprint)

2019

  1. Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, and Peter Scholl
    ACM CCS 2019
    (eprint)
  2. Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
    Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl
    CRYPTO 2019
    (eprint)
  3. Homomorphic Secret Sharing from Lattices Without FHE
    Elette Boyle, Lisa Kohl, and Peter Scholl
    EUROCRYPT 2019
    (eprint)
  4. New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning
    Ivan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller, Peter Scholl, and Nikolaj Volgushev
    IEEE Symposium on Security and Privacy, S&P 2020
    (eprint)

2018

  1. Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)
    Carmit Hazay, Emmanuela Orsini, Peter Scholl, and Eduardo Soria-Vazquez
    ASIACRYPT 2018
    (eprint)
  2. TinyKeys: A New Approach to Efficient Multi-Party Computation
    Carmit Hazay, Emmanuela Orsini, Peter Scholl, and Eduardo Soria-Vazquez
    CRYPTO 2018
    (eprint)
  3. SPDZ2k: Efficient MPC mod 2^k for Dishonest Majority
    Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, and Chaoping Xing
    CRYPTO 2018
    (eprint)
  4. Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs
    Peter Scholl
    PKC 2018
    (eprint)
  5. Compact Zero-Knowledge Proofs of Small Hamming Weight
    Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, and Mark Simkin
    PKC 2018
    (eprint)

2017

  1. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
    Carmit Hazay, Peter Scholl, and Eduardo Soria-Vazquez
    ASIACRYPT 2017
    (eprint)
  2. When It's All Just Too Much: Outsourcing MPC-Preprocessing
    Peter Scholl, Nigel P. Smart, and Tim Wood
    16th IMA International Conference on Cryptography and Coding, 2017
    (eprint)
  3. Faster Secure Multi-party Computation of AES and DES Using Lookup Tables
    Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, and Srinivas Vivek
    ACNS 2017
    (eprint)
  4. Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
    Michele Orrù, Emmanuela Orsini, and Peter Scholl
    CT-RSA 2017
    (eprint)

2016

  1. Efficient Secure Multiparty Computation with Identifiable Abort
    Carsten Baum, Emmanuela Orsini, and Peter Scholl
    TCC 2016-B
    (eprint)
  2. MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
    Marcel Keller, Emmanuela Orsini, and Peter Scholl
    ACM CCS 2016
    (eprint)
  3. MPC-Friendly Symmetric Key Primitives
    Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, and Nigel P. Smart
    ACM CCS 2016
    (eprint)

2015

  1. A Unified Approach to MPC with Preprocessing Using OT
    Tore Kasper Frederiksen, Marcel Keller, Emmanuela Orsini, and Peter Scholl
    ASIACRYPT 2015
    (eprint)
  2. Actively Secure OT Extension with Optimal Overhead
    Marcel Keller, Emmanuela Orsini, and Peter Scholl
    CRYPTO 2015
    (eprint)

2014

  1. Efficient, Oblivious Data Structures for MPC
    Marcel Keller and Peter Scholl
    ASIACRYPT 2014
    (eprint)

2013

  1. An architecture for practical actively secure MPC with dishonest majority
    Marcel Keller, Peter Scholl, and Nigel P. Smart
    ACM CCS 2013
    (eprint)
  2. Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits
    Ivan Damgård, Marcel Keller, Enrique Larraia, Valerio Pastro, Peter Scholl, and Nigel P. Smart
    ESORICS 2013
    (eprint)

2011

  1. Improved Key Generation for Gentry's Fully Homomorphic Encryption Scheme
    Peter Scholl and Nigel P. Smart
    13th IMA International Conference on Cryptography and Coding, 2011
    (eprint)

Journal Publications

  1. SoK: Vector OLE-Based Zero-Knowledge Protocols
    Carsten Baum and Samuel Dittmer and Peter Scholl and Xiao Wang
    Designs, Codes and Cryptography (to appear)
    (eprint)
  2. Efficient protocols for oblivious linear function evaluation from ring-LWE
    Carsten Baum and Daniel Escudero and Alberto Pedrouzo-Ulloa and Peter Scholl and Juan Ramón Troncoso-Pastoriza
    Journal of Computer Security, 2022
    (eprint)
  3. TinyKeys: A New Approach to Efficient Multi-Party Computation
    Carmit Hazay and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez
    Journal of Cryptology, 2022
    (eprint)
  4. High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer
    Sai Sheshank Burra and Enrique Larraia and Jesper Buus Nielsen and Peter Sebastian Nordholt and Claudio Orlandi and Emmanuela Orsini and Peter Scholl and Nigel P. Smart
    Journal of Cryptology, 2021
    (eprint)
  5. Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
    Carmit Hazay and Peter Scholl and Eduardo Soria-Vazquez
    Journal of Cryptology, 2020
    (eprint)