Paper 2016/662

Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions

Georg Fuchsbauer, Christian Hanser, Chethan Kamath, and Daniel Slamanig

Abstract

At Crypto'15 Fuchsbauer, Hanser and Slamanig (FHS) presented the first standard-model construction of efficient round-optimal blind signatures that does not require complexity leveraging. It is conceptually simple and builds on the primitive of structure-preserving signatures on equivalence classes (SPS-EQ). FHS prove the unforgeability of their scheme assuming EUF-CMA security of the SPS-EQ scheme and hardness of a version of the DH inversion problem. Blindness under adversarially chosen keys is proven under an interactive variant of the DDH assumption. We propose a variant of their scheme whose blindness can be proven under a non-interactive assumption, namely a variant of the bilinear DDH assumption. We moreover prove its unforgeability assuming only unforgeability of the underlying SPS-EQ but no additional assumptions as needed for the FHS scheme.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. Major revision. SCN 2016
Keywords
Blind SignaturesStandard ModelSPS-EQ
Contact author(s)
christian hanser @ iaik tugraz at
History
2016-06-28: received
Short URL
https://ia.cr/2016/662
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/662,
      author = {Georg Fuchsbauer and Christian Hanser and Chethan Kamath and Daniel Slamanig},
      title = {Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2016/662},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/662}},
      url = {https://eprint.iacr.org/2016/662}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.