An efficient anonymous group identification scheme with human memorizable secret keys

Authors:
Toshiyuki Isshiki;Keisuke Tanaka
Affiliations:
Tokyo Institute of Technology, Tokyo, Japan;Tokyo Institute of Technology, Tokyo, Japan
Venue:
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Year:
2004

Citing 4
Cited 0

Communication-efficient anonymous group identification

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Discrete Log Pseudo Random Generator

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu [7] and prove that this scheme is secure under the discrete logarithm with short exponents assumption that solving the discrete logarithm problem modulo an n-bit prime is hard even when the exponent is a small c-bit number (c « n). We show that the communication and the computation costs are lower than those of the Lee-Deng-Zhu scheme. Our proposed scheme can be used as an anonymous group identification scheme with human memorizable passwords.