Lattice-Based Zero-Knowledge Arguments for Integer Relations-Reference-Cited by-同舟云学术

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Published:2018 Issue: Volume: Page:700-732
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Libert Benoît,Ling San,Nguyen Khoa,Wang Huaxiong

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96881-0_24

Reference60 articles.

1. Adleman, L., Mander, K.: Diophantine complexity. In: SFCS, pp. 81–88. IEEE Computer Society (1976)

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC 1996 (1996)

3. Lecture Notes in Computer Science;M Ajtai,1999

4. Lecture Notes in Computer Science;N Barić,1997

5. Baum, C., Damgård, I., Oechsner, S., Peikert, C.: Efficient commitments and zero-knowledge protocols from ring-sis with applications to lattice-based threshold cryptosystems. IACR Cryptology ePrint Archive, 2016:997 (2016)

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

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

2. MPC-in-the-Head Framework without Repetition and its Applications to the Lattice-based Cryptography;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

3. Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors;Journal of Cryptology;2023-05-25

4. Proof-of-Possession for KEM Certificates using Verifiable Generation;Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security;2022-11-07

5. Addressing Extreme Market Responses Using Secure Aggregation;3rd ACM International Conference on AI in Finance;2022-10-26