Since the seminal work of Garg et al. (FOCS’13) in which they proposed the first candidate construction for indistinguishability obfuscation (iO for short), iO has become a cent...
Mohammad Mahmoody, Ameer Mohammed, Soheil Nematiha...
Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in turn either relies on an exponential number of assump...
Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhand...
We show general transformations from subexponentially-secure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1...
We consider randomized encodings (RE) that enable encoding a Turing machine Π and input x into its “randomized encoding” ˆΠ(x) in sublinear, or even polylogarithmic, time i...
Huijia Lin, Rafael Pass, Karn Seth, Sidharth Telan...
Abstract. Non-malleable codes are a generalization of classical errorcorrecting codes where the act of “corrupting” a codeword is replaced by a “tampering” adversary. Non-m...
A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work ...
G¨o¨os, Pitassi and Watson (ITCS, 2015) have recently introduced the notion of Zero-Information Arthur-Merlin Protocols (ZAM). In this model, which can be viewed as a private ve...
We show the following reductions from the learning with errors problem (LWE) to the learning with rounding problem (LWR): (1) Learning the secret and (2) distinguishing samples fro...
Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Ri...