Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable-Reference-Cited by-同舟云学术

Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable

Published:2022 Issue: Volume: Page:102-132
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2022
language:
Short-container-title:

Author:

Albrecht Martin R.,Cini Valerio,Lai Russell W. F.,Malavolta Giulio,Thyagarajan Sri AravindaKrishnan

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-15979-4_4

Reference72 articles.

1. Agrawal, S.: Unlikely friendships: the fruitful interplay of cryptography assumptions. Invited talk at ASIACRYPT 2020, December 2020. https://youtu.be/Owz8UuWTsqg

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99–108. ACM Press, May 1996. https://doi.org/10.1145/237814.237838

3. Lecture Notes in Computer Science;MR Albrecht,2020

4. Lecture Notes in Computer Science;MR Albrecht,2021

5. Lecture Notes in Computer Science;MR Albrecht,2015

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

1. Promise of Zero‐Knowledge Proofs (ZKPs) for Blockchain Privacy and Security: Opportunities, Challenges, and Future Directions;SECURITY AND PRIVACY;2024-09-12

2. Functional commitments for arbitrary circuits of bounded sizes;Designs, Codes and Cryptography;2024-08-12

3. Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency;Journal of Cryptology;2024-07

4. Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Adaptively-Sound Succinct Arguments for NP from Indistinguishability Obfuscation;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10