{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214416","sets":["6164:6165:6462:10749"]},"path":["10749"],"owner":"44499","recid":"214416","title":["マルチパーティ計算上のPerfectly Secure Oblivious Priority Queueの改良"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-10-19"},"_buckets":{"deposit":"d092342f-1ee4-40d9-92fc-68362dabf6ee"},"_deposit":{"id":"214416","pid":{"type":"depid","value":"214416","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"マルチパーティ計算上のPerfectly Secure Oblivious Priority Queueの改良","author_link":["550409","550410"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"マルチパーティ計算上のPerfectly Secure Oblivious Priority Queueの改良"},{"subitem_title":"Improvement for Perfectly Secure Oblivious Priority Queues Based on Multiparty Computation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"マルチパーティ計算，秘匿データ構造，優先度付きキュー","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2021-10-19","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"NTT社会情報研究所"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"NTT Social Informatics Laboratories","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/214416/files/IPSJCSS2021017.pdf","label":"IPSJCSS2021017.pdf"},"date":[{"dateType":"Available","dateValue":"2023-10-19"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJCSS2021017.pdf","filesize":[{"value":"907.6 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":"d36636cd-aef1-40c1-b6f2-bbf8c2c7a6c5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 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":"Atsunori, Ichikawa","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":"秘匿データ構造 (Oblivious Data Structures, ODS) は，データやそのアクセスパターンを秘匿したまま操作が可能なデータ構造であり，秘密のデータの「状態」に依存した秘密計算にも応用できる有用な技術である．その ODS の中でも最もポピュラーなのが，データを秘匿して優先度付きキューを実現する Oblivious Priority Queue (OPQ) であり，今日に至るまで様々な手法が提案されている．しかしながら，初めに提案された OPQ 以来，いずれの後続研究も機能の追加や効率改善といった様々な改良が為されているものの統計的安全性を満たすのみであり，最初の OPQ と同等の安全性，すなわち perfect security を達成している方式は提案されていなかった．これに対し本稿では，最初の OPQ と同じ効率と perfect security を達成しつつ，後続研究で実現されたキュー操作機能の追加と操作内容の秘匿を実現する新規の OPQ を提案する．","subitem_description_type":"Other"}]},"item_18_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Oblivious Data Structures are data structures that can be manipulated while keeping the data and its access patterns secret, and are useful techniques that can be applied to secure computations that depend on the state of the secret data. Oblivious Priority Queue (OPQ) is one of the most popular ODS, which realizes a priority queue with secret data. However, since the first OPQ, all subsequent studies have only satisfied the statistical security, although various improvements such as additional functions and efficiency improvements have been made. In this paper, we propose a new OPQ that achieves the same efficiency and perfect security as the first OPQ, but adds the queue manipulation functions and confidentiality of the operations realized in the subsequent work.","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"126","bibliographic_titles":[{"bibliographic_title":"コンピュータセキュリティシンポジウム2021論文集"}],"bibliographicPageStart":"120","bibliographicIssueDates":{"bibliographicIssueDate":"2021-10-19","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214416,"updated":"2025-01-19T16:38:29.938711+00:00","links":{},"created":"2025-01-19T01:15:14.017712+00:00"}