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 language | English |
|---|---|
| Title of host publication | Trusted Systems |
| Subtitle of host publication | 6th International Conference, INTRUST 2014 Beijing, China, December 16–17, 2014 Revised Selected Papers |
| Editors | Moti Yung, Liehuang Zhu, Yanjiang Yang |
| Place of Publication | Cham Switzerland |
| Publisher | Springer |
| Pages | 70-89 |
| Number of pages | 20 |
| ISBN (Electronic) | 9783319279985 |
| ISBN (Print) | 9783319279978 |
| DOIs | |
| Publication status | Published - 2015 |
| Externally published | Yes |
| Event | International Conference on Trusted Systems 2014 - Beijing, China Duration: 16 Dec 2014 → 17 Dec 2014 Conference number: 6th https://web.archive.org/web/20141011082658/http://crypto.fudan.edu.cn/intrust2014/ |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 9473 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Conference on Trusted Systems 2014 |
|---|---|
| Abbreviated title | INTRUST 2014 |
| Country | China |
| City | Beijing |
| Period | 16/12/14 → 17/12/14 |
| Internet address |
Cite this
}
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 proceeding › Conference Paper › Research
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 -