We consider the problem of extending oblivious transfers: Given a small number of oblivious
transfers “for free,” can one implement a large number of oblivious transfers? Beaver has …

An argument system for NP is succinct, if its communication complexity is polylogarithmic the
instance and witness sizes. The seminal works of Kilian'92 and Micali'94 show that such …

From the winner of the Turing Award and the Abel Prize, an introduction to computational
complexity theory, its connections and interactions with mathematics, and its central role in …

Starting with the seminal paper of Impagliazzo and Rudich [17], there has been a large body
of work showing that various cryptographic primitives cannot be reduced to each other via …

Quantum cryptography is the field of cryptography that explores the quantum properties of
matter. Generally, it aims to develop primitives beyond the reach of classical cryptography …

We present session-key generation protocols in a model where the legitimate parties share
only a human-memorizable password, and there is no additional set-up assumption in the …

We describe new computationally secure protocols of 1-out-of-N oblivious transfer, k-out-of-
N oblivious transfer, and oblivious transfer with adaptive queries. The protocols are very …

We construct a two-message oblivious transfer (OT) protocol without setup that guarantees
statistical privacy for the sender even against malicious receivers. Receiver privacy is game …

We consider compositional properties of reactive systems that are secure in a cryptographic
sense. We follow the well-known simulatability approach of modern cryptography, ie, the …

Fully homomorphic encryption (FHE) has been called the “Swiss Army knife of
cryptography”, since it provides a single tool that can be uniformly applied to many …