Graph-based authentication of digital streams
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10816011,p. 232-246
- https://doi.org/10.1109/secpri.2001.924301
Abstract
We consider the authentication of digital streams over a lossy network. The overall approach taken is graph-based, as this yields simple methods for controlling overhead, delay, and the ability to authenticate, while serving to unify many previously known hash- and MAC-based techniques. The loss pattern of the network is defined probabilistically, allowing both bursty and random packet loss to be modeled. Our authentication schemes are customizable by the sender of the stream; that is, within reasonable constraints on the input parameters, we provide schemes that achieve the desired authentication probability while meeting the input upper bound on the overhead per packet. In addition, we demonstrate that some of the shortcomings of previously known schemes correspond to easily identifiable properties of a graph, and hence, may be more easily avoided by taking a graph-based approach to designing authentication schemes.Keywords
This publication has 14 references indexed in Scilit:
- Internet packet loss: measurement and implications for end-to-end QoSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient authentication and signing of multicast streams over lossy channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Elements of Information TheoryPublished by Wiley ,2001
- A Certified Digital SignaturePublished by Springer Nature ,2001
- End-to-end Internet packet dynamicsIEEE/ACM Transactions on Networking, 1999
- Multicast security: a taxonomy and some efficient constructionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- Practical loss-resilient codesPublished by Association for Computing Machinery (ACM) ,1997
- How to sign digital streamsPublished by Springer Nature ,1997
- Keying Hash Functions for Message AuthenticationPublished by Springer Nature ,1996
- Families of finite sets in which no set is covered by the union ofr othersIsrael Journal of Mathematics, 1985