Threshold anonymous group identification and zero-knowledge proof

Authors:
Akihiro Yamamura;Takashi Kurokawa;Junji Nakazato
Affiliations:
National Institute of Information and Communications Technology, Koganei, Tokyo, Japan;National Institute of Information and Communications Technology, Koganei, Tokyo, Japan;National Institute of Information and Communications Technology, Koganei, Tokyo, Japan
Venue:
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Year:
2007

Citing 5
Cited 0

Zero-knowledge proofs of identity

Journal of Cryptology
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Communication-efficient anonymous group identification

CCS '98 Proceedings of the 5th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the communication efficient t-out-of-m scheme proposed by De Santis, Di Crescenzo, and Persiano [Communicationefficient anonymous group identification, ACM Conference on Computer and Communications Security, (1998) 73-82] is incorrect; an authorized group may fail to prove the identity even though the verifier is honest. We rigorously discuss the condition where the scheme works correctly. In addition, we propose a new scheme attaining Θ(mn) communication complexity, where n is the security parameter. It improves the current best communication complexity Θ(mn) of the t-out-of-m scheme, and it can be also considered as a zero-knowledge proof for t out of m secrets.