Paper 2011/264 Original: eprint.iacr.org/2011/264 ↗
Round Optimal Blind Signatures
Abstract
All known round optimal (i.e., two-move) blind signature schemes either need a common reference string, rely on random oracles, or assume the hardness of some interactive assumption. At Eurocrypt 2010, Fischlin and Schröder showed that a broad class of three-move blind signature scheme cannot be instantiated in the standard model based on any non-interactive assumption. This puts forward the question if round optimal blind signature schemes exist in the standard model. Here, we give a positive answer presenting the first round optimal blind signature scheme that is secure in the standard model without any setup assumptions. Our solution does not need interactive assumptions.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2011-05-28: last updated
- 2011-05-28: published
- Short URL
- https://ia.cr/2011/264
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/264,
author = {Dominique Schröder and Dominique Unruh},
title = {Round Optimal Blind Signatures},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/264},
year = {2011},
url = {https://eprint.iacr.org/2011/264}
}