Paper 2009/336

Partial Signatures and their Applications

Mihir Bellare and Shanshan Duan

Abstract

We introduce Partial Signatures, where a signer, given a message, can compute a ``stub'' which preserves her anonymity, yet later she, but nobody else, can complete the stub to a full and verifiable signature under her public key. We provide a formal definition requiring three properties, namely anonymity, unambiguity and unforgeability. We provide schemes meeting our definition both with and without random oracles. Our schemes are surprisingly cheap in both bandwidth and computation. We describe applications including anonymous bidding and betting.

Note: Previously titled ``New definitions and designs for anonymous signatures.''

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Signaturesanonymityhash functions
Contact author(s)
mihir @ eng ucsd edu
History
2011-08-28: revised
2009-07-13: received
See all versions
Short URL
https://ia.cr/2009/336
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2009/336,
      author = {Mihir Bellare and Shanshan Duan},
      title = {Partial Signatures and their Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2009/336},
      year = {2009},
      note = {\url{https://eprint.iacr.org/2009/336}},
      url = {https://eprint.iacr.org/2009/336}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.