An Efficient Group Signature Scheme from Bilinear Maps

An Efficient Group Signature Scheme from Bilinear Maps

We propose a new group signature scheme which is secure if we assume the Decision Diffie-Hellman assumption, the q-Strong Diffie-Hellman assumption, and the existence of random oracles. The proposed scheme is the most efficient among the all previous group signature schemes in signature length and i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Furukawa, Jun, Imai, Hideki
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Elliptic Curve
Encryption Scheme
Exact sciences and technology
Memory and file management (including protection and security)
Memory organisation. Data processing
Random Oracle
Signature Length
Signature Scheme
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a new group signature scheme which is secure if we assume the Decision Diffie-Hellman assumption, the q-Strong Diffie-Hellman assumption, and the existence of random oracles. The proposed scheme is the most efficient among the all previous group signature schemes in signature length and in computational complexity.
ISSN:0302-9743
1611-3349
DOI:10.1007/11506157_38