Sciweavers

Share
TCC
2016
Springer
41views Cryptology» more  TCC 2016»
3 years 4 months ago
Two-Round Man-in-the-Middle Security from LPN
Secret-key authentication protocols have recently received a considerable amount of attention, and a long line of research has been devoted to devising efficient protocols with sec...
David Cash, Eike Kiltz, Stefano Tessaro
TCC
2016
Springer
50views Cryptology» more  TCC 2016»
3 years 4 months ago
Standard Security Does Imply Security Against Selective Opening for Markov Distributions
About three decades ago it was realized that implementing private channels between parties which can be adaptively corrupted requires an encryption scheme that is secure against s...
Georg Fuchsbauer, Felix Heuer, Eike Kiltz, Krzyszt...
TCC
2016
Springer
48views Cryptology» more  TCC 2016»
3 years 4 months ago
Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
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...
TCC
2016
Springer
40views Cryptology» more  TCC 2016»
3 years 4 months ago
Functional Encryption Without Obfuscation
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...
TCC
2016
Springer
59views Cryptology» more  TCC 2016»
3 years 4 months ago
Indistinguishability Obfuscation: From Approximate to Exact
We show general transformations from subexponentially-secure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1...
Nir Bitansky, Vinod Vaikuntanathan
TCC
2016
Springer
46views Cryptology» more  TCC 2016»
3 years 4 months ago
Output-Compressing Randomized Encodings and Applications
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...
TCC
2016
Springer
39views Cryptology» more  TCC 2016»
3 years 4 months ago
Optimal Computational Split-state Non-malleable Codes
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...
Divesh Aggarwal, Shashank Agrawal, Divya Gupta 000...
TCC
2016
Springer
54views Cryptology» more  TCC 2016»
3 years 4 months ago
Characterization of Secure Multiparty Computation Without Broadcast
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 ...
Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem
TCC
2016
Springer
101views Cryptology» more  TCC 2016»
3 years 4 months ago
Cryptographic Assumptions: A Position Paper
Shafi Goldwasser, Yael Tauman Kalai
TCC
2016
Springer
52views Cryptology» more  TCC 2016»
3 years 4 months ago
From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
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...
Benny Applebaum, Pavel Raykov
books