【摘要】 在二叉排序证书吊销树的基础上,利用了树中的叶子结点的空链域,在已有的树结构中毋需增加结点,就可建立一种新的线性表结构。树中结点信息采用"自根向下"压缩方法,将整个树的信息汇集到叶结点中,可信中心签名线性表最后一个结点。在该CRT方案中,树结点发生变化后,毋需重新建立树,降低了维护代价,减少了名录服务器至查询者的通信代价。更多还原

【Abstract】 This paper surveys a new approach to constract a new linear list based on original binary sorted tree using the void chain of leaf node. The information compress from root to leaf node,and all information of tree are collected to leaf node,so CA only signature on last node of linear list.It avoids reconstructing the tree when the node of CRT is changed,reduces expense of maintaining the tree and communication from directory to inquirer.更多还原