Abstract
Spontaneous anonymous group (SAG) cryptography is a fundamental alternative to achieve thresholding without group secret or setup. It has gained wide interests in applications to ad hoc groups. We present a general construction of blind SAG 1-out-of-n and t-out-of-n signature schemes from essentially any major blind signature. In the case when our scheme is built from blind Schnorr (resp. Okamoto-Schnorr) signature, the parallel one-more unforgeability is reduced to Schnorr's ROS Problem in the random oracle model plus the generic group model. In the process of our derivations, we obtain a generalization of Schnorr's result from single public key to multiple public keys.
| Original language | English |
|---|---|
| Title of host publication | First European Workshop, ESAS 2004 |
| Publisher | Springer |
| Pages | 82-94 |
| Number of pages | 13 |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | First European Workshop, ESAS 2004 - Heidelberg, Germany Duration: 6 Aug 2004 → 6 Aug 2004 |
Publication series
| Name | Lecture Notes in Computer Science |
|---|---|
| Publisher | Springer |
| Volume | 3313 |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | First European Workshop, ESAS 2004 |
|---|---|
| Country | Germany |
| City | Heidelberg |
| Period | 6/08/04 → 6/08/04 |
Cite this
}
Blind spontaneous anonymous group signatures for ad hoc groups. / Chan, Tony K.; Fung, Karyin; Liu, Joseph K.; Wei, Victor K.
First European Workshop, ESAS 2004. Springer, 2005. p. 82-94 (Lecture Notes in Computer Science; Vol. 3313).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
TY - GEN
T1 - Blind spontaneous anonymous group signatures for ad hoc groups
AU - Chan, Tony K.
AU - Fung, Karyin
AU - Liu, Joseph K.
AU - Wei, Victor K.
PY - 2005
Y1 - 2005
N2 - Spontaneous anonymous group (SAG) cryptography is a fundamental alternative to achieve thresholding without group secret or setup. It has gained wide interests in applications to ad hoc groups. We present a general construction of blind SAG 1-out-of-n and t-out-of-n signature schemes from essentially any major blind signature. In the case when our scheme is built from blind Schnorr (resp. Okamoto-Schnorr) signature, the parallel one-more unforgeability is reduced to Schnorr's ROS Problem in the random oracle model plus the generic group model. In the process of our derivations, we obtain a generalization of Schnorr's result from single public key to multiple public keys.
AB - Spontaneous anonymous group (SAG) cryptography is a fundamental alternative to achieve thresholding without group secret or setup. It has gained wide interests in applications to ad hoc groups. We present a general construction of blind SAG 1-out-of-n and t-out-of-n signature schemes from essentially any major blind signature. In the case when our scheme is built from blind Schnorr (resp. Okamoto-Schnorr) signature, the parallel one-more unforgeability is reduced to Schnorr's ROS Problem in the random oracle model plus the generic group model. In the process of our derivations, we obtain a generalization of Schnorr's result from single public key to multiple public keys.
UR - http://www.scopus.com/inward/record.url?scp=23944497675&partnerID=8YFLogxK
M3 - Conference Paper
T3 - Lecture Notes in Computer Science
SP - 82
EP - 94
BT - First European Workshop, ESAS 2004
PB - Springer
ER -