{"id":75746,"created":"2025-01-18T23:32:46.457717+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00075746","sets":["1164:4088:6330:6499"]},"path":["6499"],"owner":"10","recid":"75746","title":["ブルームフィルタを用いた検索自由度の高い検索可能暗号の設計と実装評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-05-05"},"_buckets":{"deposit":"cd87b73a-98d8-41ef-847c-f280d1d225d7"},"_deposit":{"id":"75746","pid":{"type":"depid","value":"75746","revision_id":0},"owners":[10],"status":"published","created_by":10},"item_title":"ブルームフィルタを用いた検索自由度の高い検索可能暗号の設計と実装評価","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ブルームフィルタを用いた検索自由度の高い検索可能暗号の設計と実装評価"},{"subitem_title":"Design, Implementation and Evaluation of Symmetric Key Encription with Flexible Keyword Search by Using Bloom Filter","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2011-05-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州大学大学院システム情報科学科情報学専攻"},{"subitem_text_value":"九州大学大学院システム情報科学研究院情報学部門"},{"subitem_text_value":"九州大学大学院システム情報科学研究院情報学部門"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Informatics, Graduate School of Information Science and Electrical Engineering, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Faculty of Information Science and Electrical Engineering, Kyushu University","subitem_text_language":"en"},{"subitem_text_value":"Department of Informatics, Faculty of Information Science and Electrical Engineering, Kyushu 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/75746/files/IPSJ-IOT11013020.pdf"},"date":[{"dateType":"Available","dateValue":"2013-05-05"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IOT11013020.pdf","filesize":[{"value":"416.7 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":"43"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e4d2a3c5-8a90-4724-b744-c5bd1ca4a90b","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"菅, 孝徳"},{"creatorName":"西出, 隆志"},{"creatorName":"櫻井, 幸一"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takanori, Suga","creatorNameLang":"en"},{"creatorName":"Takashi, Nishide","creatorNameLang":"en"},{"creatorName":"Kouichi, Sakurai","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12326962","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"データの暗号化と検索を両立可能な検索可能暗号と呼ばれる暗号がある．しかし，共通鍵暗号方式の検索可能暗号において，柔軟な検索を行うためには，暗号化を行う際に考えうる全てのキーワードを列挙しなければならず，キーワードに相当する暗号文のデータ量が大きくなってしまっていた．そこで本研究では，暗号化の際に考えうる全てのキーワードを列挙することなく，指定された位置の文字が何であるかを判別する論理式を用いて柔軟なクエリを構成可能な検索可能暗号を提案する．本提案方式では，クライアントで誤りを検出可能であることから，ブルームフィルタを用いてある程度の偽陽性を認めることでデータ効率を高めている．更に，本提案方式を実装することで，現実的な時間で検索処理を行うことが出来る事を示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"There are encryption schemes which enable both encryption and search. However, in traditional symmetric key searchable encryption schemes, we must enumerate all considerable keywords in encryption. Therefore, we must have large amount of ciphertext which corresponds to keywords if we need flexible search. In this work, we propose a symmetric searchable encryption scheme which allows users to construct flexible queries. This scheme does not require enumeration of all considerable keywords and enable flexible search with boolean expression. This scheme utilizes Bloom filter to reduce a size of ciphertexts. Bloom filter has some probability of a false positive. However, it does not have any problem in practical use because a client can verify the result. We show this scheme can search in practical time.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告インターネットと運用技術（IOT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2011-05-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"20","bibliographicVolumeNumber":"2011-IOT-13"}]},"relation_version_is_last":true,"weko_creator_id":"10"},"updated":"2025-01-21T21:05:20.332499+00:00","links":{}}