TY - GEN
T1 - A short anonymously revocable group signature scheme from decision linear assumption
AU - Nakanishi, Toru
AU - Funabiki, Nobuo
PY - 2008/12/1
Y1 - 2008/12/1
N2 - In group signature schemes, a signature is anonymous for a verifier, while only a designated Privacy Manager (PM) can identify the signer. This identification is used for tracing a dishonest anonymous signer in case of an illegal act using the signature. However, PM can violate signers' anonymity. Recently, Brickell and Li propose a novel countermeasure for the anonymous dishonest signer without PM in the setting of the direct anonymous attestation. Here, we call the generalized group signature version anonymously revocable group signature scheme. In this scheme, after an illegal act using a group signature was found, the membership of the dishonest signer can be anonymously revoked for excluding the signer without the help of any PM. However, since the Brickell-Li scheme is based on the RSA assumption and the DDH assumption, the signature is long. In this paper, we propose a short anonymously revocable group signature scheme from supersingular curves, where we adopt the decision linear (DLIN) assumption. Compared to the simple adoption of the Brickell-Li DDH-based revoking approach to supersingular curves, the length of our signature is reduced to about from 30% to 60%.
AB - In group signature schemes, a signature is anonymous for a verifier, while only a designated Privacy Manager (PM) can identify the signer. This identification is used for tracing a dishonest anonymous signer in case of an illegal act using the signature. However, PM can violate signers' anonymity. Recently, Brickell and Li propose a novel countermeasure for the anonymous dishonest signer without PM in the setting of the direct anonymous attestation. Here, we call the generalized group signature version anonymously revocable group signature scheme. In this scheme, after an illegal act using a group signature was found, the membership of the dishonest signer can be anonymously revoked for excluding the signer without the help of any PM. However, since the Brickell-Li scheme is based on the RSA assumption and the DDH assumption, the signature is long. In this paper, we propose a short anonymously revocable group signature scheme from supersingular curves, where we adopt the decision linear (DLIN) assumption. Compared to the simple adoption of the Brickell-Li DDH-based revoking approach to supersingular curves, the length of our signature is reduced to about from 30% to 60%.
KW - Aanonymity
KW - Group signature
KW - Revocation
UR - http://www.scopus.com/inward/record.url?scp=77950353119&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77950353119&partnerID=8YFLogxK
U2 - 10.1145/1368310.1368359
DO - 10.1145/1368310.1368359
M3 - Conference contribution
AN - SCOPUS:77950353119
SN - 9781595939791
T3 - Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
SP - 337
EP - 340
BT - Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
T2 - 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
Y2 - 18 March 2008 through 20 March 2008
ER -