WEKO3
アイテム
Hierarchical Secret-Sharing Scheme Based on XOR Operations
https://ipsj.ixsq.nii.ac.jp/records/239360
https://ipsj.ixsq.nii.ac.jp/records/23936050e7ec9d-9ec7-460d-816d-953e4451aed7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL6509006.pdf (689.6 kB)
2026年9月15日からダウンロード可能です。
|
Copyright (c) 2024 by the Information Processing Society of Japan
|
|
| 非会員：¥0, IPSJ:学会員：¥0, 論文誌:会員：¥0, DLIB:会員：¥0 | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2024-09-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Hierarchical Secret-Sharing Scheme Based on XOR Operations | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Hierarchical Secret-Sharing Scheme Based on XOR Operations | |||||||||
| 言語 | ||||||||||
| 言語 | 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 | |||||||||
| 内容記述 | Hierarchical secret-sharing schemes (HSSSs) are known for the manner in which they share a secret among a group of participants partitioned into levels. First, we developed a fast HSSS that requires a minimal number of higher-level participants for recovering the secret. Next, in HSSSs, depending on the allocation of participant identities, there exists a specific case in which the secret cannot be recovered in spite of the presence of an authorized subset. For practical use, this traditional allocation issue should be eliminated in advance by adopting some simple condition. In this paper, we propose an XOR-based HSSS that can be applied to any level. It theoretically resolves the allocation issue for threshold k=3 with a simple condition and is therefore ideal for practical use. 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.32(2024) (online) DOI http://dx.doi.org/10.2197/ipsjjip.32.719 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Hierarchical secret-sharing schemes (HSSSs) are known for the manner in which they share a secret among a group of participants partitioned into levels. First, we developed a fast HSSS that requires a minimal number of higher-level participants for recovering the secret. Next, in HSSSs, depending on the allocation of participant identities, there exists a specific case in which the secret cannot be recovered in spite of the presence of an authorized subset. For practical use, this traditional allocation issue should be eliminated in advance by adopting some simple condition. In this paper, we propose an XOR-based HSSS that can be applied to any level. It theoretically resolves the allocation issue for threshold k=3 with a simple condition and is therefore ideal for practical use. 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.32(2024) (online) DOI http://dx.doi.org/10.2197/ipsjjip.32.719 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 65, 号 9, 発行日 2024-09-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
| 公開者 | ||||||||||
| 言語 | ja | |||||||||
| 出版者 | 情報処理学会 | |||||||||
