Unique group signatures

Matthew Franklin; Haibin Zhang

doi:10.1007/978-3-642-33167-1_37

Unique group signatures

Matthew Franklin^*, Haibin Zhang

^*Corresponding author for this work

University of California at Davis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

13 Citations (Scopus)

Abstract

We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It enables an efficient detection algorithm, revealing the identities of illegal users, which is fundamentally different from previous primitives. We present a number of unique group signature schemes (without random oracles) under a variety of security models that extend the standard security models of ordinary group signatures. Our work is a beneficial step towards mitigating the well-known group signature paradox, and it also has many other interesting applications and efficiency implications.

Original language	English
Title of host publication	Computer Security, ESORICS 2012 - 17th European Symposium on Research in Computer Security, Proceedings
Pages	643-660
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-33167-1_37
Publication status	Published - 2012
Externally published	Yes
Event	17th European Symposium on Research in Computer Security, ESORICS 2012 - Pisa, Italy Duration: 10 Sept 2012 → 12 Sept 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7459 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th European Symposium on Research in Computer Security, ESORICS 2012
Country/Territory	Italy
City	Pisa
Period	10/09/12 → 12/09/12

Keywords

Anonymity
anonymous authentication
detection algorithm
group signature
unique signature
verifiable random function

Access to Document

10.1007/978-3-642-33167-1_37

Cite this

Franklin, M., & Zhang, H. (2012). Unique group signatures. In Computer Security, ESORICS 2012 - 17th European Symposium on Research in Computer Security, Proceedings (pp. 643-660). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7459 LNCS). https://doi.org/10.1007/978-3-642-33167-1_37

@inproceedings{73b02cfc63a548c38d7c1de3d40958ae,

title = "Unique group signatures",

abstract = "We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It enables an efficient detection algorithm, revealing the identities of illegal users, which is fundamentally different from previous primitives. We present a number of unique group signature schemes (without random oracles) under a variety of security models that extend the standard security models of ordinary group signatures. Our work is a beneficial step towards mitigating the well-known group signature paradox, and it also has many other interesting applications and efficiency implications.",

keywords = "Anonymity, anonymous authentication, detection algorithm, group signature, unique signature, verifiable random function",

author = "Matthew Franklin and Haibin Zhang",

year = "2012",

doi = "10.1007/978-3-642-33167-1_37",

language = "English",

isbn = "9783642331664",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "643--660",

booktitle = "Computer Security, ESORICS 2012 - 17th European Symposium on Research in Computer Security, Proceedings",

note = "17th European Symposium on Research in Computer Security, ESORICS 2012 ; Conference date: 10-09-2012 Through 12-09-2012",

}

Franklin, M & Zhang, H 2012, Unique group signatures. in Computer Security, ESORICS 2012 - 17th European Symposium on Research in Computer Security, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7459 LNCS, pp. 643-660, 17th European Symposium on Research in Computer Security, ESORICS 2012, Pisa, Italy, 10/09/12. https://doi.org/10.1007/978-3-642-33167-1_37

Unique group signatures. / Franklin, Matthew; Zhang, Haibin.
Computer Security, ESORICS 2012 - 17th European Symposium on Research in Computer Security, Proceedings. 2012. p. 643-660 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7459 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Unique group signatures

AU - Franklin, Matthew

AU - Zhang, Haibin

PY - 2012

Y1 - 2012

N2 - We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It enables an efficient detection algorithm, revealing the identities of illegal users, which is fundamentally different from previous primitives. We present a number of unique group signature schemes (without random oracles) under a variety of security models that extend the standard security models of ordinary group signatures. Our work is a beneficial step towards mitigating the well-known group signature paradox, and it also has many other interesting applications and efficiency implications.

AB - We initiate the study of unique group signature such that signatures of the same message by the same user will always have a large common component (i.e., unique identifier). It enables an efficient detection algorithm, revealing the identities of illegal users, which is fundamentally different from previous primitives. We present a number of unique group signature schemes (without random oracles) under a variety of security models that extend the standard security models of ordinary group signatures. Our work is a beneficial step towards mitigating the well-known group signature paradox, and it also has many other interesting applications and efficiency implications.

KW - Anonymity

KW - anonymous authentication

KW - detection algorithm

KW - group signature

KW - unique signature

KW - verifiable random function

UR - http://www.scopus.com/inward/record.url?scp=84865589070&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-33167-1_37

DO - 10.1007/978-3-642-33167-1_37

M3 - Conference contribution

AN - SCOPUS:84865589070

SN - 9783642331664

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 643

EP - 660

BT - Computer Security, ESORICS 2012 - 17th European Symposium on Research in Computer Security, Proceedings

T2 - 17th European Symposium on Research in Computer Security, ESORICS 2012

Y2 - 10 September 2012 through 12 September 2012

ER -

Unique group signatures

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this