Short group signature without random oracles

  • Xiaohui Liang
  • , Zhenfu Cao*
  • , Jun Shao
  • , Huang Lin
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

37 Scopus citations

Abstract

We construct a short group signature which is proven secure without random oracles. By making certain reasonable assumptions and applying the technique of non-interactive proof system, we prove that our scheme is full anonymity and full traceability. Compared with other related works, such as BW06 [9], BW07 [10], ours is more practical due to the short size of both public key and group signature.

Original languageEnglish
Title of host publicationInformation and Communications Security - 9th International Conference, ICICS 2007, Proceedings
PublisherSpringer Verlag
Pages69-82
Number of pages14
ISBN (Print)9783540770473
DOIs
StatePublished - 2007
Externally publishedYes
Event9th International Conference on Information and Communications Security, ICICS 2007 - Zhengzhou, China
Duration: 12 Dec 200715 Dec 2007

Publication series

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

Conference

Conference9th International Conference on Information and Communications Security, ICICS 2007
Country/TerritoryChina
CityZhengzhou
Period12/12/0715/12/07

Keywords

  • Group signature
  • Non-interactive proof system
  • Short signature
  • Standard model

Fingerprint

Dive into the research topics of 'Short group signature without random oracles'. Together they form a unique fingerprint.

Cite this