{"created":"2025-01-19T00:53:45.800281+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00186839","sets":["581:9322:9325"]},"path":["9325"],"owner":"11","recid":"186839","title":["秘密分散法を用いた次数変化のない秘匿計算手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-03-15"},"_buckets":{"deposit":"b49ff1b0-df5c-4093-97be-1f587b426998"},"_deposit":{"id":"186839","pid":{"type":"depid","value":"186839","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"秘密分散法を用いた次数変化のない秘匿計算手法","author_link":["420402","420403","420401","420404","420398","420400","420405","420399"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"秘密分散法を用いた次数変化のない秘匿計算手法"},{"subitem_title":"Secure Computation without Changing Polynomial Degree in (k, n) Secret Sharing Scheme","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[特集：運用でカバーする時代の終焉へ向けてのインターネットと運用技術] 秘匿計算，(k,n)しきい値秘密分散法，マルチパーティ計算，情報理論的安全性","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2018-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京理科大学"},{"subitem_text_value":"東京理科大学"},{"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"},{"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/186839/files/IPSJ-JNL5903030.pdf","label":"IPSJ-JNL5903030.pdf"},"date":[{"dateType":"Available","dateValue":"2020-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL5903030.pdf","filesize":[{"value":"825.0 kB"}],"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":"6052f921-41d9-4e24-aec7-abb8066ef05a","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":[{}]},{"creatorNames":[{"creatorName":"ムハンマド, カマル アフマド アクマル アミヌディン"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"岩村, 惠市"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takeshi, Shingu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ken, Aoi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"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)しきい値秘密分散法を用いて，秘密情報に0を含まないという条件の下で2k - 1 > nの場合でも秘匿四則演算が可能な手法を提案する．一般に，Shamir法を用いた乗算はk - 1次の多項式からなる分散値どうしの乗算となるため，乗算結果の多項式の次数が2k - 2となってしまう問題点があり，分散数nは2k - 1以上にしなければならないという制限があった．提案手法では秘密情報を分散する際，乱数を掛けて秘匿化した秘匿化秘密情報をShamir法によって分散し，乗算を行う際に，一方の秘匿化秘密情報の分散値を集めて，一時的に分散した秘匿化秘密情報を復元する．秘匿化秘密情報はスカラー量であるので，多項式で表現されるもう一方の分散値と乗算しても多項式の次数が増えないためこの問題点を解決できる．さらに，本論文では提案方式の安全性を検討し，多入力の秘匿加減算および秘匿乗除算に対しても情報理論的安全性を持つことを示す．これによって，秘匿乗算を含む場合でもサーバ台数などの運用を変える必要のないシステムが構築できる．ただし，提案方式の安全性は同じタイプの演算の組合せに制限され，異なるタイプの演算の安全な組合せ（たとえば，秘匿積和演算）に関しては今後の課題になる．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a new secrecy multiplication scheme without changing the polynomial degree even in case of 2k - 1 > n under the condition that 0 is not included in secret information in Shamir's (k, n) secret sharing scheme. In general, the multiplication in Shamir's scheme has a problem that the degree of the polynomial increases to 2k - 2 and there is a limitation that the number n must be 2k - 1 or more. Our scheme generates a scalar value called a concealed secret, which multiplies a secret by a random number, and distributes the concealed secret by using Shamir's scheme. When secure multiplying, we temporarily reconstruct the concealed secret, and multiply it with a share. Therefore, we can perform secrecy multiplication without changing the degree of polynomials by multiplying a polynomial and scalar value. We evaluate the security of our schemes, and show a possible application.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1049","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"1038","bibliographicIssueDates":{"bibliographicIssueDate":"2018-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"59"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"links":{},"id":186839,"updated":"2025-01-20T02:27:06.190588+00:00"}