Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile
programs into unintelligible ones while preserving functionality. It is a fascinating and …

A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a
short proof that certifies the veracity of a certain NP-statement. In the last decade, a large …

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 …

Pseudorandom functions (PRFs) are one of the foundational concepts in theoretical
computer science, with numerous applications in complexity theory and cryptography. In this …

Witness encryption (WE), first introduced by Garg, Gentry, Sahai and Waters in, is an
encryption scheme where messages are encrypted with respect to instances of an NP …

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 …

Public key quantum money can be seen as a version of the quantum no-cloning theorem
that holds even when the quantum states can be verified by the adversary. In this work, we …

Formulating cryptographic definitions to protect against software piracy is an important
research direction that has not received much attention. Since natural definitions using …

Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …