-
Article
Breaking the \(O(\sqrt{n})\) -Bit Barrier: Byzantine Agreement with Polylog Bits Per Party
Byzantine agreement (BA), the task of n parties to agree on one of their input bits in the face of malicious agents, is a powerful primitive that lies at the core of a vast range of distributed protocols. Interes...
-
Article
Topology-Hiding Communication from Minimal Assumptions
Topology-hiding broadcast (THB) enables parties communicating over an incomplete network to broadcast messages while hiding the topology from within a given class of graphs. THB is a central tool underlying gener...
-
Article
Must the Communication Graph of MPC Protocols be an Expander?
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) where a partial network is fixed a priori, and thus corruptions can occur dependent on i...
-
Chapter and Conference Paper
Sublinear-Communication Secure Multiparty Computation Does Not Require FHE
Secure computation enables mutually distrusting parties to jointly compute a function on their secret inputs, while revealing nothing beyond the function output. A long-running challenge is understanding the r...
-
Chapter and Conference Paper
Arithmetic Sketching
This paper introduces arithmetic sketching, an abstraction of a primitive that several previous works use to achieve lightweight, low-communication zero-knowledge verification of secret-shared vectors. An arithme...
-
Chapter and Conference Paper
Locally Verifiable Distributed SNARGs
The field of distributed certification is concerned with certifying properties of distributed networks, where the communication topology of the network is represented as an arbitrary graph; each node of the graph...
-
Chapter and Conference Paper
Oblivious Transfer with Constant Computational Overhead
The computational overhead of a cryptographic task is the asymptotic ratio between the computational cost of securely realizing the task and that of realizing the task with no security at all.
-
Chapter and Conference Paper
Secure Multiparty Computation with Sublinear Preprocessing
A common technique for enhancing the efficiency of secure multiparty computation (MPC) with dishonest majority is via preprocessing: In an offline phase, parties engage in an input-independent protocol to secure...
-
Chapter and Conference Paper
Programmable Distributed Point Functions
A distributed point function (DPF) is a cryptographic primitive that enables compressed additive sharing of a secret unit vector across two or more parties. Despite growing ubiquity within applications and notabl...
-
Chapter and Conference Paper
Sublinear Secure Computation from New Assumptions
Secure computation enables mutually distrusting parties to jointly compute a function on their secret inputs, while revealing nothing beyond the function output. A long-running challenge is understanding the r...
-
Chapter and Conference Paper
Correlated Pseudorandomness from Expand-Accumulate Codes
A pseudorandom correlation generator (PCG) is a recent tool for securely generating useful sources of correlated randomness, such as random oblivious transfers (OT) and vector oblivious linear evaluations (VOL...
-
Chapter and Conference Paper
Low-Complexity Weak Pseudorandom Functions in \(\mathtt {AC}0[\mathtt {MOD}2]\)
A weak pseudorandom function (WPRF) is a keyed function \(f_k:\{0,1\}^n\rightarrow \{0,1\}\) ...
-
Chapter and Conference Paper
Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation
Boyle et al. (TCC 2019) proposed a new approach for secure computation in the preprocessing model building on function secret sharing (FSS), where a gate g is evaluated using an FSS scheme for the related offset ...
-
Chapter and Conference Paper
Sublinear GMW-Style Compiler for MPC with Preprocessing
We consider the efficiency of protocols for secure multiparty computation (MPC) with a dishonest majority. A popular approach for the design of such protocols is to employ preprocessing. Before the inputs are kno...
-
Chapter and Conference Paper
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation
Secure multiparty computation (MPC) enables n parties, of which up to t may be corrupted, to perform joint computations on their private inputs while revealing only the outputs. Optimizing the asymptotic and conc...
-
Chapter and Conference Paper
Topology-Hiding Communication from Minimal Assumptions
Topology-hiding broadcast (THB) enables parties communicating over an incomplete network to broadcast messages while hiding the topology from within a given class of graphs. THB is a central tool underlying gener...
-
Chapter and Conference Paper
Efficient Pseudorandom Correlation Generators from Ring-LPN
Secure multiparty computation can often utilize a trusted source of correlated randomness to achieve better efficiency. A recent line of work, initiated by Boyle et al. (CCS 2018, Crypto 2019), showed how usef...
-
Chapter and Conference Paper
Efficient Fully Secure Computation via Distributed Zero-Knowledge Proofs
Secure computation protocols enable mutually distrusting parties to compute a function of their private inputs while revealing nothing but the output. Protocols with full security (also known as guaranteed output...
-
Chapter and Conference Paper
Homomorphic Secret Sharing from Lattices Without FHE
Homomorphic secret sharing (HSS) is an analog of somewhat- or fully homomorphic encryption (S/FHE) to the setting of secret sharing, with applications including succinct secure computation, private manipulatio...
-
Chapter and Conference Paper
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More
Secure multiparty computation (MPC) often relies on correlated randomness for better efficiency and simplicity
