Filters








45 Hits in 6.4 sec

Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources [chapter]

Christina Brzuska, Pooya Farshim, Arno Mittelbach
2014 Lecture Notes in Computer Science  
We extend our attack to show that indistinguishability obfuscation is sufficient to also break the UCE security of any hash function against bounded parallel sources.  ...  We show that the existence of indistinguishability obfuscation (iO) implies (non-black-box) attacks on all the definitions that BHK proposed within their UCE framework in the original version of their  ...  Acknowledgments We thank Mihir Bellare, Viet Tung Hoang, and Sriram Keelveedhi for their personal communication [BHK13d] .  ... 
doi:10.1007/978-3-662-44371-2_11 fatcat:r3cxk4frozaodgqx3mkw4r7lsy

Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation [chapter]

Afonso Arriaga, Manuel Barbosa, Pooya Farshim
2016 Lecture Notes in Computer Science  
A notable use case of this notion is query privacy in searchable encryption.  ...  We develop a new indistinguishability-based privacy notion that overcomes these limitations and give constructions supporting different circuit classes and meeting varying degrees of security.  ...  Arriaga is supported by the National Research Fund, Luxembourg (AFR Grant No. 5107187).  ... 
doi:10.1007/978-3-319-49890-4_13 fatcat:wgiopvhqr5delfi4zo7g2qgi4q

Using Indistinguishability Obfuscation via UCEs [chapter]

Christina Brzuska, Arno Mittelbach
2014 Lecture Notes in Computer Science  
We provide the first standard model construction for a powerful class of Universal Computational Extractors (UCEs; Bellare et al. Crypto 2013) based on indistinguishability obfuscation.  ...  Our results, hence, validate some of the new UCE notions that emerged as a response to the iO-attack.  ...  Acknowledgments We thank the Asiacrypt 2014 reviewers for the many constructive comments. We especially thank Paul Baecher, Mihir  ... 
doi:10.1007/978-3-662-45608-8_7 fatcat:6mvjrtuypff3xanz27v2qcxirq

Contention in Cryptoland: Obfuscation, Leakage and UCE [chapter]

