A short anonymously revocable group signature scheme from decision linear assumption

Toru Nakanishi, Nobuo Funabiki

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

6 Citations (Scopus)

Abstract

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%.

Original languageEnglish
Title of host publicationProceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
Pages337-340
Number of pages4
DOIs
Publication statusPublished - Dec 1 2008
Event2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08 - Tokyo, Japan
Duration: Mar 18 2008Mar 20 2008

Publication series

NameProceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08

Other

Other2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08
CountryJapan
CityTokyo
Period3/18/083/20/08

Keywords

  • Aanonymity
  • Group signature
  • Revocation

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Fingerprint Dive into the research topics of 'A short anonymously revocable group signature scheme from decision linear assumption'. Together they form a unique fingerprint.

  • Cite this

    Nakanishi, T., & Funabiki, N. (2008). A short anonymously revocable group signature scheme from decision linear assumption. In Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08 (pp. 337-340). (Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, ASIACCS '08). https://doi.org/10.1145/1368310.1368359