Paper 2011/264

Round Optimal Blind Signatures

Dominique Schröder and Dominique Unruh


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.

Available format(s)
Publication info
Published elsewhere. Appears as a merge at CYRPTO 2011
Contact author(s)
schroeder @ me com
2011-05-28: received
Short URL
Creative Commons Attribution


      author = {Dominique Schröder and Dominique Unruh},
      title = {Round Optimal Blind Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2011/264},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.