Publications

More publication details are available at Google Scholar and dblp.

Preprints and Miscellaneous Works

Multiparty Computation with Covert Security and Public Verifiability
Peter Scholl and Mark Simkin and Luisa Siniscalchi
IACR ePrint Archive, 2021
(eprint)
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions
Carsten Baum and Alex J. Malozemoff and Marc Rosen and Peter Scholl
IACR ePrint Archive, 2020
(eprint)
Encrypt Your Channels! On the (in)security of GMW with authenticated communication
Peter Scholl
Talk at TPMPC 2019 Rump Session, Bar-Ilan University.
(slides (pdf))
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
IACR ePrint Archive, 2014. (Merged and extended version of [FKOS15] and [LOS14])
(eprint)

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
Carmit Hazay and Peter Scholl and Eduardo Soria-Vazquez
Journal of Cryptology, 2020. (Extended version of [HSS17])
(eprint)

Oblivious TLS via Multi-Party Computation
Damiano Abram and Ivan Damgård and Peter Scholl and Sven Trieflinger
CT-RSA 2021
(eprint)
The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT
Claudio Orlandi and Peter Scholl and Sophia Yakoubov
Eurocrypt 2021
(eprint)
Banquet: Short and Fast Signatures from AES
Carsten Baum and Cyprien Delpech de Saint Guilhem and Daniel Kales and Emmanuela Orsini and Peter Scholl and Greg Zaverucha
PKC 2021
(eprint)

Correlated Pseudorandom Functions from Variable-Density LPN
Elette Boyle and Geoffroy Couteau and Niv Gilboa and Yuval Ishai and Lisa Kohl and Peter Scholl
FOCS 2020
(eprint)
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
SCN 2020
(eprint)
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits
Daniel Escudero and Satrajit Ghosh and Marcel Keller and Rahul Rachuri and Peter Scholl
CRYPTO 2020
(eprint)
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability
Carsten Baum and Emmanuela Orsini and Peter Scholl and Eduardo Soria-Vazquez
CRYPTO 2020
(eprint)
Efficient Pseudorandom Correlation Generators From Ring-LPN
Elette Boyle and Geoffroy Couteau and Niv Gilboa and Yuval Ishai and Lisa Kohl and Peter Scholl
CRYPTO 2020

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

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

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

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

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

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

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

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