Online Certification Status Verification with a Red-Black Hash Tree

• Item type: Journal(1)
• 公開日: 2006-08-15
• タイトル: Online Certification Status Verification with a Red-Black Hash Tree
• タイトル / 言語: en
• タイトル: Online Certification Status Verification with a Red-Black Hash Tree
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: 特集：ユビキタス社会を支えるコンピュータセキュリティ技術
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Department of Information Media Technology, School of Information Technology and Electronics, Tokai University
• 著者所属: Panasonic Mobile Communication Co. Ltd.
• 著者所属: Department of Information Science, School of InformationTechnology and Electronics, Tokai University
• 著者所属(英): en
• 著者所属(英): Department of Information Media Technology, School of Information Technology and Electronics, Tokai University
• 著者所属(英): en
• 著者所属(英): Panasonic Mobile Communication Co. Ltd.
• 著者所属(英): en
• 著者所属(英): Department of Information Science, School of InformationTechnology and Electronics, Tokai University
• 著者名: Hiroaki, Kikuchi; Kensuke, Abe; Shohachiro, Nakanishi
• 著者名(英): Hiroaki, Kikuchi; Kensuke, Abe; Shohachiro, Nakanishi
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Certificate revocation is a critical issue for a practical, public-key infrastructure. A new efficient revocation protocol using a one-way hash tree structure (instead of the classical list structure, which is known as a standard for revocation) was proposed and examined to reduce communication and computation costs. A tree approach, however, may run in O(n) time, in the worst case, i.e., when all the entries are sorted in descending order. A red-black tree is a binary sorted tree, with one extra bit per node, which is used for balancing the tree and guarantees that search and insertion operations take O(log n), even in the worst case. In this paper, we propose a binary red-black hash tree for certificate revocation and prove that it reduces costs more than any other tree balancing approache. We also compare the estimated communication and computation cost reductions of the red-black hash tree to those of the conventional binary search tree.
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Certificate revocation is a critical issue for a practical, public-key infrastructure. A new efficient revocation protocol using a one-way hash tree structure (instead of the classical list structure, which is known as a standard for revocation) was proposed and examined to reduce communication and computation costs. A tree approach, however, may run in O(n) time, in the worst case, i.e., when all the entries are sorted in descending order. A red-black tree is a binary sorted tree, with one extra bit per node, which is used for balancing the tree and guarantees that search and insertion operations take O(log n), even in the worst case. In this paper, we propose a binary red-black hash tree for certificate revocation and prove that it reduces costs more than any other tree balancing approache. We also compare the estimated communication and computation cost reductions of the red-black hash tree to those of the conventional binary search tree.
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AN00116647
• 書誌情報: 情報処理学会論文誌; 巻 47, 号 8, p. 2477-2487, 発行日 2006-08-15
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7764