Short group signature without random oracles

Authors:
Xiaohui Liang;Zhenfu Cao;Jun Shao;Huang Lin
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, P.R. China
Venue:
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Year:
2007

Citing 12
Cited 5

The random oracle methodology, revisited (preliminary version)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Group signatures with verifier-local revocation

Proceedings of the 11th ACM conference on Computer and communications security
Full-domain subgroup hiding and constant-size group signatures

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Foundations of group signatures: formal definitions, simplified requirements, and a construction based on general assumptions

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Extracting group signatures from traitor tracing schemes

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simulation-sound NIZK proofs for a practical language and constant size group signatures

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
An efficient group signature scheme from bilinear maps

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Foundations of group signatures: the case of dynamic groups

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Evaluating 2-DNF formulas on ciphertexts

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Group signatures with efficient concurrent join

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Compact group signatures without random oracles

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

On the Theoretical Gap between Group Signatures with and without Unlinkability

AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Secure provenance: the essential of bread and butter of data forensics in cloud computing

ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Group signature revocable anonymity scheme for network monitoring

Annales UMCS, Informatica - Security Systems
Groth–Sahai proofs revisited

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
HealthShare: Achieving secure and privacy-preserving health information sharing through health social networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.