Peter Scholl

Lawrence Roy

IACR Cryptol. ePrint Arch., 2024

2023

Sok: vector OLE-based zero-knowledge protocols.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., November, 2023

Oblivious Transfer with Constant Computational Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus.

[BibT_eX]

[DOI]

Katharina Boudgoust

IACR Cryptol. ePrint Arch., 2023

Cheater Identification on a Budget: MPC with Identifiable Abort from Pairwise MACs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures From VOLE-in-the-Head.

[BibT_eX]

[DOI]

Cyprien Delpech de Saint Guilhem

IACR Cryptol. ePrint Arch., 2023

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions.

[BibT_eX]

[DOI]

Maciej Obremski

IACR Cryptol. ePrint Arch., 2023

2022

TinyKeys: A New Approach to Efficient Multi-Party Computation.

[BibT_eX]

[DOI]

Carmit Hazay

J. Cryptol., 2022

Efficient protocols for oblivious linear function evaluation from ring-LWE.

[BibT_eX]

[DOI]

Daniel Escudero

Alberto Pedrouzo-Ulloa

Juan Ramón Troncoso-Pastoriza

J. Comput. Secur., 2022

Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Efficient Pseudorandom Correlation Generators from Ring-LPN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Correlated Pseudorandomness from Expand-Accumulate Codes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Feta: Efficient Threshold Designated-Verifier Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Mozℤ2karella: Efficient Vector-OLE and Zero-Knowledge Proofs Over ℤ2k.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Distributed (Correlation) Samplers: How to Remove a Trusted Dealer in One Round.

[BibT_eX]

[DOI]

Sophia Yakoubov

IACR Cryptol. ePrint Arch., 2022

Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Moz$\mathbb {Z}_{2^k}$arella: Efficient Vector-OLE and Zero-Knowledge Proofs over $\mathbb {Z}_{2^k}$.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

High-Performance Multi-party Computation for Binary Circuits Based on Oblivious Transfer.

[BibT_eX]

[DOI]

Sai Sheshank Burra

Enrique Larraia

Jesper Buus Nielsen

Peter Sebastian Nordholt

J. Cryptol., 2021

Multiparty Computation with Covert Security and Public Verifiability.

[BibT_eX]

[DOI]

Mark Simkin

Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2021

Le Mans: Dynamic and Fluid MPC for Dishonest Majority.

[BibT_eX]

[DOI]

Rahul Rachuri

IACR Cryptol. ePrint Arch., 2021

The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT.

[BibT_eX]

[DOI]

Claudio Orlandi

Sophia Yakoubov

IACR Cryptol. ePrint Arch., 2021

On the Bottleneck Complexity of MPC with Correlated Randomness.

[BibT_eX]

[DOI]

Claudio Orlandi

Divya Ravi

IACR Cryptol. ePrint Arch., 2021

Banquet: Short and Fast Signatures from AES.

[BibT_eX]

[DOI]

Cyprien Delpech de Saint Guilhem

IACR Cryptol. ePrint Arch., 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and ℤ2k.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Low-Bandwidth Threshold ECDSA via Pseudorandom Correlation Generators.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Oblivious TLS via Multi-Party Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k.

[BibT_eX]

[DOI]

Benoît Razet

Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020

Low Cost Constant Round MPC Combining BMR and Oblivious Transfer.

[BibT_eX]

[DOI]

Carmit Hazay

J. Cryptol., 2020

Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Correlated Pseudorandom Functions from Variable-Density LPN.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning.

[BibT_eX]

[DOI]

Ivan Damgård

Daniel Escudero

Tore Kasper Frederiksen

Nikolaj Volgushev

IACR Cryptol. ePrint Arch., 2019

Homomorphic Secret Sharing from Lattices Without FHE.

[BibT_eX]

[DOI]

Elette Boyle

Lisa Kohl

IACR Cryptol. ePrint Arch., 2019

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

2018

Providing Adittional Cotent to Print Media using Augmented Reality.

[BibT_eX]

[DOI]

Int. J. Comput., 2018

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT).

[BibT_eX]

[DOI]

Carmit Hazay

IACR Cryptol. ePrint Arch., 2018

SPDℤ2k: Efficient MPC mod 2k for Dishonest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

2017

When It's All Just Too Much: Outsourcing MPC-Preprocessing.

[BibT_eX]

[DOI]

Nigel P. Smart

Tim Wood

IACR Cryptol. ePrint Arch., 2017

Faster Secure Multi-Party Computation of AES and DES Using Lookup Tables.

[BibT_eX]

[DOI]

Srinivas Vivek

IACR Cryptol. ePrint Arch., 2017

Compact Zero-Knowledge Proofs of Small Hamming Weight.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

2016

Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection.

[BibT_eX]

[DOI]

Michele Orrù

IACR Cryptol. ePrint Arch., 2016

MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

MPC-Friendly Symmetric Key Primitives.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Efficient Secure Multiparty Computation with Identifiable Abort.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

Design and implementation of secure multi-party computation.

[BibT_eX]

[DOI]

Peter Alexander Scholl

PhD thesis, 2015

Actively Secure OT Extension with Optimal Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

A Unified Approach to MPC with Preprocessing using OT.

[BibT_eX]

[DOI]

Tore Kasper Frederiksen

IACR Cryptol. ePrint Arch., 2015

2014

Efficient, Oblivious Data Structures for MPC.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2013

An architecture for practical actively secure MPC with dishonest majority.

[BibT_eX]

[DOI]

Nigel P. Smart

IACR Cryptol. ePrint Arch., 2013

2012

Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

2011

Improved Key Generation For Gentry's Fully Homomorphic Encryption Scheme.

[BibT_eX]

[DOI]