Rerandomizable threshold blind signatures

Veronika Kuchta, Mark Manulis

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

Abstract

This paper formalizes the concept of threshold blind signatures (TBS) that bridges together properties of the two well-known signature flavors, blind signatures and threshold signatures. Using TBS users can obtain signatures through interaction with t-out-of-n signers without disclosing the corresponding message to any of them. Our construction is the first TBS scheme that achieves security in the standard model and enjoys the property of being rerandomizable. The security of our construction holds according to most recent security definitions for blind signatures by Schröder and Unruh (PKC 2012) that are extended in this work to the threshold setting. Rerandomizable TBS schemes enable constructions of distributed e-voting and e-cash systems. We highlight how TBS can be used to construct the first e-voting scheme that simultaneously achieves privacy, soundness, public verifiability in the presence of distributed registration authorities, following the general approach by Koenig, Dubuis, and Haenni (Electronic Voting 2010), where existence of TBS schemes was assumed but no construction given. As a second application, we discuss how TBS can be used to distribute the currency issuer role amongst multiple parties in a decentralized e-cash system proposed by Miers et al.(IEEE S&P 2013).

Original languageEnglish
Title of host publicationTrusted Systems
Subtitle of host publication6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers
EditorsMoti Yung, Liehuang Zhu, Yanjiang Yang
Place of PublicationCham Switzerland
PublisherSpringer
Pages70-89
Number of pages20
ISBN (Electronic)9783319279985
ISBN (Print)9783319279978
DOIs
Publication statusPublished - 2015
Externally publishedYes
EventInternational Conference on Trusted Systems 2014 - Beijing, China
Duration: 16 Dec 201417 Dec 2014
Conference number: 6th
https://web.archive.org/web/20141011082658/http://crypto.fudan.edu.cn/intrust2014/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9473
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Trusted Systems 2014
Abbreviated titleINTRUST 2014
CountryChina
CityBeijing
Period16/12/1417/12/14
Internet address

Cite this

Kuchta, V., & Manulis, M. (2015). Rerandomizable threshold blind signatures. In M. Yung, L. Zhu, & Y. Yang (Eds.), Trusted Systems: 6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers (pp. 70-89). (Lecture Notes in Computer Science ; Vol. 9473). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-27998-5_5
Kuchta, Veronika ; Manulis, Mark. / Rerandomizable threshold blind signatures. Trusted Systems: 6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers. editor / Moti Yung ; Liehuang Zhu ; Yanjiang Yang. Cham Switzerland : Springer, 2015. pp. 70-89 (Lecture Notes in Computer Science ).
@inproceedings{ff907d812c734503a8b6262623a087df,
title = "Rerandomizable threshold blind signatures",
abstract = "This paper formalizes the concept of threshold blind signatures (TBS) that bridges together properties of the two well-known signature flavors, blind signatures and threshold signatures. Using TBS users can obtain signatures through interaction with t-out-of-n signers without disclosing the corresponding message to any of them. Our construction is the first TBS scheme that achieves security in the standard model and enjoys the property of being rerandomizable. The security of our construction holds according to most recent security definitions for blind signatures by Schr{\"o}der and Unruh (PKC 2012) that are extended in this work to the threshold setting. Rerandomizable TBS schemes enable constructions of distributed e-voting and e-cash systems. We highlight how TBS can be used to construct the first e-voting scheme that simultaneously achieves privacy, soundness, public verifiability in the presence of distributed registration authorities, following the general approach by Koenig, Dubuis, and Haenni (Electronic Voting 2010), where existence of TBS schemes was assumed but no construction given. As a second application, we discuss how TBS can be used to distribute the currency issuer role amongst multiple parties in a decentralized e-cash system proposed by Miers et al.(IEEE S&P 2013).",
author = "Veronika Kuchta and Mark Manulis",
year = "2015",
doi = "10.1007/978-3-319-27998-5_5",
language = "English",
isbn = "9783319279978",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "70--89",
editor = "Moti Yung and Liehuang Zhu and Yanjiang Yang",
booktitle = "Trusted Systems",

}

