Peter Scholl

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more2026-07-20Paper
Privately constrained PRFs from DCR: puncturing and bounded Waring rank2026-04-24Paper
On the impossibility of actively secure distributed samplers2026-04-24Paper
Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR2026-02-04Paper
Shorter, tighter, FAESTer: optimizations and improved (QROM) analysis for VOLE-in-the-head signatures2026-01-28Paper
Low-bandwidth mixed arithmetic in VOLE-based ZK from low-degree PRGs2025-12-02Paper
Correlated pseudorandom functions from variable-density LPN2025-08-12Paper
Rate-1 arithmetic garbling from homomorphic secret sharing2025-07-23Paper
One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures2025-07-23Paper
Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism2025-07-03Paper
Cheater identification on a budget: MPC with identifiable abort from pairwise MACs2024-12-13Paper
Succinct homomorphic secret sharing2024-11-13Paper
Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus2024-08-30Paper
Multiparty computation with covert security and public verifiability2024-06-25Paper
Scooby: improved multi-party homomorphic secret sharing based on FHE
Information and Computation
2024-03-27Paper
Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
Advances in Cryptology – CRYPTO 2023
2024-02-06Paper
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023
2024-01-16Paper
Sok: vector OLE-based zero-knowledge protocols
Designs, Codes and Cryptography
2023-11-07Paper
Scooby: improved multi-party homomorphic secret sharing based on FHE
Lecture Notes in Computer Science
2023-07-25Paper
Moz\(\mathbb{Z}_{2^k}\)arella: efficient vector-OLE and zero-knowledge proofs over \(\mathbb{Z}_{2^k}\)
Advances in Cryptology – CRYPTO 2022
2023-07-07Paper
An algebraic framework for silent preprocessing with trustless setup and active security
Advances in Cryptology – CRYPTO 2022
2023-07-07Paper
Correlated pseudorandomness from expand-accumulate codes
Advances in Cryptology – CRYPTO 2022
2023-06-28Paper
Le Mans: dynamic and fluid MPC for dishonest majority
Advances in Cryptology – CRYPTO 2022
2023-06-12Paper
Efficient protocols for oblivious linear function evaluation from ring-LWE2022-12-16Paper
Efficient pseudorandom correlation generators from ring-LPN2022-11-09Paper
Efficient constant-round MPC with identifiable abort and public verifiability2022-11-09Paper
Improved primitives for MPC over mixed arithmetic-binary circuits2022-11-09Paper
Distributed (correlation) samplers: how to remove a trusted dealer in one round2022-08-30Paper
On the bottleneck complexity of MPC with correlated randomness
Public-Key Cryptography – PKC 2022
2022-07-08Paper
Low-communication multiparty triple generation for SPDZ from ring-LPN
Public-Key Cryptography – PKC 2022
2022-07-08Paper
Faster secure multi-party computation of AES and DES using lookup tables2022-07-01Paper
\textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions2022-05-18Paper
Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\)2022-05-18Paper
TinyKeys: a new approach to efficient multi-party computation
Journal of Cryptology
2022-04-11Paper
Banquet: short and fast signatures from AES2021-12-21Paper
Oblivious TLS via multi-party computation2021-12-20Paper
The rise of Paillier: homomorphic secret sharing and public-key silent OT2021-12-08Paper
High-performance multi-party computation for binary circuits based on oblivious transfer
Journal of Cryptology
2021-08-10Paper
Low cost constant round MPC combining BMR and oblivious transfer
Journal of Cryptology
2020-11-06Paper
TinyKeys: a new approach to efficient multi-party computation
Lecture Notes in Computer Science
2020-06-30Paper
Efficient pseudorandom correlation generators: silent OT extension and more2020-03-09Paper
Homomorphic secret sharing from lattices without FHE2020-02-06Paper
Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)2019-01-23Paper
\(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority2018-09-26Paper
Compact zero-knowledge proofs of small Hamming weight2018-05-29Paper
Extending oblivious transfer with low communication via key-homomorphic PRFs2018-05-16Paper
When it's all just too much: outsourcing MPC-preprocessing2018-04-20Paper
Low cost constant round MPC combining BMR and oblivious transfer
Advances in Cryptology – ASIACRYPT 2017
2018-04-06Paper
Actively secure 1-out-of-N OT extension with application to private set intersection
Topics in Cryptology – CT-RSA 2017
2017-04-12Paper
Efficient secure multiparty computation with identifiable abort
Theory of Cryptography
2016-12-21Paper
A Unified Approach to MPC with Preprocessing Using OT
Advances in Cryptology -- ASIACRYPT 2015
2016-06-10Paper
Actively secure OT extension with optimal overhead
Lecture Notes in Computer Science
2015-12-10Paper
Efficient, oblivious data structures for MPC
Lecture Notes in Computer Science
2015-01-06Paper
Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
Lecture Notes in Computer Science
2014-10-16Paper
Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
Cryptography and Coding
2011-12-16Paper
Modelling of micro clusters2008-12-30Paper
scientific article; zbMATH DE number 2209742 (Why is no real title available?)2005-09-28Paper
scientific article; zbMATH DE number 2089589 (Why is no real title available?)2004-08-12Paper


Research outcomes over time


This page was built for person: Peter Scholl