Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05

Authors:
Fangguo Zhang;Xiaofeng Chen
Affiliations:
School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510275, P.R. China;Key Laboratory of Computer Networks and Information Security, Ministry of Education, Xidian University, Xi'an 710071, P.R. China
Venue:
Information Processing Letters
Year:
2009

Citing 9
Cited 0

Zero knowledge proofs of identity

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge proofs of identity

Journal of Cryptology
Communication-efficient anonymous group identification

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Anonymous authentication with subset queries (extended abstract)

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Design and Security Analysis of Anonymous Group Identification Protocols

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
On monotone formula closure of SZK

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Efficient proofs that a committed number lies in an interval

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Accumulators from bilinear pairings and applications

CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology

Quantified Score

Hi-index	0.89

Visualization

Abstract

An ad-hoc anonymous identification scheme is a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove membership anonymously in such groups. Recently, Nguyen [L. Nguyen, Accumulators from bilinear pairings and applications, in: CT-RSA 2005, in: LNCS, vol. 3376, Springer-Verlag, 2005, pp. 275-292] proposed an ID-based ad-hoc anonymous identification scheme from bilinear pairings. However, in this paper, we propose an attack on Nguyen's ID-based ad-hoc anonymous identification scheme. We show that any one can impersonate a valid group member to perform the anonymous identification protocol successfully. Furthermore, we propose a solution to improve this scheme against our attack.