We present a new, simple candidate construction of indistinguishability obfuscation (iO). Our
scheme is inspired by lattices and learning-with-errors (LWE) techniques, but we are unable …

Abstract In 2012, Aaronson and Christiano introduced the idea of hidden subspace states to
build public-key quantum money STOC'12. Since then, this idea has been applied to realize …

We show the existence of indistinguishability obfuscators (iO) for general circuits assuming
subexponential security of:(a) the Learning with Errors (LWE) assumption (with …

Witness encryption (WE) allows us to use an arbitrary NP statement x as a public key to
encrypt a message, and the witness w serves as a decryption key. Security ensures that …

We present a new, simple candidate broadcast encryption scheme for N users with
parameter size poly (log N). We prove security of our scheme under a non-standard variant …

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 …

Registered encryption (Garg et al., TCC'18) is an emerging paradigm that tackles the key-
escrow problem associated with identity-based encryption by replacing the private-key …

Quantum cryptography leverages unique properties of quantum information in order to
construct cryptographic primitives that are oftentimes impossible classically. In this work, we …

This work provides both negative and positive results for publicly verifiable quantum money.
In the first part, we give a general theorem, showing that a certain natural class of quantum …

Quantum copy-protection uses the unclonability of quantum states to construct quantum
software that provably cannot be pirated. copy-protection would be immensely useful, but …