WEKO3
アイテム
A CDH-based ordered multisignature scheme provably secure without random oracles
http://hdl.handle.net/2297/37596
http://hdl.handle.net/2297/37596c7d60b54-b073-4d67-a95d-cf511531e0d8
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
TE-PR-MAMBO-M-366.pdf (434.8 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-10-03 | |||||
| タイトル | ||||||
| タイトル | A CDH-based ordered multisignature scheme provably secure without random oracles | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | journal article | |||||
| 著者 |
Yanai, Naoto
× Yanai, Naoto× Chida, Eikoh× Mambo, Masahiro× Okamoto, Eiji |
|||||
| 書誌情報 |
Journal of Information Processing 巻 22, 号 2, p. 366-375, 発行日 2014-01-01 |
|||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 1882-6652 | |||||
| DOI | ||||||
| 関連タイプ | isIdenticalTo | |||||
| 識別子タイプ | DOI | |||||
| 関連識別子 | 10.2197/ipsjjip.22.366 | |||||
| 出版者 | ||||||
| 出版者 | Information Processing Society of Japan = 情報処理学会 | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | 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.85 msec from 1.6 msec. © 2014 Information Processing Society of Japan. | |||||
| 権利 | ||||||
| 権利情報 | Copyright © 2014 by the Information Processing Society of Japan | |||||
| 著者版フラグ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
| 関連URI | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://www.jstage.jst.go.jp/browse/ipsjjip | |||||
| 関連URI | ||||||
| 識別子タイプ | URI | |||||
| 関連識別子 | https://www.ipsj.or.jp/ | |||||
