An Efficient Anonymous Group Identification Scheme with Short Secret Keys
Summary :
We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu 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 p is hard even when the exponent is a small c-bit number. We show that the communication and the computation costs are lower than those of the Lee-Deng-Zhu scheme.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.3 pp.757-760
- Publication Date
- 2004/03/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toshiyuki ISSHIKI, Keisuke TANAKA, "An Efficient Anonymous Group Identification Scheme with Short Secret Keys" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 3, pp. 757-760, March 2004, doi: .
Abstract: We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu 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 p is hard even when the exponent is a small c-bit number. We show that the communication and the computation costs are lower than those of the Lee-Deng-Zhu scheme.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_3_757/_p
Copy
@ARTICLE{e87-a_3_757,
author={Toshiyuki ISSHIKI, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Efficient Anonymous Group Identification Scheme with Short Secret Keys},
year={2004},
volume={E87-A},
number={3},
pages={757-760},
abstract={We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu 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 p is hard even when the exponent is a small c-bit number. We show that the communication and the computation costs are lower than those of the Lee-Deng-Zhu scheme.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Efficient Anonymous Group Identification Scheme with Short Secret Keys
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 757
EP - 760
AU - Toshiyuki ISSHIKI
AU - Keisuke TANAKA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2004
AB - We suggest to use short secret keys in the anonymous group identification scheme proposed by Lee, Deng, and Zhu 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 p is hard even when the exponent is a small c-bit number. We show that the communication and the computation costs are lower than those of the Lee-Deng-Zhu scheme.
ER -
English
