{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00239360","sets":["581:11492:11502"]},"path":["11502"],"owner":"44499","recid":"239360","title":["Hierarchical Secret-Sharing Scheme Based on XOR Operations"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-09-15"},"_buckets":{"deposit":"d980b87f-d9dd-4906-8f08-720be734cce0"},"_deposit":{"id":"239360","pid":{"type":"depid","value":"239360","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Hierarchical Secret-Sharing Scheme Based on XOR Operations","author_link":["655998","655999","655997","656000"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Hierarchical Secret-Sharing Scheme Based on XOR Operations"},{"subitem_title":"Hierarchical Secret-Sharing Scheme Based on XOR Operations","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集:サプライチェーンを安全にするサイバーセキュリティ技術] secret-sharing scheme, XOR-based scheme, circulant matrix, software implementation","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2024-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Institute of Information Security"},{"subitem_text_value":"Institute of Information Security"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Institute of Information Security","subitem_text_language":"en"},{"subitem_text_value":"Institute of Information Security","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/239360/files/IPSJ-JNL6509006.pdf","label":"IPSJ-JNL6509006.pdf"},"date":[{"dateType":"Available","dateValue":"2026-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6509006.pdf","filesize":[{"value":"689.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"bfea7c95-95f9-4767-abf7-e2f362b91351","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Koji, Shima"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroshi, Doi"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Koji, Shima","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hiroshi, Doi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_publisher_15":{"attribute_name":"公開者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"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.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.32(2024) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.32.719\n------------------------------","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"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.\n------------------------------\nThis is a preprint of an article intended for publication Journal of\nInformation Processing(JIP). This preprint should not be cited. This\narticle should be cited as: Journal of Information Processing Vol.32(2024) (online)\nDOI　http://dx.doi.org/10.2197/ipsjjip.32.719\n------------------------------","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2024-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"65"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T08:18:30.730567+00:00","created":"2025-01-19T01:42:57.785973+00:00","id":239360}