On the Theoretical Gap between Group Signatures with and without Unlinkability

Authors:
Go Ohtake;Arisa Fujii;Goichiro Hanaoka;Kazuto Ogawa
Affiliations:
Japan Broadcasting Corporation, Tokyo, Japan 157-8510;Japan Broadcasting Corporation, Tokyo, Japan 157-8510;National Institute of Advanced Industrial Science and Technology, Tokyo, Japan 101-0021;Japan Broadcasting Corporation, Tokyo, Japan 157-8510
Venue:
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Year:
2009

Citing 22
Cited 3

Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Limits on the provable consequences of one-way permutations

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A Non-interactive Public-Key Distribution System

Designs, Codes and Cryptography
Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Efficient Group Signature Schemes for Large Groups (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Hierarchical ID-Based Cryptography

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
How to Convert any Digital Signature Scheme into a Group Signature Scheme

Proceedings of the 5th International Workshop on Security Protocols
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Group Signature Scheme from Bilinear Maps

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
On the evaluation of powers and related problems

SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Group signatures

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Non-interactive public-key cryptography

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Towards a separation of semantic and CCA security for public key encryption

TCC'07 Proceedings of the 4th conference on Theory of 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
Short group signature without random oracles

ICICS'07 Proceedings of the 9th international conference on Information and communications security
On the generic construction of identity-based signatures with additional properties

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Linkable democratic group signatures

ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Foundations of group signatures: the case of dynamic groups

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Efficient identity-based signatures secure in the standard model

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy

A Selectable k-Times Relaxed Anonymous Authentication Scheme

Information Security Applications
Group signature implies PKE with non-interactive opening and threshold PKE

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Group signatures with message-dependent opening

Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate a theoretical gap between unlinkability of group signature schemes and their other requirements, and show that this gap is significantly large. Specifically, we clarify that if unlinkability is achieved from any other property of group signature schemes, then it becomes possible to construct a chosen-ciphertext secure cryptosystem from any one-way function . This result implies that it would be possible to drastically improve efficiency of group signature schemes if unlinkability is not taken into account. We also demonstrate to construct a significantly more efficient scheme (without unlinkability) than the best known full-fledged scheme.