Improved LKH for batch rekeying in multicast groups

Pegueroles, Josep; Rico-Novella, Francisco; Hernández-Serrano, Juan; Soriano, Miguel

doi:10.1109/itre.2003.1270619

Cited by 13 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the proposed method of cryptanalysis can balance time complexity |T | < 2 B /M and requirement on exposure probability P (SUCC) by choosing an appropriate M . By considering a case study of h = 20 thus N being around one million (which is a reasonable assumption for practical large-scale multicast applications), we have constructed very interesting magic numbers concerning [8] [9] and got some satisfactory T -P (SUCC) results to support the above tradeoff theory, i.e., both values being fairly acceptable. Due to limit of space, numerical analysis is not included in this article.…”

Section: B Weakness In the Remainder Approach -Variantmentioning

confidence: 95%

“…In [8] [9], Pegueroles et al proposed a hierarchical multicast key management scheme based on an updatable binary key tree. The scheme employs a generalized rekey message as:…”

Section: B Weakness In the Remainder Approach -Variantmentioning

confidence: 99%

“…This lies in that the collision M | h i=0 R i tends to be less likely to occur than that of M | N i=1 f i , due to the number of large random multipliers involved (h + 1 compared with N ). However, we note that the outsider attack presented in Section II-A is still applicable to [8] [9] considering large multicast groups with a not too small h. This is owing to the scenario's t-M tradeoff (actually, T -P (SUCC) tradeoff) feature lying in a relationship similar to (7), herein cs =cs + tM .…”

Section: B Weakness In the Remainder Approach -Variantmentioning

confidence: 99%

See 2 more Smart Citations

General Weakness in Certain Broadcast Encryption Protocols Employing the Remainder Approach

Zhu¹

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

We address the problem of distributing a grouporiented secret from a centralized key server to a number of privileged recipients, known as broadcast encryption. In a set of existent schemes, this common shared secret is distributed as an arithmetic remainder embedded in a broadcast keying message, such that upon receiving the message, a legitimate recipient only needs to perform one modular operation upon the keying information to derive the secret. In this article, however, we point out a generic weakness in these protocols and demonstrate efficient methods for cryptanalysis. The presented approaches follow a collision attack paradigm and can work in a manner that even a completely passive outsider may somehow acquire the secret. Numerical analysis shows that in practical scenarios, our technique can compromise the common shared secret with a significant probability, implying that these broadcast encryption schemes are highly vulnerable.Index Terms-Data and communication security, broadcast encryption, common secret, remainder, collision, passive outsider attack, magic number. I. INTRODUCTIONThe broadcast encryption (BE) problem [1] [2] involves distributing a common shared secret, typically in the form of a short-term group key, from a centralized key server (KS) to a large number of intended receivers forming a possibly dynamic subscriber group, such that at any give time instance only the privileged group members are able to actually utilize certain application data that are publicly available, e.g., from a broadcast communication channel.In a large number of BE applications ranging from DVD encryption [1]-[3] to multicast access control [4]-[9] and teleconference [10] [11], the application data are protected by a symmetric cipher with the (short-term) group key; only legitimate users hold confidential information to first derive the common secret and then decrypt the data:• In BE solutions, cost-efficient manipulations like arithmetic operations, one-way (hash) functions, and symmetric encryptions / decryptions are preferred in distributing the common secret itself [1]. As an approach for content protection, broadcast encryption is envisioned to promise more flexible and resilient security compared with traditional public-key cryptography techniques [2]. • Moreover, in many cases the receivers are assumed to be stateless [3], i.e., they hold certain static cryptographic information like a pairwise key shared with the KS, and they do not update their rekey states from session to

show abstract

Section: B Weakness In the Remainder Approach -Variantmentioning

confidence: 95%

“…In [8] [9], Pegueroles et al proposed a hierarchical multicast key management scheme based on an updatable binary key tree. The scheme employs a generalized rekey message as:…”

Section: B Weakness In the Remainder Approach -Variantmentioning

confidence: 99%

Section: B Weakness In the Remainder Approach -Variantmentioning

confidence: 99%

See 1 more Smart Citation

General Weakness in Certain Broadcast Encryption Protocols Employing the Remainder Approach

Zhu¹

2008

2008 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…The LKH has an advantage that it can use the key of the middle node as the key of the partial group by using this logical hierarchical structure [19]. …”

Section: Logical Key Hierarchy (Lkh)mentioning

confidence: 99%

Design of IP Camera Access Control Protocol by Utilizing Hierarchical Group Key

2015

View full text Add to dashboard Cite

Unlike CCTV, security video surveillance devices, which we have generally known about, IP cameras which are connected to a network either with or without wire, provide monitoring services through a built-in web-server. Due to the fact that IP cameras can use a network such as the Internet, multiple IP cameras can be installed at a long distance and each IP camera can utilize the function of a web server individually. Even though IP cameras have this kind of advantage, it has difficulties in access control management and weakness in user certification, too. Particularly, because the market of IP cameras did not begin to be realized a long while ago, systems which are systematized from the perspective of security have not been built up yet. Additionally, it contains severe weaknesses in terms of access authority to the IP camera web server, certification of users, and certification of IP cameras which are newly installed within a network, etc. This research grouped IP cameras hierarchically to manage them systematically, and provided access control and data confidentiality between groups by utilizing group keys. In addition, IP cameras and users are certified by using PKI-based certification, and weak points of security such as confidentiality and integrity, etc., are improved by encrypting passwords. Thus, this research presents specific protocols of the entire process and proved through experiments that this method can be actually applied. OPEN ACCESSSymmetry 2015, 7 1568

show abstract

“…There are two typical methods for group key distribution: schemes based on logical key hierarchy tree (LKH) [2,10] and schemes that are one-way function tree (OFT) [11,12] based, named as top-down method and bottom-up method respectively in Ref. [12].…”

Section: Existing Workmentioning

confidence: 99%

Minimum exact cover problem of group key distribution

2009

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

Secure group communications are restrained by the number of the group size, number of changes and their distribution, all existing works do not meet the commands of applications with large group size and high dynamic members. In this paper, minimum exact cover problem for group key distribution (GMECP) is presented, and a heuristic solution is testified. Then an algorithm of batch rekeying with renewing cost tending to zero is illustrated, which can process any large number of change requests with best security guaranteed. Efficiency analysis and simulation test show that the achievement can improve the efficiency of any tree-based group key management.

show abstract

Improved LKH for batch rekeying in multicast groups

Cited by 13 publications

References 5 publications

General Weakness in Certain Broadcast Encryption Protocols Employing the Remainder Approach

General Weakness in Certain Broadcast Encryption Protocols Employing the Remainder Approach

Design of IP Camera Access Control Protocol by Utilizing Hierarchical Group Key

Minimum exact cover problem of group key distribution

Contact Info

Product

Resources

About