Abstract
At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any messages of its choice. In addition, we show that the computational assumption is not correct by concretely presenting a constant-time algorithm solving the problem. The contribution of the new scheme and assumption is a natural step in cryptologic research that calls for further investigation, which is a step we perform in the current work.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS'09 |
| Pages | 157-160 |
| Number of pages | 4 |
| DOIs | |
| Publication status | Published - 2009 Dec 1 |
| Event | 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS'09 - Sydney, NSW, Australia Duration: 2009 Mar 10 → 2009 Mar 12 |
Other
| Other | 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS'09 |
|---|---|
| Country | Australia |
| City | Sydney, NSW |
| Period | 09/3/10 → 09/3/12 |
Fingerprint
Keywords
- Identity-based cryptography
- Sequential aggregate signature
- Universal forgery
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Networks and Communications
- Computer Science Applications
Cite this
Universal forgery of the identity-based sequential aggregate signature scheme. / Hwang, Jung Yeon; Lee, Dong Hoon; Yung, Moti.
Proceedings of the 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS'09. 2009. p. 157-160.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Universal forgery of the identity-based sequential aggregate signature scheme
AU - Hwang, Jung Yeon
AU - Lee, Dong Hoon
AU - Yung, Moti
PY - 2009/12/1
Y1 - 2009/12/1
N2 - At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any messages of its choice. In addition, we show that the computational assumption is not correct by concretely presenting a constant-time algorithm solving the problem. The contribution of the new scheme and assumption is a natural step in cryptologic research that calls for further investigation, which is a step we perform in the current work.
AB - At CCS'07, a novel identity-based sequential aggregate signature scheme was proposed and the security of the scheme was proven under the hardness assumption of a new computational problem called modified LRSW problem. In the paper, unfortunately, we show that the scheme is universally forgeable, i.e., anyone can generate forged signatures on any messages of its choice. In addition, we show that the computational assumption is not correct by concretely presenting a constant-time algorithm solving the problem. The contribution of the new scheme and assumption is a natural step in cryptologic research that calls for further investigation, which is a step we perform in the current work.
KW - Identity-based cryptography
KW - Sequential aggregate signature
KW - Universal forgery
UR - http://www.scopus.com/inward/record.url?scp=77952324001&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952324001&partnerID=8YFLogxK
U2 - 10.1145/1533057.1533080
DO - 10.1145/1533057.1533080
M3 - Conference contribution
AN - SCOPUS:77952324001
SN - 9781605583945
SP - 157
EP - 160
BT - Proceedings of the 4th International Symposium on ACM Symposium on Information, Computer and Communications Security, ASIACCS'09
ER -