Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Collusion-Attack Free ID-Based Non-interactive Key Sharing Hatsukazu TANAKA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E89-A No.6 pp.1820-1824 Publication Date: 2006/06/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e89-a.6.1820 Print ISSN: 0916-8508 Type of Manuscript: PAPER Category: Information Security Keyword: identity-information, non-interactive key sharing, identity-based cryptosystem, discrete logarithm problem, factoring problem, collusion-attack free, Full Text: PDF(126.1KB)>> | Errata(Uploaded on September 1,2006) 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. | ||||||||||
| ||||||||||
