On Strong Simulation and Composable Point Obfuscation-Reference-Cited by-同舟云学术

On Strong Simulation and Composable Point Obfuscation

Published:2013-02-16 Issue:2 Volume:27 Page:317-357
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J Cryptol

Author:

Bitansky Nir,Canetti Ran

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s00145-013-9146-9.pdf

Reference25 articles.

1. B. Applebaum, D. Harnik, Y. Ishai, Semantic security under related-key attacks and applications, in ICS (2011), pp. 45–60

2. B. Applebaum, Fast cryptographic primitives based on the hardness of decoding random linear code. Technical Report TR-845-08, Princeton University (2008). Available at ftp://ftp.cs.princeton.edu/techreports/2008/845.pdf

3. B. Adida, D. Wikström, How to shuffle in public, in TCC (2007), pp. 555–574

4. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang, On the (im)possibility of obfuscating programs, in CRYPTO (2001), pp. 1–18

5. D. Boneh, S. Halevi, M. Hamburg, R. Ostrovsky, Circular-secure encryption from decision Diffie–Hellman, in CRYPTO (2008), pp. 108–125

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

1. Secure and Efficient Hybrid Data Deduplication in Edge Computing;ACM Transactions on Internet Technology;2022-07-25

2. Instantiation of quantum point obfuscation;Quantum Information Processing;2021-12-28

3. Cryptographic Obfuscation;SpringerBriefs in Computer Science;2020

4. The Distinction Between Fixed and Random Generators in Group-Based Assumptions;Advances in Cryptology – CRYPTO 2019;2019

5. A Dispersed Multi-Value Attribute-Based Encryption With Mediated Obfuscation;IEEE Access;2019