We provide the first constructions of identity-based encryption and hierarchical identity-based
encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without …

We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions
$$\mathsf {H}: \{0,1\}^n \rightarrow \{0,1\}^\lambda $$ with additional trapdoor function-like …

We propose a new approach to construct general-purpose indistinguishability obfuscation (iO).
Our construction is obtained via a new intermediate primitive that we call split fully …

Laconic cryptography is an emerging paradigm that enables cryptographic primitives with
sublinear communication complexity in just two messages. In particular, a two-message …

Ring signatures allow for creating signatures on behalf of an ad hoc group of signers, hiding
the true identity of the signer among the group. A natural goal is to construct a ring signature …

A Verifiable Delay Function (VDF) is a function that takes at least T sequential steps to
evaluate and produces a unique output that can be verified efficiently, in time essentially …

We construct indistinguishability obfuscation (iO) solely under circular-security properties of
encryption schemes based on the Learning with Errors (LWE) problem. Circular-security …

Public key cryptography is like magic. It allows two people who have never met before to
communicate privately over any public channel. Since its conception in the 1970s, public key …

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 show how to combine a fully-homomorphic encryption scheme with linear decryption
and a linearly-homomorphic encryption schemes to obtain constructions with new properties. …