{"created":"2025-01-19T01:17:51.093388+00:00","updated":"2025-01-19T15:31:45.039966+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00217355","sets":["1164:2592:10824:10900"]},"path":["10900"],"owner":"44499","recid":"217355","title":["秘密計算基数ソートの通信量の削減"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-07"},"_buckets":{"deposit":"c9bad7d5-5d3d-4737-a4ed-a6077e420a33"},"_deposit":{"id":"217355","pid":{"type":"depid","value":"217355","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"秘密計算基数ソートの通信量の削減","author_link":["563041","563042"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"秘密計算基数ソートの通信量の削減"},{"subitem_title":"Oblivious Radix Sort with Less Communication","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-03-07","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京大学工学部計数工学科"},{"subitem_text_value":"東京大学大学院情報理工学系研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Mathematical Engineering and Information Physics, Faculty of Engineering, The University of Tokyo","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, The University of Tokyo","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/217355/files/IPSJ-AL22187007.pdf","label":"IPSJ-AL22187007.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-07"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL22187007.pdf","filesize":[{"value":"878.8 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":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"ddf92374-ffdf-43b6-a93d-c2d5052c99c3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"吉田, 勇輝"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"定兼, 邦彦"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"対象のデータの情報を秘匿したまま計算を行う秘密計算において，特にソーティングは多くのデータ処理において必要かつボトルネックであり，その高速化は重要な課題である．本稿では，3 パーティの秘密分散による semi-honest 安全な秘密計算基数ソートについて，サブプロトコルの計数ソートを既存手法の組み合わせにより効率化し，オンライン通信量の削減による高速化を行う．また，semi-honest モデルでの安全性の証明についての考察を行う．今回仮定するモデル下での安全性の十分条件を導入し，出力がシェアであるプロトコルの安全性の証明を簡潔化する方針を説明する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In secure computation, sorting protocol is necessary for many kinds of data analyses, and its acceleration is an important task. In this draft, by introducing an efficient counting sort protocol, we propose an oblivious radix sort with less online communication. This protocol is computed by 3-party and secure against semi-honest adversary. Moreover, we consider a method to prove security of some kinds of protocols in multi-party computation. We introduce sufficient conditions for security in some specific model and simplify the proof of protocols which output shares.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-03-07","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7","bibliographicVolumeNumber":"2022-AL-187"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":217355,"links":{}}