merkle

Mobile Agent Route Protection Based on Merkle Trees and Its Extension

基于Merkle树的安全移动代理路由协议及其推广

Research on Merkle Authentication Tree Traverse and the Application in Digital Signature

Merkle可信树遍历算法及在数字签名上的应用研究

Meanwhile the increasing of traffic is reduced by using Merkle hash tree .

同时利用Merkle树进一步减少批处理方案中通信量增长的不足。

This encryption scheme will be applied to the Merkle authentication tree signature .

之后将这种加密方案应用于Merkle可信树数字签名中。

To preserve integrity , we adopt Merkle hash tree to verify the correctness of query results .

为了保护查询结果的完整性，采用Merkle哈希树对查询结果的完整性进行认证。

The first attribution of this paper is proposing a new One-time Signature scheme which is improved by Merkle Tree .

本文的第一个工作是提出使用Merkle树来改进一次签名方案。

Second , to guarantee the data privacy , an approach based on the use of encryption and Merkle hash tree techniques is proposed .

其次，为了保证数据的安全，提出了基于加密和Merkle哈希树的方法。

The author uses Merkle tree to distribute these authentication keys , and this way greatly reduces the number of authentication keys .

利用Merkle树完成认证密钥的分发，大大减少认证密钥的数量。

Then Merkle hash tree is introduced to extend the capabilities of this access control scheme so that the node storage costs are reduced .

引入Merkle哈希树，对此访问控制方式进行扩展，增加其可扩展性，并减少节点存储开销。

Today , Merkle tree structure has been widely applied to many security fields , such as certificate revocation , multicast source authentication , group key agreement and so on .

如今，Merkle可信树的树形结构已经被广泛应用到了信息安全的各个领域，比如证书撤销、源组播认证、群密钥协商等等。

Based on this protocol , using hash function , a security itinerary protection of mobile agent based on Merkle trees is proposed . Security and computational complexity are discussed in detail .

在此协议的基础上，利用hash函数，提出了一个基于Merkle树的移动agent动态安全迁移协议，并对其安全性和计算复杂度进行了详细的分析。

Then a Merkle Hash tree is built for each subgroup of packets , and the Hash value of every root is appended to preceding packets to form Hash chains .

然后为每个子组内的报文建立一棵Hash树，并将每棵Hash树的树根附加于之前的若干个报文中，从而构成了Hash链。

By inserting in the query response one Merkle hash value generated by the owner and some other hash values , a user is able to locally verify the authenticity of the query response .

通过向查询结果中插入由拥有者产生的Merkle哈希值以及一些辅助哈希值，用户能够在本地验证查询结果的可靠性。

This is the first time that Merkle authentication tree signatures and identity-based authentication mechanism is combined , it is to improve the flaws that Merkle authentication tree signature can not be authenticated .

通过将基于身份认证机制应用于Merkle可信树数字签名的方法，改进了Merkle可信树数字签名中缺乏身份认证的缺陷。

In addition , this paper improves the security of the Merkle authentication tree signature which should not resist an attacker to replay attacks . A dynamic Merkle authentication tree signature scheme is presented .

此外，本文在安全性上改进了Merkle可信树数字签名不能抵抗攻击者进行重放攻击的缺陷。

Secondly , this thesis introduces algorithms of hash chain , TESLA and Merkle tree , and proposes the authentication and security protocol of deployment , data sending and receiving in the lightweight wireless sensor networks .

其次，本论文引入了hashchain算法、TESLA算法和Merkletree算法，提出了轻量散投的无线传感器网络部署的安全认证协议、数据发送和接收的安全认证协议。

Merkle authentication tree is arose to solve authentication problem in the one time signature , Merkle authentication tree have remarkable advantages in authentication , because it can authenticate a lot of data using only one signature .

Merkle可信树正是为了解决多重一次签名中的认证问题而产生的，Merkle可信树结构具有一次签名大量认证的优点，在认证方面具有显著的优势。

One-time Signature is a type of signature scheme which is very fast based on one way function without trapdoor . Together with Merkle Tree , One-time Signature can be used to construct a solution to Multicast Source Authentication problem .

一次签名是一类基于无陷门单向函数的快速的数字签名，结合使用Merkle树来进行密钥管理，可用来构造组播源认证方案。

DMSS-Dynamic Merkle Authentication-tree Signature

DMSS-动态Merkle可信树签名方案

Besides that , the security of Merkle authentication tree signature is only dependent on the security of hash function , and it is not needed too much theories and assumptions , which makes the Merkle authentication tree signature more secure and practical .

并且基于Merkle可信树的数字签名方案在安全性上仅仅依赖于哈希函数的安全性，且不需要太多的理论假设，这使得基于Merkle可信树的数字签名更加安全、实用。

Since Shamir designed an algorithm attacking successfully the Ralph Merkle and Martin Hellman 's knapsack cryptosystem , the algorithm of the knapsack cryptosystem has been improved such that it can not be attacked by Shamir 's attacking .

自从Shamir提出攻击RalphMerkle和MartinHellman背包密码系统的算法以来，背包密码系统在算法设计上进行了改进，使其在改进后能抵挡Shamir攻击。