Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance-Reference-Cited by-同舟云学术

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance

Published:2015 Issue: Volume: Page:3-24
ISSN:0302-9743
Container-title:Advances in Cryptology -- ASIACRYPT 2015
language:
Short-container-title:

Author:

Bai Shi,Langlois Adeline,Lepoint Tancrède,Stehlé Damien,Steinfeld Ron

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-48797-6_1

Reference27 articles.

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

2. Lecture Notes in Computer Science;J Alwen,2013

3. Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. Cryptology ePrint Archive, Report 2015/769 (2015). http://eprint.iacr.org/

4. Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehlé, D.: Classical hardness of learning with errors. In: Procedings of STOC, pp. 575–584. ACM (2013)

5. Lecture Notes in Computer Science;A Banerjee,2012

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

1. Bit Security as Cost to Demonstrate Advantage;IACR Communications in Cryptology;2024-04-09

2. Ring Signatures for Deniable AKEM: Gandalf’s Fellowship;Lecture Notes in Computer Science;2024

3. Hardness of (Semiuniform) MLWE with Short Distributions Using the Rényi Divergence;IET Information Security;2023-10-23

4. High-Order Masking of Lattice Signatures in Quasilinear Time;2023 IEEE Symposium on Security and Privacy (SP);2023-05

5. NEV: Faster and Smaller NTRU Encryption Using Vector Decoding;Advances in Cryptology – ASIACRYPT 2023;2023