Context: Diversification and obfuscation are promising techniques for securing software and
protecting computers from harmful malware. The goal of these techniques is not removing …

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 present improved algorithms for gaussian preimage sampling using the lattice trapdoors
of (Micciancio and Peikert, CRYPTO 2012). The MP12 work only offered a highly optimized …

We carry out a systematic study of the GGH15 graded encoding scheme used with general
branching programs. This is motivated by the fact that general branching programs are more …

We study a relaxed notion of lattice trapdoor called approximate trapdoor, which is defined
to be able to invert Ajtai's one-way function approximately instead of exactly. The primary …

Succinct non-interactive arguments (SNARGs) enable verifying NP computations with
substantially lower complexity than that required for classical NP verification. In this work, we …

Many advanced lattice cryptography applications require efficient algorithms for inverting the
so-called “gadget” matrices, which are used to formally describe a digit decomposition …

Malware authors often use cryptographic tools such as XOR encryption and block ciphers
like AES to obfuscate part of the malware to evade detection. Use of cryptography may give …

The main bottleneck of all known Fully Homomorphic Encryption schemes lies in the
bootstrapping procedure invented by Gentry (STOC'09). The cost of this procedure can be …