ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. 論文誌(ジャーナル)
  2. Vol.54
  3. No.9

New Construction Methods of Secret Sharing Schemes Based on Authorized Subsets

https://ipsj.ixsq.nii.ac.jp/records/95213
https://ipsj.ixsq.nii.ac.jp/records/95213
27d46ae9-bd18-4cf1-adc1-5eace611b699
名前 / ファイル ライセンス アクション
IPSJ-JNL5409004.pdf IPSJ-JNL5409004 (174.6 kB)
Copyright (c) 2013 by the Information Processing Society of Japan
オープンアクセス
Item type Journal(1)
公開日 2013-09-15
タイトル
タイトル New Construction Methods of Secret Sharing Schemes Based on Authorized Subsets
タイトル
言語 en
タイトル New Construction Methods of Secret Sharing Schemes Based on Authorized Subsets
言語
言語 eng
キーワード
主題Scheme Other
主題 [特集:未来を切り開くコンピュータセキュリティ技術] (k, n)-threshold scheme, secret sharing scheme, general access structure
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_6501
資源タイプ journal article
著者所属
Department of Mathematical Information Engineering, College of Industrial Technology, Nihon University
著者所属(英)
en
Department of Mathematical Information Engineering, College of Industrial Technology, Nihon University
著者名 Kouya, Tochikubo

× Kouya, Tochikubo

Kouya, Tochikubo

Search repository
著者名(英) Kouya, Tochikubo

× Kouya, Tochikubo

en Kouya, Tochikubo

Search repository
論文抄録
内容記述タイプ Other
内容記述 We propose new construction methods of secret sharing schemes realizing general access structures. Our proposed construction methods are perfect secret sharing schemes and include Shamir's (k, n)-threshold schemes as a special case. Furthermore, except for some access structures for which the efficiency is the same as the previous ones, the proposed construction methods are more efficient than Benaloh and Leichter's scheme and the scheme I of TUM05.

------------------------------
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.21(2013) No.4 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.21.590
------------------------------
論文抄録(英)
内容記述タイプ Other
内容記述 We propose new construction methods of secret sharing schemes realizing general access structures. Our proposed construction methods are perfect secret sharing schemes and include Shamir's (k, n)-threshold schemes as a special case. Furthermore, except for some access structures for which the efficiency is the same as the previous ones, the proposed construction methods are more efficient than Benaloh and Leichter's scheme and the scheme I of TUM05.

------------------------------
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.21(2013) No.4 (online)
DOI http://dx.doi.org/10.2197/ipsjjip.21.590
------------------------------
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AN00116647
書誌情報 情報処理学会論文誌

巻 54, 号 9, 発行日 2013-09-15
ISSN
収録物識別子タイプ ISSN
収録物識別子 1882-7764
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-20 06:47:43.468449
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3