A collusion attack on asymmetric group key exchange. Issue 13 (14th November 2014)

• Record Type: Journal Article
• Authors: Teng, Jikai; Wu, Chuankun
• Is Part Of: Security and communication networks. Volume 8:Issue 13(2015)
• Page Start: 2189
• Page End: 2193
• Publication Date: 2014-11-14
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1163
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main" id="sec1163-abs-0001"> <title>Abstract</title> <p id="sec1163-para-0001">In Eurocrypt 2009, Wu <italic>et al.</italic> introduced the notion of asymmetric group key agreement (ASGKA) and presented a generic construction of ASGKA protocols with one communication round. Most of ASGKA protocols are designed under that generic construction. In asymmetric group key agreement protocols, users obtain different decryption keys. Any subset of group members may collude to construct pirate decryption keys, which are different from those of colluders but can correctly decrypt ciphertexts. If a pirate decryption box is found, it is possible to find traitors since their decryption keys are related to their identities. In this paper, a collusion attack on the generic construction of ASGKA by Wu <italic>et al.</italic> is proposed. It is formally proved that each of colluders participating in the proposed collusion attack is unable to be traced. The attack is additionally applied to a concrete protocol to exemplify the collusion attack. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>