Paper 2017/682

Conditional Blind Signatures

Alexandros Zacharakis, Panagiotis Grontas, and Aris Pagourtzis

Abstract

We propose a novel cryptographic primitive called conditional blind signatures. Our primitive allows a user to request blind signatures on messages of her choice. The signer has a secret Boolean input which determines if the supplied signature is valid or not. The user should not be able to distinguish between valid and invalid signatures. A designated verifier, however, can tell which signatures verify correctly, and is in fact the only entity who can learn the secret input associated with the (unblinded) signed message. We instantiate our primitive as an extension of the Okamoto-Schnorr blind signature scheme and provide variations to fit different usage scenarios. Finally, we analyze and prove the security properties of the new scheme and explore potential applications

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision. 7th International Conference on Algebraic Informatics, June 25-28, 2017, Kalamata, Greece
Keywords
digital signaturesblind signaturesdesignated verifier signatures
Contact author(s)
pgrontas @ gmail com
History
2017-11-30: revised
2017-07-18: received
See all versions
Short URL
https://ia.cr/2017/682
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/682,
      author = {Alexandros Zacharakis and Panagiotis Grontas and Aris Pagourtzis},
      title = {Conditional Blind Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/682},
      year = {2017},
      url = {https://eprint.iacr.org/2017/682}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.