http://swrc.ontoware.org/ontology#TechnicalReport
A Certificateless Signature Scheme to Reduce Loads on Key Generation Center
en
Osaka University
Osaka University／NICT
Osaka University
NAIST／Osaka University
Osaka University
Osaka University
Ei Khaing Win
Yuuichi Teranishi
Yoshimasa Ishi
Tomoya Kawakami
Tomoki Yoshihisa
Shinji Shimojo
Certificateless public key cryptography (CLPKC) eliminates the certificate and avoids key escrow problem. In CLPKC, Key Generation Center (KGC) is responsible for generating partial private key and revoking a user is an important problem. There have been some solutions to revoke users in CLPKC. Though an existing solution proposes a pairing-free revocation scheme, it still requires high time key computation cost of exponentiation operations on KGC. In this paper, we propose a revocable certificate-less signature scheme which requires less computation cost than existing schemes. In the proposed scheme, valid users receive the time key, which is calculated using only one exponentiation operation and some hash operations on KGC for a revocation. Under the discrete logarithm problem assumption, we prove that the proposed scheme is secure against existential forgeability in the random oracles.
Certificateless public key cryptography (CLPKC) eliminates the certificate and avoids key escrow problem. In CLPKC, Key Generation Center (KGC) is responsible for generating partial private key and revoking a user is an important problem. There have been some solutions to revoke users in CLPKC. Though an existing solution proposes a pairing-free revocation scheme, it still requires high time key computation cost of exponentiation operations on KGC. In this paper, we propose a revocable certificate-less signature scheme which requires less computation cost than existing schemes. In the proposed scheme, valid users receive the time key, which is calculated using only one exponentiation operation and some hash operations on KGC for a revocation. Under the discrete logarithm problem assumption, we prove that the proposed scheme is secure against existential forgeability in the random oracles.
AN10116224
研究報告マルチメディア通信と分散処理（DPS）
2018-DPS-174
21
1-6
2018-02-26
2188-8906