Paper 2022/097

Lattice Signature can be as Simple as Lattice Encryption

Dingfeng Ye, Jun Xu, Guifang Huang, and Lei Hu

Abstract

Existing lattice signature schemes are much less efficient than encryption schemes due to the rejection sampling paradigm. We give a new construction which avoids rejection sampling by using temporary public keys and structured secrets in a Bliss type scheme. Structured secrets also improve existing lattice encryption schemes to nearly the same extreme efficiency. Our signing algorithm is comparative with this optimized encryption efficiency. Our signature scheme allows the same key pair work as an encryption scheme. For lightweight implementation, our techniques allow integrating of public-key encryption and signature in a simple circuit which only needs to do small integer additions as the main part of computation.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
Lattice SignatureLattice Encryption
Contact author(s)
xujun @ iie ac cn
History
2022-01-31: received
Short URL
https://ia.cr/2022/097
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2022/097,
      author = {Dingfeng Ye and Jun Xu and Guifang Huang and Lei Hu},
      title = {Lattice Signature can be as Simple as Lattice Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2022/097},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/097}},
      url = {https://eprint.iacr.org/2022/097}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.