Peter Scholl

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 98

Top Venues

IACR Cryptol. ePrint Arch.

CCS

CRYPTO (2)

Public Key Cryptography (1)

Publications

Pierre Meyer, Claudio Orlandi, Lawrence Roy, Peter Scholl
Rate-1 Arithmetic Garbling from Homomorphic Secret-Sharing. IACR Cryptol. ePrint Arch. 2024 (2024)
Elette Boyle, Lisa Kohl, Zhe Li, Peter Scholl
Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism. IACR Cryptol. ePrint Arch. 2024 (2024)
Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Barry Van Leeuwen
Scooby: Improved multi-party homomorphic secret sharing based on FHE. Inf. Comput. 297 (2024)
Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. CRYPTO (8) (2024)
Hiraku Morita, Erik Pohle, Kunihiko Sadakane, Peter Scholl, Kazunari Tozawa, Daniel Tschudi
MAESTRO: Multi-party AES using Lookup Tables. IACR Cryptol. ePrint Arch. 2024 (2024)
Damiano Abram, Lawrence Roy, Peter Scholl
Succinct Homomorphic Secret Sharing. IACR Cryptol. ePrint Arch. 2024 (2024)
Damiano Abram, Lawrence Roy, Peter Scholl
Succinct Homomorphic Secret Sharing. EUROCRYPT (6) (2024)
Carsten Baum, Ward Beullens, Shibam Mukherjee, Emmanuela Orsini, Sebastian Ramacher, Christian Rechberger, Lawrence Roy, Peter Scholl
One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2024 (2024)
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head. IACR Cryptol. ePrint Arch. 2023 (2023)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Oblivious Transfer with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2023 (2023)
Katharina Boudgoust, Peter Scholl
Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus. ASIACRYPT (1) (2023)
Carsten Baum, Nikolas Melissaris, Rahul Rachuri, Peter Scholl
Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs. IACR Cryptol. ePrint Arch. 2023 (2023)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) (2023)
Katharina Boudgoust, Peter Scholl
Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, Samuel Dittmer, Peter Scholl, Xiao Wang
Sok: vector OLE-based zero-knowledge protocols. Des. Codes Cryptogr. 91 (11) (2023)
Damiano Abram, Maciej Obremski, Peter Scholl
On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, Samuel Dittmer, Peter Scholl, Xiao Wang
SoK: Vector OLE-Based Zero-Knowledge Protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Carsten Baum, Lennart Braun, Cyprien Delpech de Saint Guilhem, Michael Klooß, Emmanuela Orsini, Lawrence Roy, Peter Scholl
Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head. CRYPTO (5) (2022)
Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. IACR Cryptol. ePrint Arch. 2022 (2022)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl
Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$. CRYPTO (4) (2022)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Correlated Pseudorandomness from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2022 (2022)
Damiano Abram, Peter Scholl
Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. Public Key Cryptography (1) (2022)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO (2) (2022)
Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen
Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. SCN (2022)
Damiano Abram, Ivan Damgård, Claudio Orlandi, Peter Scholl
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. IACR Cryptol. ePrint Arch. 2022 (2022)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Efficient Pseudorandom Correlation Generators from Ring-LPN. IACR Cryptol. ePrint Arch. 2022 (2022)
Carsten Baum, Robin Jadoul, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs. CCS (2022)
Damiano Abram, Ivan Damgård, Claudio Orlandi, Peter Scholl
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security. CRYPTO (4) (2022)
Damiano Abram, Peter Scholl, Sophia Yakoubov
Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. EUROCRYPT (1) (2022)
Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Nigel P. Smart, Barry Van Leeuwen
Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE. IACR Cryptol. ePrint Arch. 2022 (2022)
Peter Scholl, Mark Simkin, Luisa Siniscalchi
Multiparty Computation with Covert Security and Public Verifiability. ITC (2022)
Damiano Abram, Peter Scholl
Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN. IACR Cryptol. ePrint Arch. 2022 (2022)
Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. IEEE Symposium on Security and Privacy (2022)
Damiano Abram, Peter Scholl, Sophia Yakoubov
Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round. IACR Cryptol. ePrint Arch. 2022 (2022)
Claudio Orlandi, Divya Ravi, Peter Scholl
On the Bottleneck Complexity of MPC with Correlated Randomness. Public Key Cryptography (1) (2022)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
TinyKeys: A New Approach to Efficient Multi-Party Computation. J. Cryptol. 35 (2) (2022)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl
. IACR Cryptol. ePrint Arch. 2022 (2022)
Rahul Rachuri, Peter Scholl
Le Mans: Dynamic and Fluid MPC for Dishonest Majority. CRYPTO (1) (2022)
Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Efficient protocols for oblivious linear function evaluation from ring-LWE. J. Comput. Secur. 30 (1) (2022)
Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger
Oblivious TLS via Multi-party Computation. CT-RSA (2021)
Claudio Orlandi, Peter Scholl, Sophia Yakoubov
The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. EUROCRYPT (1) (2021)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Benoît Razet, Peter Scholl
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. CCS (2021)
Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer. J. Cryptol. 34 (3) (2021)
Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
Banquet: Short and Fast Signatures from AES. IACR Cryptol. ePrint Arch. 2021 (2021)
Rahul Rachuri, Peter Scholl
Le Mans: Dynamic and Fluid MPC for Dishonest Majority. IACR Cryptol. ePrint Arch. 2021 (2021)
Claudio Orlandi, Divya Ravi, Peter Scholl
On the Bottleneck Complexity of MPC with Correlated Randomness. IACR Cryptol. ePrint Arch. 2021 (2021)
Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Peter Scholl
. IACR Cryptol. ePrint Arch. 2021 (2021)
Damiano Abram, Ariel Nof, Claudio Orlandi, Peter Scholl, Omer Shlomovits
Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators. IACR Cryptol. ePrint Arch. 2021 (2021)
Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. CRYPTO (4) (2021)
Damiano Abram, Ivan Damgård, Peter Scholl, Sven Trieflinger
Oblivious TLS via Multi-Party Computation. IACR Cryptol. ePrint Arch. 2021 (2021)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$. CRYPTO (4) (2021)
Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, Greg Zaverucha
Banquet: Short and Fast Signatures from AES. Public Key Cryptography (1) (2021)
Claudio Orlandi, Peter Scholl, Sophia Yakoubov
The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. IACR Cryptol. ePrint Arch. 2021 (2021)
Peter Scholl, Mark Simkin, Luisa Siniscalchi
Multiparty Computation with Covert Security and Public Verifiability. IACR Cryptol. ePrint Arch. 2021 (2021)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Correlated Pseudorandom Functions from Variable-Density LPN. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. IACR Cryptol. ePrint Arch. 2020 (2020)
Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. IACR Cryptol. ePrint Arch. 2020 (2020)
Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. IACR Cryptol. ePrint Arch. 2020 (2020)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Efficient Pseudorandom Correlation Generators from Ring-LPN. CRYPTO (2) (2020)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Correlated Pseudorandom Functions from Variable-Density LPN. FOCS (2020)
Carsten Baum, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability. CRYPTO (2) (2020)
Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. CRYPTO (2) (2020)
Carsten Baum, Daniel Escudero, Alberto Pedrouzo-Ulloa, Peter Scholl, Juan Ramón Troncoso-Pastoriza
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE. SCN (2020)
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. J. Cryptol. 33 (4) (2020)
Ivan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. IEEE Symposium on Security and Privacy (2019)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. IACR Cryptol. ePrint Arch. 2019 (2019)
Ivan Damgård, Daniel Escudero, Tore Kasper Frederiksen, Marcel Keller, Peter Scholl, Nikolaj Volgushev
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. IACR Cryptol. ePrint Arch. 2019 (2019)
Elette Boyle, Lisa Kohl, Peter Scholl
Homomorphic Secret Sharing from Lattices Without FHE. IACR Cryptol. ePrint Arch. 2019 (2019)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. CRYPTO (3) (2019)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. CCS (2019)
Elette Boyle, Lisa Kohl, Peter Scholl
Homomorphic Secret Sharing from Lattices Without FHE. EUROCRYPT (2) (2019)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Rindal, Peter Scholl
Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Julien Letellier, Jens Reinhardt, Peter Scholl, Jürgen Sieck, Michael Thiele-Maas
Providing Adittional Cotent to Print Media using Augmented Reality. Int. J. Comput. 17 (2018)
Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
for Dishonest Majority. IACR Cryptol. ePrint Arch. 2018 (2018)
Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
Compact Zero-Knowledge Proofs of Small Hamming Weight. Public Key Cryptography (2) (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
TinyKeys: A New Approach to Efficient Multi-Party Computation. CRYPTO (3) (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). ASIACRYPT (3) (2018)
Peter Scholl
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. Public Key Cryptography (1) (2018)
Peter Scholl
Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. IACR Cryptol. ePrint Arch. 2018 (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). IACR Cryptol. ePrint Arch. 2018 (2018)
Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, Chaoping Xing
for Dishonest Majority. CRYPTO (2) (2018)
Carmit Hazay, Emmanuela Orsini, Peter Scholl, Eduardo Soria-Vazquez
TinyKeys: A New Approach to Efficient Multi-Party Computation. IACR Cryptol. ePrint Arch. 2018 (2018)
Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek
Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables. IACR Cryptol. ePrint Arch. 2017 (2017)
Marcel Keller, Emmanuela Orsini, Dragos Rotaru, Peter Scholl, Eduardo Soria-Vazquez, Srinivas Vivek
Faster Secure Multi-party Computation of AES and DES Using Lookup Tables. ACNS (2017)
Ivan Damgård, Ji Luo, Sabine Oechsner, Peter Scholl, Mark Simkin
Compact Zero-Knowledge Proofs of Small Hamming Weight. IACR Cryptol. ePrint Arch. 2017 (2017)
Peter Scholl, Nigel P. Smart, Tim Wood
When It's All Just Too Much: Outsourcing MPC-Preprocessing. IMACC (2017)
Peter Scholl, Nigel P. Smart, Tim Wood
When It's All Just Too Much: Outsourcing MPC-Preprocessing. IACR Cryptol. ePrint Arch. 2017 (2017)
Michele Orrù, Emmanuela Orsini, Peter Scholl
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. CT-RSA (2017)
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. ASIACRYPT (1) (2017)
Carmit Hazay, Peter Scholl, Eduardo Soria-Vazquez
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. IACR Cryptol. ePrint Arch. 2017 (2017)
Carsten Baum, Emmanuela Orsini, Peter Scholl
Efficient Secure Multiparty Computation with Identifiable Abort. IACR Cryptol. ePrint Arch. 2016 (2016)
Michele Orrù, Emmanuela Orsini, Peter Scholl
Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. IACR Cryptol. ePrint Arch. 2016 (2016)
Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, Nigel P. Smart
MPC-Friendly Symmetric Key Primitives. IACR Cryptol. ePrint Arch. 2016 (2016)
Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, Nigel P. Smart
MPC-Friendly Symmetric Key Primitives. CCS (2016)
Marcel Keller, Emmanuela Orsini, Peter Scholl
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. IACR Cryptol. ePrint Arch. 2016 (2016)
Marcel Keller, Emmanuela Orsini, Peter Scholl
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer. CCS (2016)
Carsten Baum, Emmanuela Orsini, Peter Scholl
Efficient Secure Multiparty Computation with Identifiable Abort. TCC (B1) (2016)
Marcel Keller, Emmanuela Orsini, Peter Scholl
Actively Secure OT Extension with Optimal Overhead. CRYPTO (1) (2015)
Sai Sheshank Burra, Enrique Larraia, Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Emmanuela Orsini, Peter Scholl, Nigel P. Smart
High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer. IACR Cryptol. ePrint Arch. 2015 (2015)

Peter Scholl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Scholl