Peter Scholl

Orcid: 0000-0002-7937-8422

Affiliations:
  • Aarhus University, Denmark
  • University of Bristol, UK (former)


According to our database1, Peter Scholl authored at least 75 papers between 2011 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
MAESTRO: Multi-party AES using Lookup Tables.
Dataset, April, 2025

MAESTRO: Multi-party AES using Lookup Tables.
Dataset, January, 2025

MAESTRO: Multi-party AES using Lookup Tables.
Dataset, January, 2025

Covert Attacks on Machine Learning Training in Passively Secure MPC.
IACR Cryptol. ePrint Arch., 2025

Privately Constrained PRFs from DCR: Puncturing and Bounded Waring Rank.
IACR Cryptol. ePrint Arch., 2025

FAEST for Memory-Constrained Devices with Side-Channel Protections.
IACR Cryptol. ePrint Arch., 2025

On the Impossibility of Actively Secure Distributed Samplers.
IACR Cryptol. ePrint Arch., 2025

Who Verifies the Verifiers?: Lessons Learned From Formally Verified Line-Point Zero-Knowledge.
IACR Commun. Cryptol., 2025

MAESTRO: Multi-Party AES Using Lookup Tables.
Proceedings of the 34th USENIX Security Symposium, 2025

Rushing at SPDZ: On the Practical Security of Malicious MPC Implementations.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

Low-Bandwidth Mixed Arithmetic in VOLE-Based ZK from Low-Degree PRGs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Silent Circuit Relinearisation: Sublinear-Size (Boolean and Arithmetic) Garbled Circuits from DCR.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Shorter, Tighter, FAESTer: Optimizations and Improved (QROM) Analysis for VOLE-in-the-Head Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Post-Quantum Threshold Ring Signature Applications from VOLE-in-the-Head.
Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, 2025

2024
Scooby: Improved multi-party homomorphic secret sharing based on FHE.
Inf. Comput., 2024

Rate-1 Arithmetic Garbling From Homomorphic Secret Sharing.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Succinct Homomorphic Secret Sharing.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

One Tree to Rule Them All: Optimizing GGM Trees and OWFs for Post-Quantum Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2024, 2024

2023
SoK: Vector OLE-Based Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2023

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions.
IACR Cryptol. ePrint Arch., 2023

Oblivious Transfer with Constant Computational Overhead.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Simple Threshold (Fully Homomorphic) Encryption from LWE with Polynomial Modulus.
Proceedings of the Advances in Cryptology - ASIACRYPT 2023, 2023

2022
Mozℤ<sub>2<sup>k</sup></sub>arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2022

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022

On the Bottleneck Complexity of MPC with Correlated Randomness.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

Le Mans: Dynamic and Fluid MPC for Dishonest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Multiparty Computation with Covert Security and Public Verifiability.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ<sub>2<sup>k</sup></sub>.
IACR Cryptol. ePrint Arch., 2021

Banquet: Short and Fast Signatures from AES.
Proceedings of the Public-Key Cryptography - PKC 2021, 2021

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT.
Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

Oblivious TLS via Multi-party Computation.
Proceedings of the Topics in Cryptology - CT-RSA 2021, 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions.
IACR Cryptol. ePrint Arch., 2020

Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Correlated Pseudorandom Functions from Variable-Density LPN.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

Efficient Pseudorandom Correlation Generators from Ring-LPN.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Homomorphic Secret Sharing from Lattices Without FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Providing Adittional Cotent to Print Media using Augmented Reality.
Int. J. Comput., 2018

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Compact Zero-Knowledge Proofs of Small Hamming Weight.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

TinyKeys: A New Approach to Efficient Multi-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

SPDℤ<sub>2<sup>k</sup></sub>: Efficient MPC mod 2<sup>k</sup> for Dishonest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

2017
When It's All Just Too Much: Outsourcing MPC-Preprocessing.
Proceedings of the Cryptography and Coding - 16th IMA International Conference, 2017

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection.
Proceedings of the Topics in Cryptology - CT-RSA 2017, 2017

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

Faster Secure Multi-party Computation of AES and DES Using Lookup Tables.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Efficient Secure Multiparty Computation with Identifiable Abort.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

MPC-Friendly Symmetric Key Primitives.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
Design and implementation of secure multi-party computation.
PhD thesis, 2015

High Performance Multi-Party Computation for Binary Circuits Based on Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2015

Actively Secure OT Extension with Optimal Overhead.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

A Unified Approach to MPC with Preprocessing Using OT.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
Efficient, Oblivious Data Structures for MPC.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Practical Covertly Secure MPC for Dishonest Majority - Or: Breaking the SPDZ Limits.
Proceedings of the Computer Security - ESORICS 2013, 2013

An architecture for practical actively secure MPC with dishonest majority.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2011
Improved Key Generation for Gentry's Fully Homomorphic Encryption Scheme.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011


  Loading...