Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures-Reference-Cited by-同舟云学术

Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures

Published:2019 Issue: Volume: Page:3-32
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Chen Yilei,Genise Nicholas,Mukherjee Pratyay

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-34618-8_1

Reference52 articles.

1. Lecture Notes in Computer Science;S Agrawal,2010

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

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

4. Alagic, G., et al.: Status report on the first round of the NIST post-quantum cryptography standardization process. US Department of Commerce, National Institute of Standards and Technology (2019)

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

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

1. Secure Messaging Application Development: Based on Post-Quantum Algorithms CSIDH, Falcon, and AES Symmetric Key Cryptosystem;Programming and Computer Software;2024-07-30

2. Efficient Key Generation on Lattice Cryptography for Privacy Protection in Mobile IoT Crowdsourcing;IEEE Internet of Things Journal;2024-01-15

3. Toward Efficient Key Extraction of LBC Over Ring: Fast Non-Spherical G-Lattice Sampler and Optimized Perturbation Generation;IEEE Transactions on Information Forensics and Security;2024

4. Towards Compact Identity-Based Encryption on Ideal Lattices;Lecture Notes in Computer Science;2024

5. Efficient Identity-Based Encryption with Tight Adaptive Anonymity from RLWE;Lecture Notes in Computer Science;2024