Collusion-Attack Free ID-Based Non-interactive Key Sharing(Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2006-06-01
著者
関連論文
- Reversible Watermark with Large Capacity Based on the Prediction Error Expansion
- Fingerprinting Protocol Based on Distributed Providers Using Oblivious Transfer(Cryptography,Information Theory and Its Applications)
- Reversible Watermark with Large Capacity Based on the Prediction Error
- Collusion-Attack Free ID-Based Non-interactive Key Sharing(Information Security)
- Threshold Ring Signature Scheme Based on the Curve (特集:新たな脅威に立ち向かうコンピュータセキュリティ技術)
- Fingerprinting Protocol for On-Line Trade Using Information Gap between Buyer and Merchant
- Secure Length-Preserving All-or-Nothing Transform (特集 多様な社会的責任を担うコンピュータセキュリティ技術)
- Visual Commitment Using the Trusted Initializer
- Secure Length-Preserving All-or-Nothing Transform
- Secure Length-Preserving All-or-Nothing Transform