[Resource Topic] 2016/662: Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions

Welcome to the resource topic for 2016/662

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

Authors: Georg Fuchsbauer, Christian Hanser, Chethan Kamath, 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.

ePrint: https://eprint.iacr.org/2016/662

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .