{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00224760","sets":["1164:2836:11158:11159"]},"path":["11159"],"owner":"44499","recid":"224760","title":["ユニキャストに基づく分散システム上のビザンチン耐性を持つ安全な連合学習の設計に関する一考察"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-27"},"_buckets":{"deposit":"1bc4f061-8797-422c-b372-e0a06782fd5b"},"_deposit":{"id":"224760","pid":{"type":"depid","value":"224760","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ユニキャストに基づく分散システム上のビザンチン耐性を持つ安全な連合学習の設計に関する一考察","author_link":["593368","593370","593366","593369","593367"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ユニキャストに基づく分散システム上のビザンチン耐性を持つ安全な連合学習の設計に関する一考察"},{"subitem_title":"A study on Designing Byzantine-Resilient Secure Federated Learning on a Unicast-Based Distributed System","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"プライバシー保護","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-02-27","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","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/224760/files/IPSJ-DPS23194015.pdf","label":"IPSJ-DPS23194015.pdf"},"date":[{"dateType":"Available","dateValue":"2025-02-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS23194015.pdf","filesize":[{"value":"1.8 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":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"4f09ebdc-a5ed-4817-b608-13e43b14b444","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 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":[{}]},{"creatorNames":[{"creatorName":"小泉, 佑揮"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"武政, 淳二"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"長谷川, 亨"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","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-8906","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"連合学習のためのビザンチン耐性を持つ安全な集約 (Byzantine-resilient Secure Aggregation : BREA) はプライバシーとセキュリティーの両方の攻撃を軽減する代表的な手法である．しかし，BREA では，各ユーザが学習したモデル (差分モデルと呼ぶ) の検証情報をブロードキャストチャネルで配信するため，通信の効率が悪い．本研究の目的は，ブロードキャストチャネルが提供されないインターネットやモバイルネットワーク環境において，BREA に従って現実的なプロトコルを設計することである．はじめに，ブロードキャストチャネルがない場合に発生する脆弱性を分析し，次に，ブロードキャストチャネルがない場合でも動作するように BREA を拡張する．設計したプロトコルを通信の観点で評価する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Byzantine-resilient secure aggregation (BREA) is a seminal work to mitigate both privacy and security attacks to federated learning. Despite resiliency against the both attacks, BREA is not efficient in communication because BREA uses a broadcast channel to distribute verification information of users' local models. The goal of the paper is to design an actual protocol according to BREA in the Internet and mobile network environments, where no broadcast channel is provided. In the first step, the paper analyzes the vulnerability caused by the lack of broadcast channel, and in the second step, extends BREA so as to be run without broadcast channels. The paper analyzes the designed protocol in terms of communication.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-02-27","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"15","bibliographicVolumeNumber":"2023-DPS-194"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":224760,"updated":"2025-01-19T13:01:52.489147+00:00","links":{},"created":"2025-01-19T01:24:19.556621+00:00"}