{"updated":"2025-01-22T10:23:45.058187+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00044608","sets":["1164:3925:3936:3938"]},"path":["3938"],"owner":"1","recid":"44608","title":["より強力な不正者に対する効率的なブラックボックス追跡のための階層的な鍵割り当て"],"pubdate":{"attribute_name":"公開日","attribute_value":"2006-07-21"},"_buckets":{"deposit":"bfdeef0f-38f1-487f-b321-6eaef917eb69"},"_deposit":{"id":"44608","pid":{"type":"depid","value":"44608","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"より強力な不正者に対する効率的なブラックボックス追跡のための階層的な鍵割り当て","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"より強力な不正者に対する効率的なブラックボックス追跡のための階層的な鍵割り当て"},{"subitem_title":"Hierarchical Key Assignment for Efficient Public-Key Black-Box Tracing against Self-Defensive Pirates","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2006-07-21","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":"Corporate Research k Development Center, Toshiba Corporation","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Science and Engineering, Chuo University/Research Center for information Security, National Institute of Advanced Industrial Science and Technology","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/44608/files/IPSJ-CSEC06034044.pdf"},"date":[{"dateType":"Available","dateValue":"2008-07-21"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-CSEC06034044.pdf","filesize":[{"value":"796.2 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":"44"}],"accessrole":"open_date","version_id":"d28a2199-1712-4463-94e5-5789f06b1488","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2006 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"松下, 達之"},{"creatorName":"今井, 秀樹"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tatsuyuki, MATSUSHITA","creatorNameLang":"en"},{"creatorName":"Hideki, IMAI","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11235941","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":"公開鍵ベースのブラックボックス追跡方式[9]における送信オーバヘッドを改善する階層的な鍵割り当て方法を提案する．提案する鍵割り当て方法をこの従来方式に適用すると，従来方式単独の場合よりも，送信オーバヘッドと各受信者の所要メモリ量とのバランスが取れたブラックボックス追跡方法を構成できる．より具体的には，秘密鍵サイズが大きく増加することなく，暗号文サイズをO(√ｎ)からO(ｋ+log(ｎ/ｋ))へ削減できる．ここで，ｋとｎはそれぞれ最大結託人数，全受信者数を表す．提案する鍵割り当て方法を適用した結果得られる方式は，従来方式と同様に，追跡を検知した場合に追跡を逃れる，より巧妙に作成された不正復号器に対しても（秘密情報不要で）ブラックボックス追跡可能である．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a hierarchical key-assignment method by which the transmission overhead in a public-key black-box tracing scheme presented in [9] can be improved. The previous scheme with our hierarchical key-assignment yields a better balance between the transmission overhead and each receiver's storage than the original one alone. More concretely, the ciphertext size can be reduced from O(√n) to O(k+log(n/k)) without a substantial increase in the secret-key size, where k and n denote the maximum number of colluders in a coalition and the total number of receivers respectively. The resulting scheme, as well as the previous one, is black-box traceable (without any secret information) against a self-defensive pirate decoder that escapes from tracing if it detects itself being examined.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"328","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告コンピュータセキュリティ（CSEC）"}],"bibliographicPageStart":"321","bibliographicIssueDates":{"bibliographicIssueDate":"2006-07-21","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"81(2006-CSEC-034)","bibliographicVolumeNumber":"2006"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:10:44.661296+00:00","id":44608,"links":{}}