Collusion-Attack Free ID-Based Non-interactive Key Sharing
Summary :
A new simply implemented collusion-attack free identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. A common-key can be shared by executing only once a modular exponentiation which is equivalent to RSA deciphering, and the security depends on the difficulty of factoring and the discrete logarithm problem. Each user's secret information can be generated by solving two simple discrete logarithm problems and synthsizing their solutions by linear combination. The detail comparison with the Maurer-Yacobi's scheme including its modified versions shows that the computational complexity to generate each user's secret information is much smaller and the freedom to select system parameters is much greater than that of the Maurer-Yacobi's scheme. Then our proposed scheme can be implemented very easily and hence it is suitable for practical use.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.6 pp.1820-1824
- Publication Date
- 2006/06/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e89-a.6.1820
- Type of Manuscript
- PAPER
- 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
Hatsukazu TANAKA, "Collusion-Attack Free ID-Based Non-interactive Key Sharing" in IEICE TRANSACTIONS on Fundamentals,
vol. E89-A, no. 6, pp. 1820-1824, June 2006, doi: 10.1093/ietfec/e89-a.6.1820.
Abstract: A new simply implemented collusion-attack free identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. A common-key can be shared by executing only once a modular exponentiation which is equivalent to RSA deciphering, and the security depends on the difficulty of factoring and the discrete logarithm problem. Each user's secret information can be generated by solving two simple discrete logarithm problems and synthsizing their solutions by linear combination. The detail comparison with the Maurer-Yacobi's scheme including its modified versions shows that the computational complexity to generate each user's secret information is much smaller and the freedom to select system parameters is much greater than that of the Maurer-Yacobi's scheme. Then our proposed scheme can be implemented very easily and hence it is suitable for practical use.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.6.1820/_p
Copy
@ARTICLE{e89-a_6_1820,
author={Hatsukazu TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Collusion-Attack Free ID-Based Non-interactive Key Sharing},
year={2006},
volume={E89-A},
number={6},
pages={1820-1824},
abstract={A new simply implemented collusion-attack free identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. A common-key can be shared by executing only once a modular exponentiation which is equivalent to RSA deciphering, and the security depends on the difficulty of factoring and the discrete logarithm problem. Each user's secret information can be generated by solving two simple discrete logarithm problems and synthsizing their solutions by linear combination. The detail comparison with the Maurer-Yacobi's scheme including its modified versions shows that the computational complexity to generate each user's secret information is much smaller and the freedom to select system parameters is much greater than that of the Maurer-Yacobi's scheme. Then our proposed scheme can be implemented very easily and hence it is suitable for practical use.},
keywords={},
doi={10.1093/ietfec/e89-a.6.1820},
ISSN={1745-1337},
month={June},}
Copy
TY - JOUR
TI - Collusion-Attack Free ID-Based Non-interactive Key Sharing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1820
EP - 1824
AU - Hatsukazu TANAKA
PY - 2006
DO - 10.1093/ietfec/e89-a.6.1820
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2006
AB - A new simply implemented collusion-attack free identity-based non-interactive key sharing scheme (ID-NIKS) has been proposed. A common-key can be shared by executing only once a modular exponentiation which is equivalent to RSA deciphering, and the security depends on the difficulty of factoring and the discrete logarithm problem. Each user's secret information can be generated by solving two simple discrete logarithm problems and synthsizing their solutions by linear combination. The detail comparison with the Maurer-Yacobi's scheme including its modified versions shows that the computational complexity to generate each user's secret information is much smaller and the freedom to select system parameters is much greater than that of the Maurer-Yacobi's scheme. Then our proposed scheme can be implemented very easily and hence it is suitable for practical use.
ER -
English
