NTRUSign: Digital signatures using the NTRU lattice. We introduce NTRUSign, a new family of signature schemes based on solving the approximate closest vector problem (APPR-CVP) in NTRU-type lattices. We explore the properties of general APPR-CVP based signature schemes (e.g. GGH) and show that they are not immune to transcript attacks even in the random oracle model. We then introduce the idea of using carefully chosen perturbations to limit the information that is obtainable from an analysis of a large signature transcript. In the case of NTRUSign this can be achieved while maintaining attractive efficiency properties.

References in zbMATH (referenced in 41 articles , 1 standard article )

Showing results 1 to 20 of 41.
Sorted by year (citations)

1 2 3 next

  1. Ducas, Léo; Yu, Yang: Learning strikes again: the case of the DRS signature scheme (2021)
  2. Shafieinejad, Masoumeh; Esfahani, Navid Nasr: A scalable post-quantum hash-based group signature (2021)
  3. Cho, Gook Hwa; Lim, Seongan; Lee, Hyang-Sook: Algorithms for the generalized NTRU equations and their storage analysis (2020)
  4. Das, Dipayan; Hoffstein, Jeffrey; Pipher, Jill; Whyte, William; Zhang, Zhenfei: Modular lattice signatures, revisited (2020)
  5. De Micheli, Gabrielle; Heninger, Nadia; Shani, Barak: Characterizing overstretched NTRU attacks (2020)
  6. Hoffstein, Jeffrey; Silverman, Joseph H.; Whyte, William; Zhang, Zhenfei: A signature scheme from the finite field isomorphism problem (2020)
  7. Wang, Zhipeng; Wu, Qianhong: A practical lattice-based sequential aggregate signature (2019)
  8. Espitau, Thomas; Fouque, Pierre-Alain; Gérard, Benoît; Tibouchi, Mehdi: Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (2017)
  9. Hung, Ying-Hao; Tseng, Yuh-Min; Huang, Sen-Shan: Lattice-based revocable certificateless signature (2017)
  10. Kim, Jeongsu; Park, Suyong; Kim, Seonggeun; Jang, Busik; Hahn, Sang Geun; Jung, Sangim; Roh, Dongyoung: Analysis of error terms of signatures based on learning with errors (2017)
  11. Yu, Yang; Xu, Guangwu; Wang, Xiaoyun: Provably secure NTRU instances over prime cyclotomic rings (2017)
  12. Albrecht, Martin; Bai, Shi; Ducas, Léo: A subfield lattice attack on overstretched NTRU assumptions. Cryptanalysis of some FHE and graded encoding schemes (2016)
  13. Cheon, Jung Hee; Jeong, Jinhyuck; Lee, Changmin: An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero (2016)
  14. del Pino, Rafael; Lyubashevsky, Vadim; Pointcheval, David: The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs (2016)
  15. Fukshansky, Lenny; Sun, Xun: On the geometry of cyclic lattices (2014)
  16. Hu, Yupu; Lei, Hao; Wang, Fenghe; Zhang, Wenzheng: Gaussian sampling of lattices for cryptographic applications (2014)
  17. Melchor, Carlos Aguilar; Boyen, Xavier; Deneuville, Jean-Christophe; Gaborit, Philippe: Sealing the leak on classical NTRU signatures (2014)
  18. Güneysu, Tim; Oder, Tobias; Pöppelmann, Thomas; Schwabe, Peter: Software speed records for lattice-based signatures (2013)
  19. Cash, David; Hofheinz, Dennis; Kiltz, Eike; Peikert, Chris: Bonsai trees, or how to delegate a lattice basis (2012)
  20. Ducas, Léo; Nguyen, Phong Q.: Learning a zonotope and more: cryptanalysis of ntrusign countermeasures (2012)

1 2 3 next