-
Article
Adaptively Secure MPC with Sublinear Communication Complexity
A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol. In this work, we study the cost of tolerating adaptive corrupti...
-
Article
Multiparty Generation of an RSA Modulus
We present a new multiparty protocol for the distributed generation of biprime RSA moduli, with security against any subset of maliciously colluding parties assuming oblivious transfer and the hardness of fact...
-
Chapter and Conference Paper
Guaranteed Output in \(O(\sqrt{n})\) Rounds for Round-Robin Sampling Protocols
We introduce a notion of round-robin secure sampling that captures several protocols in the literature, such as the “powers-of-tau” setup protocol for pairing-based polynomial commitments and zk-SNARKs, and certa...
-
Chapter and Conference Paper
Improved Straight-Line Extraction in the Random Oracle Model with Applications to Signature Aggregation
The goal of this paper is to improve the efficiency and applicability of straightline extraction techniques in the random oracle model. Straightline extraction in the random oracle model refers to the existence o...
-
Chapter and Conference Paper
Multiparty Generation of an RSA Modulus
We present a new multiparty protocol for the distributed generation of biprime RSA moduli, with security against any subset of maliciously colluding parties assuming oblivious transfer and the hardness of fact...
-
Chapter and Conference Paper
Going Beyond Dual Execution: MPC for Functions with Efficient Verification
The dual execution paradigm of Mohassel and Franklin (PKC’06) and Huang, Katz and Evans (IEEE ’12) shows how to achieve the notion of 1-bit leakage security at roughly twice the cost of semi-honest security for t...
-
Chapter and Conference Paper
Adaptively Secure MPC with Sublinear Communication Complexity
A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol
-
Chapter and Conference Paper
Minimizing Trust in Hardware Wallets with Two Factor Signatures
We introduce the notion of two-factor signatures (2FS), a generalization of a two-out-of-two threshold signature scheme in which one of the parties is a hardware token which can store a high-entropy secret, and ...
-
Chapter and Conference Paper
Multi-Key Searchable Encryption, Revisited
We consider a setting where users store their encrypted documents on a remote server and can selectively share documents with each other. A user should be able to perform keyword searches over all the document...
-
Chapter and Conference Paper
Socially Optimal Mining Pools
Mining for Bitcoins is a high-risk high-reward activity. Miners, seeking to reduce their variance and earn steadier rewards, collaborate in so-called pooling strategies where they jointly mine for Bitcoins. Whene...
-
Chapter and Conference Paper
Analysis of the Blockchain Protocol in Asynchronous Networks
Nakamoto’s famous blockchain protocol enables achieving consensus in a so-called permissionless setting—anyone can join (or leave) the protocol execution, and the protocol instructions do not depend on the identi...
-
Chapter and Conference Paper
Bounded KDM Security from iO and OWF
To date, all constructions in the standard model (i.e., without random oracles) of Bounded Key-Dependent Message (KDM) secure (or even just circularly-secure) encryption schemes rely on specific assumptions (L...
-
Chapter and Conference Paper
Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
A celebrated result by Barak et al. (Crypto’01) shows the impossibility of general-purpose virtual black-box (VBB) obfuscation in the plain model. A recent work by Canetti, Kalai, and Paneth (TCC’15) extends this...
-
Chapter and Conference Paper
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
Since the seminal work of Garg et al. (FOCS’13) in which they proposed the first candidate construction for indistinguishability obfuscation (iO for short), iO has become a central cryptographic primitive with...
-
Article
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slightly homomorphic signatures, or ...
-
Chapter and Conference Paper
Secure Computation from Millionaire
The standard method for designing a secure computation protocol for function f first transforms f into either a circuit or a RAM program and then applies a generic secure computation protocol that either handles ...
-
Chapter and Conference Paper
Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
We present a 2-round protocol to prove knowledge of a plaintext corresponding to a given ciphertext. Our protocol is black-box in the underlying cryptographic primitives and it can be instantiated with almost ...
-
Chapter and Conference Paper
Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
We construct an NM − CCA1 encryption scheme from any CCA1 encryption scheme that is also plaintext aware and weakly simulatable. We believe this is the first construction of a NM − CCA1 scheme that follows strict...
-
Chapter and Conference Paper
Computing on Authenticated Data
In tandem with recent progress on computing on encrypted data via fully homomorphic encryption, we present a framework for computing on authenticated data via the notion of slightly homomorphic signatures, or P-h...
-
Article
Securely Obfuscating Re-Encryption
We present a positive obfuscation result for a traditional cryptographic functionality. This positive result stands in contrast to well-known impossibility results (Barak et al. in Advances in Cryptology—CRYPT...
