Analysis of a key distribution scheme in secure multicasting
From MaRDI portal
Abstract: This article presents an analysis of the secure key broadcasting scheme proposed by Wu, Ruan, Lai and Tseng. The study of the parameters of the system is based on a connection with a special type of symmetric equations over finite fields. We present two different attacks against the system, whose efficiency depends on the choice of the parameters. In particular, a time-memory tradeoff attack is described, effective when a parameter of the scheme is chosen without care. In such a situation, more than one third of the cases can be broken with a time and space complexity in the range of the square root of the complexity of the best attack suggested by Wu et al. against their system. This leads to a feasible attack in a realistic scenario.
Recommendations
Cited in
(9)- Formal models and analysis of secure multicast in wired and wireless networks
- Cryptanalysis of a key refreshment scheme for multicast protocols by means of genetic algorithm
- scientific article; zbMATH DE number 5005947 (Why is no real title available?)
- scientific article; zbMATH DE number 5370583 (Why is no real title available?)
- scientific article; zbMATH DE number 1977207 (Why is no real title available?)
- scientific article; zbMATH DE number 2143936 (Why is no real title available?)
- Managing key multicasting through orthogonal systems
- Flaws in the application of number theory in key distribution schemes for multicast networks
- Foundations of Software Science and Computation Structures
This page was built for publication: Analysis of a key distribution scheme in secure multicasting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898388)