Mihir Bellare, Igors Stepanovs, Stefano Tessaro
2015 Lecture Notes in Computer Science  
leakage-resilient symmetric encryption (3) iO cannot co-exist with hash functions that are UCE secure for computationally unpredictable split sources.  ...  We provide results of the form ¬A ∨ ¬B, meaning one of the primitives A, B cannot exist. (But we don't know which.)  ...  This will exploit the assumed unpredictability of X. Let P be a PT predictor. We build PT adversary Q such that Acknowledgments We thank Huijia Lin for discussions and insights.  ... 
doi:10.1007/978-3-662-49099-0_20 fatcat:3rrsxiqoqzbm7f5ale2fizmxfa

Chosen Ciphertext Security via UCE [chapter]

Takahiro Matsuda, Goichiro Hanaoka
2014 Lecture Notes in Computer Science  
Although the results of Bellare et al. have shown that UCEs are quite powerful and useful, the notion of UCE is new, and its potential power and limitation do not seem to have been clarified well.  ...  Furthermore, we also show how to extend this result to a CCA secure deterministic PKE scheme for block sources (with some constraint on the running time of the sources).  ...  The authors would like to thank Pooya Farshim for giving us a detailed overview of their attack [12] on UCE security using indistinguishability obfuscation.  ... 
doi:10.1007/978-3-642-54631-0_4 fatcat:m2opqcuys5c4xewszq2lynml3m

Instantiating Random Oracles via UCEs [chapter]

Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi
2013 Lecture Notes in Computer Science  
We can take existing, natural and efficient ROM schemes and show that the instantiated scheme resulting from replacing the RO with a UCE function is secure in the standard model.  ...  The definition of UCE-security itself is quite simple, asking that outputs of the function look random given some "leakage," even if the adversary knows the key, as long as the leakage does not permit  ...  We thank the Crypto 2013 PC for their many valuable comments and suggestions. We thank Dan Boneh and Adam O'Neill for their comments.  ... 
doi:10.1007/978-3-642-40084-1_23 fatcat:e76gn6dieve75ghdzzcuofghmu

Cryptography from Compression Functions: The UCE Bridge to the ROM [chapter]

Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi
2014 Lecture Notes in Computer Science  
The forms of UCE achieved by H are what BHK call UCE[S crs ]-security and UCE[S srs ]-security, namely UCE security for computationally or statistically reset-secure sources.  ...  This paper suggests and explores the use of UCE security for the task of turning VIL-ROM schemes into FIL-ROM ones.  ...  We let S cup be the class of computationally unpredictable PT sources, and S sup the class of statistically unpredictable PT sources.  ... 
doi:10.1007/978-3-662-44371-2_10 fatcat:alsyh5vaaff6zpplv7mb256wje

Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input [chapter]

Christina Brzuska, Arno Mittelbach
2014 Lecture Notes in Computer Science  
of the secret key, as long as the secret key remains computationally hidden.  ...  (FOCS 2013) gave the first candidate for so-called indistinguishability obfuscation (iO) thereby reviving the interest in obfuscation for a general purpose.  ...  Arno Mittelbach was supported by CASED (www.cased.de) and the German Research Foundation (DFG) SPP 1736.  ... 
doi:10.1007/978-3-662-45608-8_8 fatcat:b6u6guuiz5f5zarmxgs2fvhqdu

Point-Function Obfuscation: A Framework and Generic Constructions [chapter]

Mihir Bellare, Igors Stepanovs
2015 Lecture Notes in Computer Science  
We answer this in the affirmative with three generic constructions, the first based on indistinguishability obfuscation, the second on deterministic public-key encryption and the third on universal computational  ...  We end with a broader look that relates different known and possible notions of point function obfuscation to each other and to ours.  ...  Extensive and insightful comments by the TCC 2016-A reviewers lead to considerable changes and additions to the paper including Theorem 3.1, Corollary 5.4 and Section 6.  ... 
doi:10.1007/978-3-662-49099-0_21 fatcat:sz75rzoeqvghtetoxjafx2bl3q

The Magic of ELFs [chapter]

Mark Zhandry
2016 Lecture Notes in Computer Science  
from the case of image size r.  ...  The most general form of UCE is trivially unattainable, and some of the natural restricted classes of UCE have been challenged [BFM14, BST16] .  ...  [GL89] hardcore bit for any computationally unpredictable source.  ... 
doi:10.1007/978-3-662-53018-4_18 fatcat:xaay2rqylvdalagbnibfol76va

The Magic of ELFs

Mark Zhandry
2018 Journal of Cryptology  
from the case of image size r.  ...  The most general form of UCE is trivially unattainable, and some of the natural restricted classes of UCE have been challenged [BFM14, BST16] .  ...  [GL89] hardcore bit for any computationally unpredictable source.  ... 
doi:10.1007/s00145-018-9289-9 fatcat:aox3v4ow5nhf3mohas7dhotopa

Random-Oracle Uninstantiability from Indistinguishability Obfuscation [chapter]

Christina Brzuska, Pooya Farshim, Arno Mittelbach
2015 Lecture Notes in Computer Science  
Assuming the existence of indistinguishability obfuscation (iO), we show that a number of prominent transformations in the random-oracle model are uninstantiable in the standard model.  ...  To this end, we build on the recent work of Brzuska, Farshim and Mittelbach (CRYPTO 2014) and rely on the existence of iO for circuits or iO for Turing machines to derive uninstantiability for hash functions  ...  Acknowledgments Part of this work was done while Christina Brzuska was a post-doctoral researcher at Tel Aviv University and supported by the Israel Science Foundation (grant 1076/11 and 1155/11), the  ... 
doi:10.1007/978-3-662-46497-7_17 fatcat:x4kztrpkyrgm7clzws2z26oic4

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model [chapter]

Mihir Bellare, Viet Tung Hoang
2015 Lecture Notes in Computer Science  
Crucially, we rely only on a weak form of UCE, namely security for statistically (rather than computationally) unpredictable sources.  ...  The latter showed that the RO in EwH could be securely instantiated with a function family H that is UCE[S cup ] -UCE-secure for computationally unpredictable sources-to yield a standard model, fully IND  ...  Part of the work was done when Hoang was working at UCSD, supported in part by NSF grants CNS-1116800 and CNS-1228890.  ... 
doi:10.1007/978-3-662-46803-6_21 fatcat:22ld7gamxzhbnicgdfbi37c244

Modeling Random Oracles Under Unpredictable Queries [chapter]

Pooya Farshim, Arno Mittelbach
2016 Lecture Notes in Computer Science  
We overcome a number of limitations of UCEs in the new framework, and in particular prove the adaptive RKA and semi-adaptive KDM securities of a highly efficient symmetric encryption scheme using ICEs  ...  We formulate a new framework, called Interactive Computational Extractors (ICEs), that extends UCEs by viewing them as models of ROs under unpredictable (aka. high-entropy) queries.  ...  Acknowledgments The authors would like to thank Christina Brzuska for taking part in the early stages of this work. Pooya Farshim was supported in part by grant ANR-14-CE28-0003 (Project EnBid).  ... 
doi:10.1007/978-3-662-52993-5_23 fatcat:wwoqkjlj3zgrhesxmnqnuidodq

Lossy Projective Hashing and Its Applications [chapter]

Haiyang Xue, Yamin Liu, Xianhui Lu, Bao Li
2015 Lecture Notes in Computer Science  
The lossy projective hashing builds a bridge between dual projective hashing and smooth projective hashing.  ...  We give instantiations of lossy projective hashing from DDH, DCR, QR and general subgroup membership assumptions (including 2 k -th residue, p-subgroup and higher residue assumptions).  ...  [9] proved that UCE secure hash functions for computationally unpredictable source is not achievable if indistinguishable obfuscation is possible.  ... 
doi:10.1007/978-3-319-26617-6_4 fatcat:wsgfegrrf5fnzf4bw6ogaur2gm
« Previous Showing results 1 — 15 out of 45 results