Improved Key Generation For Gentry's Fully Homomorphic Encryption Scheme. - Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2011)

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits. - Ivan Damgård; Marcel Keller; Enrique Larraia; Valerio Pastro; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2012)

An architecture for practical actively secure MPC with dishonest majority. - Marcel Keller; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2013)

Efficient, Oblivious Data Structures for MPC. - Marcel Keller; Peter Scholl (IACR Cryptol. ePrint Arch., 2014)

A Unified Approach to MPC with Preprocessing using OT. - Tore Kasper Frederiksen; Marcel Keller; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2015)

Actively Secure OT Extension with Optimal Overhead. - Marcel Keller; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2015)

Design and implementation of secure multi-party computation. - Peter Alexander Scholl (2015)

Efficient Secure Multiparty Computation with Identifiable Abort. - Carsten Baum; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

MPC-Friendly Symmetric Key Primitives. - Lorenzo Grassi 001; Christian Rechberger; Dragos Rotaru; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2016)

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. - Marcel Keller; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. - Michele Orrù; Emmanuela Orsini; Peter Scholl (IACR Cryptol. ePrint Arch., 2016)

Compact Zero-Knowledge Proofs of Small Hamming Weight. - Ivan Damgård; Ji Luo 002; Sabine Oechsner; Peter Scholl; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2017)

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 001 (IACR Cryptol. ePrint Arch., 2017)

When It's All Just Too Much: Outsourcing MPC-Preprocessing. - Peter Scholl; Nigel P. Smart; Tim Wood 003 (IACR Cryptol. ePrint Arch., 2017)

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority. - Ronald Cramer; Ivan Damgård; Daniel Escudero 001; Peter Scholl; Chaoping Xing (IACR Cryptol. ePrint Arch., 2018)

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2018)

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. - Peter Scholl (IACR Cryptol. ePrint Arch., 2018)

Providing Adittional Cotent to Print Media using Augmented Reality. - Julien Letellier; Jens Reinhardt 001; Peter Scholl; Jürgen Sieck; Michael Thiele-Maas (Int. J. Comput., 2018)

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 (IACR Cryptol. ePrint Arch., 2019)

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

Homomorphic Secret Sharing from Lattices Without FHE. - Elette Boyle; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2019)

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. - Ivan Damgård; Daniel Escudero 001; Tore Kasper Frederiksen; Marcel Keller; Peter Scholl; Nikolaj Volgushev (IACR Cryptol. ePrint Arch., 2019)

Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. - Carsten Baum; Alex J. Malozemoff; Marc B. Rosen; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. - Carsten Baum; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (IACR Cryptol. ePrint Arch., 2020)

Correlated Pseudorandom Functions from Variable-Density LPN. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. - Daniel Escudero 001; Satrajit Ghosh; Marcel Keller; Rahul Rachuri; Peter Scholl (IACR Cryptol. ePrint Arch., 2020)

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. - Carmit Hazay; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2020)

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Benoît Razet; Peter Scholl (CCS, 2021)

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. - Carsten Baum; Alex J. Malozemoff; Marc B. Rosen; Peter Scholl (CRYPTO (4), 2021)

Low-Complexity Weak Pseudorandom Functions in $ mathtt {AC}0[ mathtt {MOD}2]$. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (CRYPTO (4), 2021)

Oblivious TLS via Multi-Party Computation. - Damiano Abram; Ivan Damgård; Peter Scholl; Sven Trieflinger (IACR Cryptol. ePrint Arch., 2021)

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. - Damiano Abram; Ariel Nof; Claudio Orlandi; Peter Scholl; Omer Shlomovits (IACR Cryptol. ePrint Arch., 2021)

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ2k. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Peter Scholl (IACR Cryptol. ePrint Arch., 2021)

Banquet: Short and Fast Signatures from AES. - Carsten Baum; Cyprien Delpech de Saint Guilhem; Daniel Kales; Emmanuela Orsini; Peter Scholl; Greg Zaverucha (IACR Cryptol. ePrint Arch., 2021)

On the Bottleneck Complexity of MPC with Correlated Randomness. - Claudio Orlandi; Divya Ravi 001; Peter Scholl (IACR Cryptol. ePrint Arch., 2021)

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. - Claudio Orlandi; Peter Scholl; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2021)

Le Mans: Dynamic and Fluid MPC for Dishonest Majority. - Rahul Rachuri; Peter Scholl (IACR Cryptol. ePrint Arch., 2021)

