在起始的关键产生过程的效率的缺乏是有很多可能的签名的 Merkle 树签名计划的一个严肃的缺点。基于二种 Merkle 树,一个新树类型签名计划被构造,并且它是 provablyexistentially,在适应选择消息下面的 unforgeable 攻击。由分散在签名过程以内的原来的计划的起始的关键产生过程,有 6.87 X 10 ~(10 ) 的一棵大 Merkle 树可能的签名能在 590 毫秒被初始化。在硬盘和存储器存储一些小 Merkletrees 能加快 Merkle 树签名计划。Mekle 树签名计划为在大多数情形计算站台信任是合适的。
Lack of efficiency in the initial key generation process is a serious shortcoming of Merkle tree signature scheme with a large number of possible signatures. Based on two kinds of Merkle trees, a new tree type signature scheme is constructed, and it is provably existentially unforgeable under adaptive chosen message attack. By decentralizing the initial key generation process of the original scheme within the signature process, a large Merkle tree with 6.87×10^10 possible signatures can be initialized in 590 milliseconds. Storing some small Merkle trees in hard disk and memory can speed up Merkle tree signature scheme. Mekle tree signature schemes are fit for trusted computing platform in most scenarios.