Indistinguishability obfuscation from well-founded assumptions-Reference-Cited by-同舟云学术

Indistinguishability obfuscation from well-founded assumptions

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Jain Aayush¹,Lin Huijia²,Sahai Amit¹

Affiliation:

1. University of California at Los Angeles, USA

2. University of Washington, USA

Funder

Defense Advanced Research Projects Agency

NSF (National Science Foundation)

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3406325.3451093

Reference106 articles.

1. Tim Abbot Daniel Kane and Paul Valiant. 2004. On algorithms for nash equilibria. unpublished manuscript. https://web.mit.edu/tabbott/Public/final.pdf Tim Abbot Daniel Kane and Paul Valiant. 2004. On algorithms for nash equilibria. unpublished manuscript. https://web.mit.edu/tabbott/Public/final.pdf

2. Multilinear Maps from Obfuscation

3. More on average case vs approximation complexity

4. Delegating RAM Computations with Adaptive Soundness and Privacy

5. Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification

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

1. Deniable Cryptosystems: Simpler Constructions and Achieving Leakage Resilience;Computer Security – ESORICS 2023;2024

2. Token Open Secure and Post-quantum Updatable Encryption Based on MLWE;Security, Privacy, and Applied Cryptography Engineering;2024

3. Realizing Flexible Broadcast Encryption: How to Broadcast to a Public-Key Directory;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

4. Scalable Multiparty Garbling;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

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