Random-Oracle Uninstantiability from Indistinguishability Obfuscation-Reference-Cited by-同舟云学术

Random-Oracle Uninstantiability from Indistinguishability Obfuscation

Published:2015 Issue: Volume: Page:428-455
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Brzuska Christina,Farshim Pooya,Mittelbach Arno

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46497-7_17

Reference57 articles.

1. Lecture Notes in Computer Science;S.S. Al-Riyami,2003

2. Ananth, P., Boneh, D., Garg, S., Sahai, A., Zhandry, M.: Differing-inputs obfuscation and applications. Cryptology ePrint Archive, Report 2013/689 (2013), http://eprint.iacr.org/2013/689

3. Ananth, P.V., Gupta, D., Ishai, Y., Sahai, A.: Optimizing obfuscation: Avoiding barrington’s theorem. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014: 21st Conference on Computer and Communications Security, November 3–7, pp. 646–658. ACM Press, Scottsdale (2014)

4. Lecture Notes in Computer Science;B. Barak,2014

5. Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6:1–6:48 (2012), http://doi.acm.org/10.1145/2160158.2160159

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Limits in the Provable Security of ECDSA Signatures;Theory of Cryptography;2023

2. To Label, or Not To Label (in Generic Groups);Advances in Cryptology – CRYPTO 2022;2022

3. Augmented Random Oracles;Advances in Cryptology – CRYPTO 2022;2022

4. Instantiability of Classical Random-Oracle-Model Encryption Transforms;Advances in Cryptology – ASIACRYPT 2022;2022

5. Rate-1 Incompressible Encryption from Standard Assumptions;Theory of Cryptography;2022