Analysis of a Key Distribution Scheme in Secure Multicasting

TL;DR

This paper analyzes a secure key distribution scheme in multicast systems, revealing vulnerabilities through two attacks that compromise system security depending on parameter choices, thus highlighting the importance of careful parameter selection.

Contribution

It provides the first detailed analysis of the scheme's security, introducing two effective attacks and emphasizing the impact of parameter choices on system vulnerability.

Findings

A time-memory tradeoff attack can break over one-third of parameter configurations.

The attack complexity is comparable to the best known attack by Wu et al.

The scheme is vulnerable under certain parameter choices, making it feasible to compromise.

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.