Digital signatures for flows and multicasts
IEEE/ACM Transactions on Networking (TON)
A compact and fast hybrid signature scheme for multicast packet authentication
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Cryptography and Network Security: Principles and Practice
Cryptography and Network Security: Principles and Practice
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Efficient multicast stream authentication using erasure codes
ACM Transactions on Information and System Security (TISSEC)
Adopting Redundancy Techniques for Multicast Stream Authentication
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Authenticating Real Time Packet Streams and Multicasts
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
A graph-theoretical analysis of multicast authentication
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Secure Broadcast Communication in Wired and Wireless Networks
Secure Broadcast Communication in Wired and Wireless Networks
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Graph-Based Authentication of Digital Streams
SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Digital Signatures for Flows and Multicasts
Digital Signatures for Flows and Multicasts
| Hi-index | 0.00 |
Amortization schemes for authenticating streamed data have been introduced as a solution to reduce the high overhead that sign-each schemes suffer from. The hash chains structure of amortization schemes and the number of hash values appended to other packets affect the efficiency of the authentication scheme specially against packet loss. Which packets should have hashes appended to the signature packet and how many hashes to append to it have no solutions yet. This paper introduces a new hash chain construction to achieve longer resistance against packet loss and reduces the overhead. The proposed scheme consists of multiple connected chains, each chain links several packets together. Our scheme specifies clearly how to choose the packets that should have hashes appended to a signature packet, in addition to deriving their loss probability. We study the effect of the number of hashes that are appended to a signature packet on the overhead. We introduce a measure so as to know the number of packets receivers need to buffer until they can authenticate the received packets. The number of chains of our model plays a main role in the efficiency of our scheme in terms of loss resistance and overhead.