153
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in turn either relies on an exponential number of assump...
140
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
We show general transformations from subexponentially-secure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1...
132
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
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...
145
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
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...
156
click to vote
TCC
2016
Springer
10 years 16 days ago
2016
Springer
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 ...