Digital signatures for flows and multicasts
IEEE/ACM Transactions on Networking (TON)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Lower Bounds for Multicast Message Authentication
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Efficient Authentication and Signing of Multicast Streams over Lossy Channels
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Signature amortization using multiple connected chains
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
VECoS'10 Proceedings of the Fourth international conference on Verification and Evaluation of Computer and Communication Systems
| Hi-index | 0.00 |
Message authentication is considered as a serious bottleneckto multicast security, particular for stream-type oftraffic. The technique of hash chaining/signature amortizationhas been proposed in many schemes for streamauthentication, with or without multicast settings. However,none of them is optimal. They either have a largepacket overhead or are not robust to packet loss. Someeven have a large receiver delay or require a large receiverbuffer size. These schemes are constructed by trial-and-errormethods. There lack tools to evaluate and comparetheir performances. There is no systematic way to constructthese schemes either. In this paper, we introduce the notionof dependence-graphs which links these hash-chained authenticationschemes to the well-known graph theory, andprovides an effective analytical tool. Many important metricsof a hash-chained authentication scheme can be readilyand easily determined from its dependence-graph. As well,a dependence-graph demonstrates design tradeoff and providesinsights into optimizing hash-chained schemes.