Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization-Reference-Cited by-同舟云学术

Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization

Published:2017 Issue: Volume: Page:252-279
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2017
language:
Short-container-title:

Author:

Ananth Prabhanjan,Jain Abhishek,Sahai Amit

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-63715-0_9

Reference56 articles.

1. Ananth, P., Boneh, D., Garg, S., Sahai, A., Zhandry, M.: Differing-inputs obfuscation and applications. IACR Cryptology ePrint Archive 2013:689 (2013)

2. Lecture Notes in Computer Science;P Ananth,2016

3. Ananth, P., Gupta, D., Ishai, Y., Sahai, A.: Optimizing obfuscation: avoiding barrington’s theorem. In: ACM CCS (2014)

4. Lecture Notes in Computer Science;P Ananth,2015

5. Ananth, P., Jain, A., Sahai, A.: Achieving compactness generically: indistinguishability obfuscation from non-compact functional encryption. IACR Cryptology ePrint Archive 2015:730 (2015)

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

1. Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Laconic Function Evaluation for Turing Machines;Lecture Notes in Computer Science;2023

3. On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption;Advances in Cryptology – EUROCRYPT 2023;2023

4. Non-Interactive Anonymous Router with Quasi-Linear Router Computation;Theory of Cryptography;2023

5. New Ways to Garble Arithmetic Circuits;Advances in Cryptology – EUROCRYPT 2023;2023