{"id":9824,"updated":"2025-01-23T03:11:09.409135+00:00","links":{},"created":"2025-01-18T22:44:56.245019+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00009824","sets":["581:599:603"]},"path":["603"],"owner":"1","recid":"9824","title":["Ancestor Excludable Hierarchical ID-based Encryption and Its Application to Broadcast Encryption"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-09-15"},"_buckets":{"deposit":"2bdb396e-afa0-43ae-bc1d-1f335baf7332"},"_deposit":{"id":"9824","pid":{"type":"depid","value":"9824","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Ancestor Excludable Hierarchical ID-based Encryption and Its Application to Broadcast Encryption","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Ancestor Excludable Hierarchical ID-based Encryption and Its Application to Broadcast Encryption"},{"subitem_title":"Ancestor Excludable Hierarchical ID-based Encryption and Its Application to Broadcast Encryption","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"特集:情報システムを支えるコンピュータセキュリティ技術の再考","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2007-09-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Japan Advanced Institute Science and Technology"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Japan Advanced Institute Science and Technology","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"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/9824/files/IPSJ-JNL4809013.pdf"},"date":[{"dateType":"Available","dateValue":"2009-09-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL4809013.pdf","filesize":[{"value":"478.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":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"eccbd84a-c242-406f-a9fa-7a9d3a6386bc","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2007 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Atsuko, Miyaji"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Atsuko, Miyaji","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"An ID-based encryption (IBE) is a public key cryptosystem in which a user’s public key is given as a user ID. In IBE only a single center generates all user secret keys which may give the center a load of burdensome work. A hierarchical ID-based encryption (HIBE) is a kind of IBE and overcomes the problem by delegating a user secret key generation to a lower-level center in which centers form a hierarchical structure. However all ancestor nodes in HIBE act as centers. That is any ancestor as well as the root can generate a secret key for any descendant node and thus a cipher text to a node can be decrypted by any ancestor node even if the ancestor does not have the same secret key as that of a target node. In this paper we propose the concept of ancestor-excludable HIBE in which ancestors with a level less than the designated one can be excluded from a set of privileged ancestors with a right to decrypt a cipher text to a target node. We also give the functional definition together with the security definition. This notion is denoted by AE-HIBE simply. We present the concrete example of AE-HIBE which can work with constant-size ciphertext and decryption time independent of the hierarchy level. We prove that our AE-HIBE is selective-ID-CPA secure in the standard model which can be converted to be selective-ID-CCA secure by applying a general conversion method. Furthermore AE-HIBE can be naturally applied to the broadcast encryption to realize the efficient public-key version with the user-key size of O(log2 N) and the transmission rate of O(r) for N users and r revoked users. The user-key size is the smallest at the transmission rate of O(r) up to the present.","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"An ID-based encryption (IBE) is a public key cryptosystem, in which a user’s public key is given as a user ID. In IBE, only a single center generates all user secret keys, which may give the center a load of burdensome work. A hierarchical ID-based encryption (HIBE) is a kind of IBE and overcomes the problem by delegating a user secret key generation to a lower-level center, in which centers form a hierarchical structure. However, all ancestor nodes in HIBE act as centers. That is, any ancestor as well as the root can generate a secret key for any descendant node and, thus, a cipher text to a node can be decrypted by any ancestor node even if the ancestor does not have the same secret key as that of a target node. In this paper, we propose the concept of ancestor-excludable HIBE, in which ancestors with a level less than the designated one can be excluded from a set of privileged ancestors with a right to decrypt a cipher text to a target node. We also give the functional definition together with the security definition. This notion is denoted by AE-HIBE simply. We present the concrete example of AE-HIBE, which can work with constant-size ciphertext and decryption time, independent of the hierarchy level. We prove that our AE-HIBE is selective-ID-CPA secure in the standard model, which can be converted to be selective-ID-CCA secure by applying a general conversion method. Furthermore, AE-HIBE can be naturally applied to the broadcast encryption to realize the efficient public-key version with the user-key size of O(log2 N) and the transmission rate of O(r) for N users and r revoked users. The user-key size is the smallest at the transmission rate of O(r), up to the present.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"3013","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"2999","bibliographicIssueDates":{"bibliographicIssueDate":"2007-09-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"48"}]},"relation_version_is_last":true,"item_2_alternative_title_2":{"attribute_name":"その他タイトル","attribute_value_mlt":[{"subitem_alternative_title":"セキュリティ基盤技術"}]},"weko_creator_id":"1"}}