Anonymous Authentication of Membership in Dynamic Groups
Author(s): Stuart Schechter, Todd Parnell, Alexander Hartemink

Date: 1999
Publication: Proceedings of the Third International Conference on Financial Cryptography, FC '99
Page(s): 184 - 195
Publisher: Springer-Verlag
Source 1: http://cgs.csail.mit.edu/history/publications/Papers/fc99lncs.pdf
Source 2: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.4211

Abstract:
We present a series of protocols for authenticating an individual's membership in a group without revealing that individual's identity and without restricting how the membership of the group may be changed. In systems using these protocols a single message to the authenticator may be used by an individual to replace her lost key or by a trusted third party to add and remove members of the group. Applications in electronic commerce and communication can thus use these protocols to provide anonymous authentication while accommodating frequent changes in membership. We build these protocols on top of a new primitive: the verifiably common secret encoding. We show a construction for this primitive, the security of which is based on the existence of public-key cryptosystems capable of securely encoding multiple messages containing the same plaintext. Because the size of our construct grows linearly with the number of members in the group, we describe techniques for partitioning groups to improve performance.



Do you have additional information to contribute regarding this research paper? If so, please email siteupdates@passwordresearch.com with the details.

<-- Back to Authentication Research Paper Index





[Home] [About Us] [News] [Research]

Copyright © 2016 PasswordResearch.com