Peter Scholl

Google Scholar ORCID: 0000-0002-7937-8422
55 publications in security and cryptology related venues
Year
Venue
Title
2025
conf/sp
Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations.
Alexander Kyster Frederik Huss Nielsen Sabine Oechsner Peter Scholl
2025
conf/eurocrypt
Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs.
Amit Agarwal Carsten Baum Lennart Braun Peter Scholl
2025
conf/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
conf/crypto
Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR.
Pierre Meyer Claudio Orlandi Lawrence Roy Peter Scholl
2025
conf/uss
MAESTRO: Multi-Party AES Using Lookup Tables.
Hiraku Morita Erik Pohle Kunihiko Sadakane Peter Scholl Kazunari Tozawa Daniel Tschudi
2025
journals/cic
Who Verifies the Verifiers?: Lessons Learned From Formally Verified Line-Point Zero-Knowledge.
Sabine Oechsner Vitor Pereira Peter Scholl
2024
conf/crypto
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs.
Carsten Baum Nikolas Melissaris Rahul Rachuri Peter Scholl
2024
conf/eurocrypt
Succinct Homomorphic Secret Sharing.
Damiano Abram Lawrence Roy Peter Scholl
2024
conf/asiacrypt
Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism.
Elette Boyle Lisa Kohl Zhe Li Peter Scholl
2024
conf/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
conf/tcc
Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing.
Pierre Meyer Claudio Orlandi Lawrence Roy Peter Scholl
2023
conf/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
conf/eurocrypt
Oblivious Transfer with Constant Computational Overhead.
Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Nicolas Resch Peter Scholl
2023
conf/asiacrypt
Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus.
Katharina Boudgoust Peter Scholl
2022
journals/joc
TinyKeys: A New Approach to Efficient Multi-Party Computation.
Carmit Hazay Emmanuela Orsini Peter Scholl Eduardo Soria-Vazquez
2022
conf/ccs
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.
Carsten Baum Robin Jadoul Emmanuela Orsini Peter Scholl Nigel P. Smart
2022
conf/crypto
Correlated Pseudorandomness from Expand-Accumulate Codes.
Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Nicolas Resch Peter Scholl
2022
conf/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
conf/crypto
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.
Damiano Abram Ivan Damgård Claudio Orlandi Peter Scholl
2022
conf/crypto
Le Mans: Dynamic and Fluid MPC for Dishonest Majority.
Rahul Rachuri Peter Scholl
2022
conf/sp
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.
Damiano Abram Ariel Nof Claudio Orlandi Peter Scholl Omer Shlomovits
2022
conf/pkc
On the Bottleneck Complexity of MPC with Correlated Randomness.
Claudio Orlandi Divya Ravi Peter Scholl
2022
conf/pkc
Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN.
Damiano Abram Peter Scholl
2022
conf/eurocrypt
Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round.
Damiano Abram Peter Scholl Sophia Yakoubov
2021
journals/joc
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
2021
conf/ccs
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
2021
conf/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
conf/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
conf/pkc
Banquet: Short and Fast Signatures from AES.
Carsten Baum Cyprien Delpech de Saint Guilhem Daniel Kales Emmanuela Orsini Peter Scholl Greg Zaverucha
2021
conf/ctrsa
Oblivious TLS via Multi-party Computation.
Damiano Abram Ivan Damgård Peter Scholl Sven Trieflinger
2021
conf/eurocrypt
The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT.
Claudio Orlandi Peter Scholl Sophia Yakoubov
2020
journals/joc
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.
Carmit Hazay Peter Scholl Eduardo Soria-Vazquez
2020
conf/crypto
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.
Carsten Baum Emmanuela Orsini Peter Scholl Eduardo Soria-Vazquez
2020
conf/crypto
Efficient Pseudorandom Correlation Generators from Ring-LPN.
Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Peter Scholl
2020
conf/crypto
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.
Daniel Escudero Satrajit Ghosh Marcel Keller Rahul Rachuri Peter Scholl
2019
conf/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
conf/crypto
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
Elette Boyle Geoffroy Couteau Niv Gilboa Yuval Ishai Lisa Kohl Peter Scholl
2019
conf/sp
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 Nikolaj Volgushev
2019
conf/eurocrypt
Homomorphic Secret Sharing from Lattices Without FHE.
Elette Boyle Lisa Kohl Peter Scholl
2018
conf/crypto
TinyKeys: A New Approach to Efficient Multi-Party Computation.
Carmit Hazay Emmanuela Orsini Peter Scholl Eduardo Soria-Vazquez
2018
conf/crypto
SPDℤ<sub>2<sup>k</sup></sub>: Efficient MPC mod 2<sup>k</sup> for Dishonest Majority.
Ronald Cramer Ivan Damgård Daniel Escudero Peter Scholl Chaoping Xing
2018
conf/pkc
Compact Zero-Knowledge Proofs of Small Hamming Weight.
Ivan Damgård Ji Luo Sabine Oechsner Peter Scholl Mark Simkin
2018
conf/pkc
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs.
Peter Scholl
2018
conf/asiacrypt
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).
Carmit Hazay Emmanuela Orsini Peter Scholl Eduardo Soria-Vazquez
2017
conf/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
conf/ctrsa
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection.
Michele Orrù Emmanuela Orsini Peter Scholl
2017
conf/asiacrypt
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.
Carmit Hazay Peter Scholl Eduardo Soria-Vazquez
2016
conf/ccs
MPC-Friendly Symmetric Key Primitives.
Lorenzo Grassi Christian Rechberger Dragos Rotaru Peter Scholl Nigel P. Smart
2016
conf/ccs
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer.
Marcel Keller Emmanuela Orsini Peter Scholl
2016
conf/tcc
Efficient Secure Multiparty Computation with Identifiable Abort.
Carsten Baum Emmanuela Orsini Peter Scholl
2015
conf/crypto
Actively Secure OT Extension with Optimal Overhead.
Marcel Keller Emmanuela Orsini Peter Scholl
2015
conf/asiacrypt
A Unified Approach to MPC with Preprocessing Using OT.
Tore Kasper Frederiksen Marcel Keller Emmanuela Orsini Peter Scholl
2014
conf/asiacrypt
Efficient, Oblivious Data Structures for MPC.
Marcel Keller Peter Scholl
2013
conf/ccs
An architecture for practical actively secure MPC with dishonest majority.
Marcel Keller Peter Scholl Nigel P. Smart
2013
conf/esorics
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

