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

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 24 articles )

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

1 2 next

  1. Ducas, Léo; Yu, Yang: Learning strikes again: the case of the DRS signature scheme (2021)
  2. Iovane, Gerardo: Computational quantum key distribution (CQKD) on decentralized ledger and blockchain (2021)
  3. Li, Chaoyang; Tian, Yuan; Chen, Xiubo; Li, Jian: An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems (2021)
  4. Tibouchi, Mehdi; Wallet, Alexandre: One bit is all it takes: a devastating timing attack on BLISS’s non-constant time sign flips (2021)
  5. Das, Dipayan; Hoffstein, Jeffrey; Pipher, Jill; Whyte, William; Zhang, Zhenfei: Modular lattice signatures, revisited (2020)
  6. Hoffstein, Jeffrey; Silverman, Joseph H.; Whyte, William; Zhang, Zhenfei: A signature scheme from the finite field isomorphism problem (2020)
  7. Mukherjee, Sankar; Gupta, Daya Sagar; Biswas, G. P.: An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice (2019)
  8. Wunderer, Thomas: A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack (2019)
  9. 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)
  10. Lyubashevsky, Vadim; Micciancio, Daniele: Asymptotically efficient lattice-based digital signatures (2018)
  11. Biagioni, Silvio; Masny, Daniel; Venturi, Daniele: Naor-Yung paradigm with shared randomness and applications (2017)
  12. Lee, Hyang-Sook; Lee, Juhee; Lim, Seongan: Duplication free public keys based on SIS-type problems (2017)
  13. Agrawal, Shweta; Libert, Benoît; Stehlé, Damien: Fully secure functional encryption for inner products, from standard assumptions (2016)
  14. Albrecht, Martin; Bai, Shi; Ducas, Léo: A subfield lattice attack on overstretched NTRU assumptions. Cryptanalysis of some FHE and graded encoding schemes (2016)
  15. Buchmann, Johannes A.; Butin, Denis; Göpfert, Florian; Petzoldt, Albrecht: Post-quantum cryptography: state of the art (2016)
  16. Cheng, Shantian; Nguyen, Khoa; Wang, Huaxiong: Policy-based signature scheme from lattices (2016)
  17. Chen, Ming-Shing; Hülsing, Andreas; Rijneveld, Joost; Samardjiska, Simona; Schwabe, Peter: From 5-pass (\mathcalMQ)-based identification to (\mathcalMQ)-based signatures (2016)
  18. del Pino, Rafael; Lyubashevsky, Vadim; Pointcheval, David: The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs (2016)
  19. Lyubashevsky, Vadim: Digital signatures based on the hardness of ideal lattice problems in all rings (2016)
  20. Pessl, Peter: Analyzing the shuffling side-channel countermeasure for lattice-based signatures (2016)

1 2 next