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 h...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.展开更多
A human's e-life needs multiple offline and online accounts. It is a balance between usability and security to set keys or passwords for these multiple accounts. Password reuse has to be avoided due to the domino ...A human's e-life needs multiple offline and online accounts. It is a balance between usability and security to set keys or passwords for these multiple accounts. Password reuse has to be avoided due to the domino effect of malicious administrators and crackers. However,human memorability constrains the number of keys. Single sign-on server,key hashing,key strengthening and petname system are used in the prior arts to use only one key for multiple online accounts. The unique site keys are derived from the common master secret and specific domain name. These methods cannot be applied to offline accounts such as file encryption. We invent a new method and system applicable to offline and online accounts. It does not depend on HTTP server and domain name,but numeric 4-digit passcode,key hashing,key strengthening and hash truncation. Domain name is only needed to resist spoofing and phishing attacks of online accounts.展开更多
基金Supported by the Natural Science Foundation of China (No. 60173066)
文摘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.
文摘A human's e-life needs multiple offline and online accounts. It is a balance between usability and security to set keys or passwords for these multiple accounts. Password reuse has to be avoided due to the domino effect of malicious administrators and crackers. However,human memorability constrains the number of keys. Single sign-on server,key hashing,key strengthening and petname system are used in the prior arts to use only one key for multiple online accounts. The unique site keys are derived from the common master secret and specific domain name. These methods cannot be applied to offline accounts such as file encryption. We invent a new method and system applicable to offline and online accounts. It does not depend on HTTP server and domain name,but numeric 4-digit passcode,key hashing,key strengthening and hash truncation. Domain name is only needed to resist spoofing and phishing attacks of online accounts.