Coauthors

Alex J. Malozemoff (1)
Alexander Kyster (1)
Alexander Munch-Hansen (2)
Amit Agarwal (1)
Ariel Nof (1)
Benoît Razet (1)
Carmit Hazay (5)
Carsten Baum (12)
Chaoping Xing (1)
Christian Majenz (1)
Christian Rechberger (3)
Claudio Orlandi (7)
Cyprien Delpech de Saint Guilhem (3)
Damiano Abram (6)
Daniel Escudero (3)
Daniel Kales (1)
Daniel Tschudi (1)
Divya Ravi (1)
Dragos Rotaru (2)
Eduardo Soria-Vazquez (7)
Elette Boyle (8)
Emmanuela Orsini (16)
Enrique Larraia (2)
Erik Pohle (1)
Frederik Huss Nielsen (1)
Geoffroy Couteau (6)
Greg Zaverucha (1)
Hiraku Morita (1)
Ivan Damgård (6)
Jesper Buus Nielsen (1)
Ji Luo (1)
Katharina Boudgoust (1)
Kazunari Tozawa (1)
Kunihiko Sadakane (1)
Lawrence Roy (6)
Lennart Braun (5)
Lisa Kohl (8)
Lorenzo Grassi (1)
Marc B. Rosen (1)
Marcel Keller (9)
Mark Simkin (1)
Michael Klooß (2)
Michele Orrù (1)
Nicolas Resch (2)
Nigel P. Smart (5)
Nikolaj Volgushev (1)
Nikolas Melissaris (1)
Niv Gilboa (6)
Omer Shlomovits (1)
Peter Rindal (1)
Peter Scholl (55)
Peter Sebastian Nordholt (1)
Pierre Meyer (2)
Rahul Rachuri (3)
Robin Jadoul (1)
Ronald Cramer (1)
Sabine Oechsner (3)
Sai Sheshank Burra (1)
Satrajit Ghosh (1)
Sebastian Ramacher (2)
Shibam Mukherjee (2)
Sophia Yakoubov (2)
Srinivas Vivek (1)
Sven Trieflinger (1)
Tore Kasper Frederiksen (2)
Valerio Pastro (1)
Vitor Pereira (1)
Ward Beullens (2)
Yuval Ishai (6)
Zhe Li (1)
Filters
Select all Unselect all
Years:  to