Multiparty Computation with Covert Security and Public Verifiability. - Peter Scholl; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2021)

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. - Sai Sheshank Burra; Enrique Larraia; Jesper Buus Nielsen; Peter Sebastian Nordholt; Claudio Orlandi; Emmanuela Orsini; Peter Scholl; Nigel P. Smart (J. Cryptol., 2021)

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 (CRYPTO (4), 2022)

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. - Damiano Abram; Ivan Damgård; Claudio Orlandi; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. - Damiano Abram; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. - Damiano Abram; Peter Scholl; Sophia Yakoubov (IACR Cryptol. ePrint Arch., 2022)

Mozℤ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ2k. - Carsten Baum; Lennart Braun; Alexander Munch-Hansen; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. - Carsten Baum; Robin Jadoul; Emmanuela Orsini; Peter Scholl; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2022)

Correlated Pseudorandomness from Expand-Accumulate Codes. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Nicolas Resch; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Efficient Pseudorandom Correlation Generators from Ring-LPN. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Peter Scholl (IACR Cryptol. ePrint Arch., 2022)

Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE. - Ilaria Chillotti; Emmanuela Orsini; Peter Scholl; Nigel P. Smart; Barry Van Leeuwen (IACR Cryptol. ePrint Arch., 2022)

Efficient protocols for oblivious linear function evaluation from ring-LWE. - Carsten Baum; Daniel Escudero 001; Alberto Pedrouzo-Ulloa; Peter Scholl; Juan Ramón Troncoso-Pastoriza (J. Comput. Secur., 2022)

TinyKeys: A New Approach to Efficient Multi-Party Computation. - Carmit Hazay; Emmanuela Orsini; Peter Scholl; Eduardo Soria-Vazquez (J. Cryptol., 2022)

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions. - Damiano Abram; Maciej Obremski; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

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 (IACR Cryptol. ePrint Arch., 2023)

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. - Carsten Baum; Nikolas Melissaris; Rahul Rachuri; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus. - Katharina Boudgoust; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Oblivious Transfer with Constant Computational Overhead. - Elette Boyle; Geoffroy Couteau; Niv Gilboa; Yuval Ishai; Lisa Kohl; Nicolas Resch; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Sok: vector OLE-based zero-knowledge protocols. - Carsten Baum; Samuel Dittmer; Peter Scholl; Xiao Wang 012 (Des. Codes Cryptogr., 2023)

Succinct Homomorphic Secret Sharing. - Damiano Abram; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

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 (IACR Cryptol. ePrint Arch., 2024)

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. - Elette Boyle; Lisa Kohl; Zhe Li; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

Rate-1 Arithmetic Garbling from Homomorphic Secret-Sharing. - Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2024)

MAESTRO: Multi-party AES using Lookup Tables. - Hiraku Morita; Erik Pohle; Kunihiko Sadakane; Peter Scholl; Kazunari Tozawa; Daniel Tschudi (IACR Cryptol. ePrint Arch., 2024)

Scooby: Improved multi-party homomorphic secret sharing based on FHE. - Ilaria Chillotti; Emmanuela Orsini; Peter Scholl; Barry Van Leeuwen (Inf. Comput., 2024)

Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs. - Amit Agarwal; Carsten Baum; Lennart Braun; Peter Scholl (EUROCRYPT (4), 2025)

FAEST for Memory-Constrained Devices with Side-Channel Protections. - Diego F. Aranha; Johan Degn; Jonathan Eilath; Kent Nielsen; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank. - Amik Raj Behera; Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

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; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Covert Attacks on Machine Learning Training in Passively Secure MPC. - Matthew Jagielski; Rahul Rachuri; Daniel Escudero 001; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations. - Alexander Kyster; Frederik Huss Nielsen; Sabine Oechsner; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR. - Pierre Meyer; Claudio Orlandi; Lawrence Roy; Peter Scholl (IACR Cryptol. ePrint Arch., 2025)

MAESTRO: Multi-party AES using Lookup Tables. - Hiraku Morita; Erik Pohle; Kunihiko Sadakane; Peter Scholl; Kazunari Tozawa; Daniel Tschudi (Zenodo, 2025)

MAESTRO: Multi-party AES using Lookup Tables. - Hiraku Morita; Erik Pohle; Kunihiko Sadakane; Peter Scholl; Kazunari Tozawa; Daniel Tschudi (Zenodo, 2025)