You are looking at a specific version 20110528:041331 of this paper. See the latest version.

Paper 2011/264

Round Optimal Blind Signatures

Dominique Schröder and Dominique Unruh

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.

Note: This paper has been merged with "Round Optimal Blind Signatures in the Standard Model" by Sanjam Garg, Vanishree Rao, and Amit Sahai.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Appears as a merge at CYRPTO 2011
Contact author(s)
schroeder @ me com
History
2011-05-28: received
Short URL
https://ia.cr/2011/264
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.