Abstract
We present a system, named Homage, for verifying that a person is a member of some group without anyone, not even the issuing body, being able to determine their identity. Homage provides a strong disincentive to people against their passing on their membership-proving information to others. The computation and data transfer required are unaffected by the number of members, and are low enough to be appropriate for smart card implementations. The anonymity of Homage is based on the assumption that the Diffie-Hellman decision problem is hard. This paper does not prove that forgery is impossible, although it does provide strong evidence that this is the case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dan Boneh. The decision Diffie-Hellman problem. In Third Algorithmic Number Theory Symposium, volume 1423 of Lecture Notes in Computer Science, pages 48–63. Springer-Verlag, 1998.
Jan Camenisch and Markus Stadler. Efficient group signature schemes for large groups. In CRYPTO 97 Proceedings, volume 1294of Advances in Cryptology, pages 410–424. Springer-Verlag, 1997.
David Chaum and Torben Pedersen. Wallet databases with observers. In CRYPTO 92 Proceedings, volume 740 of Advances in Cryptology, pages 89–105. Springer-Verlag, 1992.
Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano. Communication-efficient anonymous group identification. In 5th ACM Conference on Computer and Communications Security, pages 73–82, November 1998.
Stuart Schechter, Todd Parnell, and Alexander Hartemink. Anonymous authentication of membership in dynamic groups. In Financial Cryptography 99, February 1999.
Claus Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239–252, 1991.
Paul Syverson, Stuart Stubblebine, and David Goldschlag. Unlinkable serial transactions. In Financial Cryptography 91, February 1997.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Handley, B. (2001). Resource-Efficient Anonymous Group Identification. In: Frankel, Y. (eds) Financial Cryptography. FC 2000. Lecture Notes in Computer Science, vol 1962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45472-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-45472-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42700-1
Online ISBN: 978-3-540-45472-4
eBook Packages: Springer Book Archive