WEKO3
アイテム
New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (k, n) Threshold Secret Sharing Schemes
https://ipsj.ixsq.nii.ac.jp/records/210368
https://ipsj.ixsq.nii.ac.jp/records/210368ebfc1e19-5a59-4d8e-bb71-db15f58586ee
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6203025.pdf (262.7 kB)
|
Copyright (c) 2021 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2021-03-15 | |||||||||
| タイトル | ||||||||||
| タイトル | New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (k, n) Threshold Secret Sharing Schemes | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | New Proof Techniques Using the Properties of Circulant Matrices for XOR-based (k, n) Threshold Secret Sharing Schemes | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [一般論文（テクニカルノート）] secret sharing scheme, XOR-based scheme, circulant matrix, software implementation | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Institute of Information Security | ||||||||||
| 著者所属 | ||||||||||
| Institute of Information Security | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Institute of Information Security | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Institute of Information Security | ||||||||||
| 著者名 |
Koji, Shima
× Koji, Shima
× Hiroshi, Doi
|
|||||||||
| 著者名(英) |
Koji, Shima
× Koji, Shima
× Hiroshi, Doi
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Several secret sharing schemes with low computational costs have been proposed. XOR-based secret sharing schemes have been reported to be a part of such low-cost schemes. However, no discussion has been provided on the connection between them and the properties of circulant matrices. In this paper, we propose several theorems of circulant matrices to discuss the rank of a matrix and then show that we can discuss XOR-based secret sharing schemes using the properties of circulant matrices. We also present an evaluation of our software implementation. ------------------------------ 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.29(2021) (online) DOI http://dx.doi.org/10.2197/ipsjjip.29.266 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Several secret sharing schemes with low computational costs have been proposed. XOR-based secret sharing schemes have been reported to be a part of such low-cost schemes. However, no discussion has been provided on the connection between them and the properties of circulant matrices. In this paper, we propose several theorems of circulant matrices to discuss the rank of a matrix and then show that we can discuss XOR-based secret sharing schemes using the properties of circulant matrices. We also present an evaluation of our software implementation. ------------------------------ 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.29(2021) (online) DOI http://dx.doi.org/10.2197/ipsjjip.29.266 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 62, 号 3, 発行日 2021-03-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
