{"created":"2025-01-19T01:45:18.917108+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240874","sets":["6164:6165:6462:11854"]},"path":["11854"],"owner":"11","recid":"240874","title":["マルチパーティ計算における定数ラウンドでの冪乗計算アルゴリズムの効率化"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2024-10-15"},"_buckets":{"deposit":"17ba2be7-0717-45cc-bba8-d9fc7e83dbd8"},"_deposit":{"id":"240874","pid":{"type":"depid","value":"240874","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"マルチパーティ計算における定数ラウンドでの冪乗計算アルゴリズムの効率化","author_link":["661867","661868"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"マルチパーティ計算における定数ラウンドでの冪乗計算アルゴリズムの効率化","subitem_title_language":"ja"},{"subitem_title":"An efficient exponentiation algorithm on multi-party computation in constant rounds","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"秘密分散，マルチパーティ計算","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2024-10-15","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"佐賀大学"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Saga University","subitem_text_language":"en"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"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/240874/files/IPSJ-CSS2024128.pdf","label":"IPSJ-CSS2024128.pdf"},"date":[{"dateType":"Available","dateValue":"2026-10-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSS2024128.pdf","filesize":[{"value":"294.3 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":"30"},{"tax":["include_tax"],"price":"0","billingrole":"46"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"98b76d52-1e4b-4773-8c3e-4259db61028f","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岩﨑, 淳"}],"nameIdentifiers":[{}]}]},"item_18_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Atsushi, Iwasaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"マルチパーティ計算においては冪乗の計算は通常の（マルチパーティ計算でない）計算以上に汎用的で多用される．冪指数によらずに定数ラウンドで冪乗を計算する手法として [Bar-Ilan\\&Beaver, 1989]が古典的に知られており，3ラウンドで冪指数の5倍の数の乗算演算に相当する通信量により実行できる．しかしながら，その手法はpre-fix積という冪乗を含むより広いクラスの計算を行うものであり，冪乗を計算するという観点からは必ずしも効率的とは言えない．本稿では，冪乗の計算に特化した，3ラウンドとリーディングタームが冪指数に一致する通信量で実行できる冪乗計算アルゴリズムを提案する．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Computation of exponentiation is frequently used on multi-party computation. [Bar-Ilan&Beaver, 1989] is the most commonly used algorithm to compute exponentiation in 3 communication rounds regardless of the exponent, and takes communication amount of the 5 times of the exponent. The algorithm can compute pre-fix multiplication, which is a more general class including exponentiation. It means conversely that the algorithm is not optimal to compute  exponentiation. In this paper, we propose an algorithm which is specialized to exponentiation. The proposed algorithm can be performed in 3 rounds and the leading term of its communication amount is equal to the exponent.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"960","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2024論文集"}],"bibliographicPageStart":"955","bibliographicIssueDates":{"bibliographicIssueDate":"2024-10-15","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":240874,"updated":"2025-03-06T05:35:24.610043+00:00","links":{}}