Practical Product Proofs for Lattice Commitments-Reference-Cited by-同舟云学术

Practical Product Proofs for Lattice Commitments

Published:2020 Issue: Volume: Page:470-499
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2020
language:
Short-container-title:

Author:

Attema Thomas,Lyubashevsky Vadim,Seiler Gregor

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-56880-1_17

Reference31 articles.

1. Banaszczyk, W.: New bounds in some transference theorems in the geometry of numbers. Math. Ann. 296, 625–635 (1993)

2. Lecture Notes in Computer Science;C Baum,2018

3. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: ICALP. LIPIcs, vol. 107, pp. 14:1–14:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

4. Lecture Notes in Computer Science;E Ben-Sasson,2019

5. Lecture Notes in Computer Science;F Benhamouda,2015

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

1. A different base approach for better efficiency on range proofs;Journal of Information Security and Applications;2024-09

2. Towards Post-Quantum Verifiable Credentials;Proceedings of the 19th International Conference on Availability, Reliability and Security;2024-07-30

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

4. Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems;Lecture Notes in Computer Science;2024

5. Ring/Module Learning with Errors Under Linear Leakage – Hardness and Applications;Lecture Notes in Computer Science;2024