Paper 2006/405

Universally Composable Blind Signatures in the Plain Model

Aslak Bakke Buan, Kristian Gøsteen, and Lillian Kråkmo

Abstract

In the universal composability framework, we define an ideal functionality for blind signatures, as an alternative to a functionality recently proposed by Fischlin. Fischlin proves that his functionality cannot be realized in the plain model, but this result does not apply to our functionality. We show that our functionality is realized in the plain model by a blind signature protocol if and only if the corresponding blind signature scheme is secure with respect to blindness and non-forgeability, as defined by Juels, Luby and Ostrovsky.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
Blind signaturesuniversal composability
Contact author(s)
krakmo @ math ntnu no
History
2006-11-12: received
Short URL
https://ia.cr/2006/405
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/405,
      author = {Aslak Bakke Buan and Kristian Gøsteen and Lillian Kråkmo},
      title = {Universally Composable Blind Signatures in the Plain Model},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/405},
      year = {2006},
      url = {https://eprint.iacr.org/2006/405}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.