A CDH-based Ordered Multisignature Scheme Provably Secure without Random Oracles

• Item type: Journal(1)
• 公開日: 2014-02-15
• タイトル: A CDH-based Ordered Multisignature Scheme Provably Secure without Random Oracles
• タイトル / 言語: en
• タイトル: A CDH-based Ordered Multisignature Scheme Provably Secure without Random Oracles
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: [一般論文(推薦論文)] multisignatures, ordred multisignatures, standard model, CDH problem
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: University of Tsukuba
• 著者所属: Ichinoseki National College of Technology
• 著者所属: Kanazawa University
• 著者所属: University of Tsukuba
• 著者所属(英): en
• 著者所属(英): University of Tsukuba
• 著者所属(英): en
• 著者所属(英): Ichinoseki National College of Technology
• 著者所属(英): en
• 著者所属(英): Kanazawa University
• 著者所属(英): en
• 著者所属(英): University of Tsukuba
• 著者名: Naoto, Yanai; Eikoh, Chida; Masahiro, Mambo; Eiji, Okamoto
• 著者名(英): Naoto, Yanai; Eikoh, Chida; Masahiro, Mambo; Eiji, Okamoto
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Ordered multisignature scheme is a signature scheme to guarantee both validity of an electronic document and its signing order. Although the security of most of such schemes has been proven in the random oracle model, the difficulty of implementation of the random oracle implies that the security should be proven without random oracles, i.e., in the standard model. A straightforward way to construct such schemes in the standard model is to apply aggregate signature schemes. However, the existing schemes based on the CDH problem are inefficient in the sense that the number of computations of the bilinear maps and the length of public keys depend upon the length of (a hash value of) the message. Therefore, in this paper, we propose a CDH-based ordered multisignature scheme which is provably secure in the standard model under a moderate attack model. Its computational cost for the bilinear maps and the size of public key are independent of the length of (a hash value of) the message. More specifically, in comparison with the existing schemes, the public key length is reduced to three group elements from 512 group elements while the computational cost is reduced to 0.85msec from 1.6msec.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.22(2014) No.2 (online); DOI http://dx.doi.org/10.2197/ipsjjip.22.366; ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Ordered multisignature scheme is a signature scheme to guarantee both validity of an electronic document and its signing order. Although the security of most of such schemes has been proven in the random oracle model, the difficulty of implementation of the random oracle implies that the security should be proven without random oracles, i.e., in the standard model. A straightforward way to construct such schemes in the standard model is to apply aggregate signature schemes. However, the existing schemes based on the CDH problem are inefficient in the sense that the number of computations of the bilinear maps and the length of public keys depend upon the length of (a hash value of) the message. Therefore, in this paper, we propose a CDH-based ordered multisignature scheme which is provably secure in the standard model under a moderate attack model. Its computational cost for the bilinear maps and the size of public key are independent of the length of (a hash value of) the message. More specifically, in comparison with the existing schemes, the public key length is reduced to three group elements from 512 group elements while the computational cost is reduced to 0.85msec from 1.6msec.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.22(2014) No.2 (online); DOI http://dx.doi.org/10.2197/ipsjjip.22.366; ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 55, 号 2, 発行日 2014-02-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764