Abstract
We propose two membership authentication schemes that allow an authorized user to construct one master secret key for accessing the set of hierarchically ordered groups defined by the user, without releasing any private user information. The key allows the user to prove his membership of his true groups and all lower groups, without revealing his name or true groups. The user can calculate the secret member information needed to access a group from his master secret key, and can convince a verifier using the extended Fiat-Shamir scheme. Each of two proposed schemes can generate the master secret key. To ensure the user’s privacy, one uses the blind signature and pseudonym encryption techniques, and the other uses Euclid’s algorithm. Because each user stores only one master secret key, memory usage is very efficient. Moreover, verifiers can check membership validity using public information independent of the number of users in an off-line environment. Therefore, our schemes are suitable for smart card applications.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.G. Akl and P.D. Taylor, “Cryptographic Solution to a Problem of Access Control in a Hierarchy,” ACM Trans. on Computer Systems, 1,3, pp.239–248 (1983)
D. Chaum, “Security without Identification: Transaction Systems to Make Big Brother Obsolete,” Comm. of the ACM, 28,10, pp.1030–1044 (1985)
D. Chaum, “Showing credentials without identification: Signatures transferred between unconditionally unlinkable pseudonyms,” Advances in Cryptology, Eurocrypt’85, Springer-Verlag, 1986, pp.241–244
D. Chaum, “Online Cash Checks,” Eurocrypt’89 (1989)
D. Chaum, “Untraceable electronic mail, return addresses and digital pseudonyms”, Comm. of the ACM, 24, 1981, pp.84–88
J.H. Everste and E. van Heyst, “Which RSA signatures can be computed from some given RSA signatures?”, in these proceedings
L.C. Guillou and J.J. Quisquater, “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Tranamission and Memory,” Eorocrypt’88 (1988)
K. Koyama, “Demonstrating membership of a group using the Shizuya-Koyama-Itoh (SKI) protocol,” The 1989 Symposium on Cryptography and Information Security (CIS’89), Gotenba, Japan (1989)
M. Kurosaki, T. Matsumoto and H. Imai, “Simple Methods for Multipurpose Certification,” The 1989 Symposium on Cryptography and Information Security (CIS’89), Gotenba, Japan (1989)
M. Kurosaki, T. Matsumoto and H. Imai, “Proving that you belong to at least one of the specified groups,” The 1990 Symposium on Cryptography and Information Security (SCIS’90), Hihondaira, Japan (1990)
S.J. Mackinnon, P.D. Taylor, H. Meijer and S.G. Akl, “An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy,” IEEE Trans. on Computers, 34,9, pp.797–802 (1985)
K. Ohta, “Efficient Identification and Signature Scheme,” Electro. Lett., 24,2, pp.115–116 (1988)
K. Ohta and T. Okamoto, “Modification of the Fiat-Shamir Scheme,” Crypto’88 (1988)
K. Ohta and T. Okamoto, “Membership authentication for Hierarchical Multigroups Using Master Secret Information,” The 1990 Symposium on Cryptography and Information Security (SCIS’90), Hihondaira, Japan (1990)
T. Okamoto and K. Ohta, “Membership authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme,” 1989 Autumn Natinal Convention Record, IEICE, Engineering Science, SA-8-5, (Sept. 1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohta, K., Okamoto, T., Koyama, K. (1991). Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive