{"links":{},"id":191457,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00191457","sets":["581:9322:9331"]},"path":["9331"],"owner":"11","recid":"191457","title":["秘密分散法を用いた四則演算の組み合わせに対して安全な次数変化のない秘匿計算"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-09-15"},"_buckets":{"deposit":"7a44b4a3-efdc-4172-ad60-0fec93f1fd59"},"_deposit":{"id":"191457","pid":{"type":"depid","value":"191457","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"秘密分散法を用いた四則演算の組み合わせに対して安全な次数変化のない秘匿計算","author_link":["441808","441806","441807","441805"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"秘密分散法を用いた四則演算の組み合わせに対して安全な次数変化のない秘匿計算"},{"subitem_title":"Conditionally Secure Multiparty Computation When n < 2k - 1","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：超スマート社会を支えるコンピュータセキュリティ技術] 秘匿計算，秘密分散，n < 2k - 1，マルチパーティ計算，情報理論的安全性","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2018-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京理科大学"},{"subitem_text_value":"東京理科大学"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Tokyo University of Science","subitem_text_language":"en"},{"subitem_text_value":"Tokyo University of Science","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/191457/files/IPSJ-JNL5909012.pdf","label":"IPSJ-JNL5909012.pdf"},"date":[{"dateType":"Available","dateValue":"2020-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5909012.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"78a4c012-06a6-4b7d-b125-32a9117719b9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"ムハンマド, カマル アフマド アクマル アミヌディン"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"岩村, 恵市"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ahmad, Akmal Aminuddin Mohd Kamal","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Keiichi, Iwamura","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_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":"一般に，Shamirの(k, n)閾値秘密分散法を用いた秘匿計算では，乗算を行う際に乗算結果の多項式の次数がk - 1から2k - 2に変化してしまうため，復元に必要な分散値の個数がkから2k - 1に変化してしまうという問題があった．神宮らが提案した方式では，スカラー量×多項式というアプローチを用いて，次数変化の問題を解決したが，積和演算を実行すると，秘密情報が漏洩するという問題があった．そこで，本論文では，Shamirの(k, n)閾値秘密分散を用いた秘匿計算において，積和演算に対しても次数が変化せず，かつ秘密情報が漏洩しない安全な秘匿計算手法を提案する．これによって秘匿四則演算の組合せを安全に実行できる．本論文では，passiveな攻撃者を仮定し，(1)秘匿乗算において秘密情報に0を含まない，(2)攻撃者が知らない乱数を用いた1に対する分散値集合がある，(3)演算の連続において各サーバが扱う分散値集合内の分散値の位置は固定されるという3つの前提条件をおく．この条件のもと，情報理論的な安全性を実現する秘匿計算が実現できることを示す．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a new Secure Multiparty Computation (MPC) scheme using Shamir's (k, n)-threshold secret sharing scheme that enable computation of multiplication and addition to be done in consecutive manner while maintaining the condition of n < 2k - 1. Typically, secure multiparty computation that employs a secret sharing scheme is not unconditionally secure if n < 2k - 1. However, this also means that secure multiparty computation with n < 2k - 1 is realizable using a conditionally secure approach. Therefore, in this study, we clarify the conditions needed as well as present a detailed method necessary to achieve conditionally secure multiparty computation using secret sharing scheme for n < 2k - 1. By assuming a passive adversary, we propose a conditionally secure multiparty computation that is secure against k - 1 number of adversary with a lower processing time compare to secure multiparty computation method proposed by Damgård et al. In this paper, we also evaluate the security of our proposed method.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1595","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1581","bibliographicIssueDates":{"bibliographicIssueDate":"2018-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"59"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:57:20.597263+00:00","updated":"2025-01-20T00:39:04.802323+00:00"}