Paper 2010/446

Short One-Time Signatures

G. M. Zaverucha and D. R. Stinson

Abstract

We present a new one-time signature scheme having short signatures. Our new scheme supports aggregation, batch verification, and admits efficient proofs of knowledge. It has a fast signing algorithm, requiring only modular additions, and its verification cost is comparable to ECDSA verification. These properties make our scheme suitable for applications on resource-constrained devices such as smart cards and sensor nodes. Along the way, we give a unified description of five previous one-time signature schemes and improve parameter selection for these schemes, and as a corollary we give a fail-stop signature scheme with short signatures.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
one-time signaturesshort signaturescover-free families
Contact author(s)
gzaveruc @ cs uwaterloo ca
History
2010-08-18: received
Short URL
https://ia.cr/2010/446
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2010/446,
      author = {G. M.  Zaverucha and D. R.  Stinson},
      title = {Short One-Time Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/446},
      year = {2010},
      url = {https://eprint.iacr.org/2010/446}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.