BLISS

BLISS: Bimodal Lattice Signature Schemes. This implementation in C++ requires NTL and is strictly a research-oriented implementation; therefore it contains numerous debugging hooks or dirty hacks, the configurations variables are hard-coded and there is no documentation. Consequently, this ugly code should not be considered as a source of shame or embarrassment for the authors


References in zbMATH (referenced in 21 articles )

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

1 2 next

  1. Tibouchi, Mehdi; Wallet, Alexandre: One bit is all it takes: a devastating timing attack on BLISS’s non-constant time sign flips (2021)
  2. Das, Dipayan; Hoffstein, Jeffrey; Pipher, Jill; Whyte, William; Zhang, Zhenfei: Modular lattice signatures, revisited (2020)
  3. Hoffstein, Jeffrey; Silverman, Joseph H.; Whyte, William; Zhang, Zhenfei: A signature scheme from the finite field isomorphism problem (2020)
  4. Mukherjee, Sankar; Gupta, Daya Sagar; Biswas, G. P.: An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice (2019)
  5. Wunderer, Thomas: A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (2019)
  6. Bai, Shi; Lepoint, Tancrède; Roux-Langlois, Adeline; Sakzad, Amin; Stehlé, Damien; Steinfeld, Ron: Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (2018)
  7. Lyubashevsky, Vadim; Micciancio, Daniele: Asymptotically efficient lattice-based digital signatures (2018)
  8. Biagioni, Silvio; Masny, Daniel; Venturi, Daniele: Naor-Yung paradigm with shared randomness and applications (2017)
  9. Lee, Hyang-Sook; Lee, Juhee; Lim, Seongan: Duplication free public keys based on SIS-type problems (2017)
  10. Agrawal, Shweta; Libert, Benoît; Stehlé, Damien: Fully secure functional encryption for inner products, from standard assumptions (2016)
  11. Albrecht, Martin; Bai, Shi; Ducas, Léo: A subfield lattice attack on overstretched NTRU assumptions. Cryptanalysis of some FHE and graded encoding schemes (2016)
  12. Buchmann, Johannes A.; Butin, Denis; Göpfert, Florian; Petzoldt, Albrecht: Post-quantum cryptography: state of the art (2016)
  13. Cheng, Shantian; Nguyen, Khoa; Wang, Huaxiong: Policy-based signature scheme from lattices (2016)
  14. Chen, Ming-Shing; Hülsing, Andreas; Rijneveld, Joost; Samardjiska, Simona; Schwabe, Peter: From 5-pass (\mathcalMQ)-based identification to (\mathcalMQ)-based signatures (2016)
  15. del Pino, Rafael; Lyubashevsky, Vadim; Pointcheval, David: The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs (2016)
  16. Lyubashevsky, Vadim: Digital signatures based on the hardness of ideal lattice problems in all rings (2016)
  17. Pessl, Peter: Analyzing the shuffling side-channel countermeasure for lattice-based signatures (2016)
  18. Zhang, Jiang; Chen, Yu; Zhang, Zhenfeng: Programmable hash functions from lattices: short signatures and IBEs with small key sizes (2016)
  19. Laarhoven, Thijs; Mosca, Michele; van de Pol, Joop: Finding shortest lattice vectors faster using quantum search (2015)
  20. Dwarakanath, Nagarjun C.; Galbraith, Steven D.: Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (2014)

1 2 next