摘要
In secure multicast, one of the challenging problems is the authentication of multicast packets. This paper presents a novel scheme to address this problem, which combines ideas in both the hash tree schemes and the hash chain schemes. In this scheme, a group of packets is partitioned into equal-sized subgroups. 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. Its performance is analyzed and simulated using Biased Coin Toss loss model and 2-state Markov Chain loss model, respectively. Compared with the original hash chain schemes, results show that this scheme is much more efficient in term of communication overhead.
In secure multicast, one of the challenging problems is the authentication of multicast packets. This paper presents a novel scheme to address this problem, which combines ideas in both the hash tree schemes and the hash chain schemes. In this scheme, a group of packets is partitioned into equal-sized subgroups. 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. Its performance is analyzed and simulated using Biased Coin Toss loss model and 2-state Markov Chain loss model, respectively. Compared with the original hash chain schemes, results show that this scheme is much more efficient in term of communication overhead.
基金
Supported by the Natural Science Foundation of China (No. 60173066)
