Abstract
We show that the communication efficient t-out-of-m scheme proposed by De Santis, Di Crescenzo, and Persiano [Communication-efficient 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 logm) of the t-out-of-m scheme, and it can be also considered as a zero-knowledge proof for t out of m secrets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
De Santis, A., Di Crescenzo, G., Persiano, G.: Communication-efficient anonymous group identification. In: CCS ’98: Proceedings of the 5th ACM conference on Computer and communications security, pp. 73–82 (1998)
De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: FOCS’94: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 454–465 (1994)
Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. J. Cryptology 1, 77–94 (1988)
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comp. 18, 186–208 (1989)
Lee, C.H., Deng, X., Zhu, H.: Design and security analysis of anonymou group identification protocols. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 188–198. Springer, Heidelberg (2002)
Lidl, R., Niderreiter, H.: Finite fields, 2nd edn. Cambridge University Press, Cambridge (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yamamura, A., Kurokawa, T., Nakazato, J. (2007). Threshold Anonymous Group Identification and Zero-Knowledge Proof. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds) Information Security and Privacy. ACISP 2007. Lecture Notes in Computer Science, vol 4586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73458-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-73458-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73457-4
Online ISBN: 978-3-540-73458-1
eBook Packages: Computer ScienceComputer Science (R0)