WEKO3
アイテム
Information-theoretically Secure Timed-release Secret Sharing Schemes
https://ipsj.ixsq.nii.ac.jp/records/164197
https://ipsj.ixsq.nii.ac.jp/records/164197a486a437-ca26-41ca-adba-2d1ed6634ca7
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5706005.pdf (211.1 kB)
|
Copyright (c) 2016 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-06-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Information-theoretically Secure Timed-release Secret Sharing Schemes | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Information-theoretically Secure Timed-release Secret Sharing Schemes | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [一般論文] information theoretic security, secret sharing schemes, timed-release security, unconditional security | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Graduate School of Environment and Information Sciences, Yokohama National University / Presently with Graduate School of Informatics and Engineering, The University of Electro-Communications | ||||||||||
| 著者所属 | ||||||||||
| Graduate School of Environment and Information Sciences, Yokohama National University / Institute of Advanced Sciences, Yokohama National University | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Environment and Information Sciences, Yokohama National University / Presently with Graduate School of Informatics and Engineering, The University of Electro-Communications | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Graduate School of Environment and Information Sciences, Yokohama National University / Institute of Advanced Sciences, Yokohama National University | ||||||||||
| 著者名 |
Yohei, Watanabe
× Yohei, Watanabe
× Junji, Shikata
|
|||||||||
| 著者名(英) |
Yohei, Watanabe
× Yohei, Watanabe
× Junji, Shikata
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | In modern cryptography, the secret sharing scheme is an important cryptographic primitive, and it is used in various situations. In this paper, timed-release secret sharing (TR-SS) schemes with information-theoretic security is first studied. TR-SS is a secret sharing scheme with the property that more than a threshold number of participants can reconstruct a secret by using their shares only when the time specified by a dealer has come. Specifically, in this paper we first introduce models and formalization of security for two kinds of TR-SS based on the traditional secret sharing scheme and information-theoretic timed-release security. We also derive tight lower bounds on the sizes of shares, time-signals, and entities' secret-keys required for each TR-SS scheme. In addition, we propose direct constructions for the TR-SS schemes. Each direct construction is optimal in the sense that the construction meets equality in each of our bounds, respectively. As a result, it is shown that timed-release security can be realized without any additional redundancy on the share size. ------------------------------ 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.24(2016) No.4 (online) ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | In modern cryptography, the secret sharing scheme is an important cryptographic primitive, and it is used in various situations. In this paper, timed-release secret sharing (TR-SS) schemes with information-theoretic security is first studied. TR-SS is a secret sharing scheme with the property that more than a threshold number of participants can reconstruct a secret by using their shares only when the time specified by a dealer has come. Specifically, in this paper we first introduce models and formalization of security for two kinds of TR-SS based on the traditional secret sharing scheme and information-theoretic timed-release security. We also derive tight lower bounds on the sizes of shares, time-signals, and entities' secret-keys required for each TR-SS scheme. In addition, we propose direct constructions for the TR-SS schemes. Each direct construction is optimal in the sense that the construction meets equality in each of our bounds, respectively. As a result, it is shown that timed-release security can be realized without any additional redundancy on the share size. ------------------------------ 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.24(2016) No.4 (online) ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 57, 号 6, 発行日 2016-06-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
