Indistinguishability Obfuscation from LPN over $$\mathbb {F}_p$$, DLIN, and PRGs in NC$$^0$$-Reference-Cited by-同舟云学术

Indistinguishability Obfuscation from LPN over $$\mathbb {F}_p$$, DLIN, and PRGs in NC$$^0$$

Published:2022 Issue: Volume: Page:670-699
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2022
language:
Short-container-title:

Author:

Jain Aayush,Lin Huijia,Sahai Amit

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-06944-4_23

Reference41 articles.

1. Ajtai, M., Komlós, J., Szemerédi, E.: An $$O(n \log n)$$ sorting network. In: 15th ACM STOC, pp. 1–9. ACM Press (April 1983)

2. Alekhnovich, M.: More on average case vs approximation complexity. In: 44th FOCS, pp. 298–307. IEEE Computer Society Press (October 2003)

3. Lecture Notes in Computer Science;P Ananth,2019

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

5. Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation without multilinear maps: IO from LWE, bilinear maps, and weak pseudorandomness. IACR Cryptology ePrint Archive 2018/615 (2018)

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

1. Privacy-preserving cryptographic algorithms and protocols: a survey on designs and applications;SCIENTIA SINICA Informationis;2023-09-01

2. Succinct Computational Secret Sharing;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Short attribute-based signatures for arbitrary Turing machines from standard assumptions;Designs, Codes and Cryptography;2023-01-17