Kuchta, V & Manulis, M 2015, Rerandomizable threshold blind signatures. in M Yung, L Zhu & Y Yang (eds), Trusted Systems: 6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers. Lecture Notes in Computer Science , vol. 9473, Springer, Cham Switzerland, pp. 70-89, International Conference on Trusted Systems 2014, Beijing, China, 16/12/14. https://doi.org/10.1007/978-3-319-27998-5_5

Rerandomizable threshold blind signatures. / Kuchta, Veronika; Manulis, Mark.

Trusted Systems: 6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers. ed. / Moti Yung; Liehuang Zhu; Yanjiang Yang. Cham Switzerland : Springer, 2015. p. 70-89 (Lecture Notes in Computer Science ; Vol. 9473).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Rerandomizable threshold blind signatures

AU - Kuchta, Veronika

AU - Manulis, Mark

PY - 2015

Y1 - 2015

N2 - This paper formalizes the concept of threshold blind signatures (TBS) that bridges together properties of the two well-known signature flavors, blind signatures and threshold signatures. Using TBS users can obtain signatures through interaction with t-out-of-n signers without disclosing the corresponding message to any of them. Our construction is the first TBS scheme that achieves security in the standard model and enjoys the property of being rerandomizable. The security of our construction holds according to most recent security definitions for blind signatures by Schröder and Unruh (PKC 2012) that are extended in this work to the threshold setting. Rerandomizable TBS schemes enable constructions of distributed e-voting and e-cash systems. We highlight how TBS can be used to construct the first e-voting scheme that simultaneously achieves privacy, soundness, public verifiability in the presence of distributed registration authorities, following the general approach by Koenig, Dubuis, and Haenni (Electronic Voting 2010), where existence of TBS schemes was assumed but no construction given. As a second application, we discuss how TBS can be used to distribute the currency issuer role amongst multiple parties in a decentralized e-cash system proposed by Miers et al.(IEEE S&P 2013).

AB - This paper formalizes the concept of threshold blind signatures (TBS) that bridges together properties of the two well-known signature flavors, blind signatures and threshold signatures. Using TBS users can obtain signatures through interaction with t-out-of-n signers without disclosing the corresponding message to any of them. Our construction is the first TBS scheme that achieves security in the standard model and enjoys the property of being rerandomizable. The security of our construction holds according to most recent security definitions for blind signatures by Schröder and Unruh (PKC 2012) that are extended in this work to the threshold setting. Rerandomizable TBS schemes enable constructions of distributed e-voting and e-cash systems. We highlight how TBS can be used to construct the first e-voting scheme that simultaneously achieves privacy, soundness, public verifiability in the presence of distributed registration authorities, following the general approach by Koenig, Dubuis, and Haenni (Electronic Voting 2010), where existence of TBS schemes was assumed but no construction given. As a second application, we discuss how TBS can be used to distribute the currency issuer role amongst multiple parties in a decentralized e-cash system proposed by Miers et al.(IEEE S&P 2013).

UR - http://www.scopus.com/inward/record.url?scp=84958092489&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-27998-5_5

DO - 10.1007/978-3-319-27998-5_5

M3 - Conference Paper

SN - 9783319279978

T3 - Lecture Notes in Computer Science

SP - 70

EP - 89

BT - Trusted Systems

A2 - Yung, Moti

A2 - Zhu, Liehuang

A2 - Yang, Yanjiang

PB - Springer

CY - Cham Switzerland

ER -

Kuchta V, Manulis M. Rerandomizable threshold blind signatures. In Yung M, Zhu L, Yang Y, editors, Trusted Systems: 6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers. Cham Switzerland: Springer. 2015. p. 70-89. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-27998-5_5