Secure Communication in Multicast Graphs

被引:0
|
作者
Yang, Qiushi [1 ]
Desmedt, Yvo [1 ]
机构
[1] UCL, Dept Comp Sci, London WC1E 6BT, England
来源
关键词
secure communication; reliable communication; multicast; privacy; reliability; adversary structure; MINIMAL CONNECTIVITY MODELS; MESSAGE TRANSMISSION; ADVERSARY STRUCTURES; COMPUTATION; FEEDBACK;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this paper we solve the problem of secure communication in multicast graphs, which has been open for over a decade. At Eurocrypt '98, Franklin and Wright initiated the study of secure communication against a Byzantine adversary on multicast channels in a neighbor network setting. Their model requires node-disjoint and neighbor-disjoint paths between a sender and a receiver. This requirement is too strong and hence not necessary in the general multicast graph setting. The research to find the lower and upper bounds on network connectivity for secure communication in multicast graphs has been carried out ever since. However, up until this day, there is no tight bound found for any level of security. We study this problem from a new direction, i.e., we find the necessary and sufficient conditions (tight lower and upper bounds) for secure communication in the general adversary model with adversary structures, and then apply the results to the threshold model. Our solution uses an extended characterization of the multicast graphs, which is based on our observation on the eavesdropping and separating activities of the Byzantine adversary.
引用
收藏
页码:538 / 555
页数:18
相关论文
共 50 条
  • [1] Multicast Cryptosystem: A Cryptosystem For Secure Multicast Communication
    Prakash, A. John
    Uthariaraj, V. Rhymend
    [J]. 2008 IFIP INTERNATIONAL CONFERENCE ON NETWORK AND PARALLEL COMPUTING, PROCEEDINGS, 2008, : 119 - 124
  • [2] Secure reverse communication in a multicast tree
    Domingo-Ferrer, J
    Martínez-Ballesté, A
    Sebé, F
    [J]. NETWORKING 2004: NETWORKING TECHNOLOGIES, SERVICES, AND PROTOCOLS; PERFORMANCE OF COMPUTER AND COMMUNICATION NETWORKS; MOBILE AND WIRELESS COMMUNICATIONS, 2004, 3042 : 807 - 816
  • [3] A Secure Key Distribution Protocol for Multicast Communication
    Vijayakumar, P.
    Bose, S.
    Kannan, A.
    Subramanian, S. Siva
    [J]. CONTROL, COMPUTATION AND INFORMATION SYSTEMS, 2011, 140 : 249 - +
  • [4] MESP: A modified IPSec for secure multicast communication
    Ali, Eman
    El-fouly, Tarek
    Badr, Ahmed
    [J]. 2006 6TH INTERNATIONAL CONFERENCE ON ITS TELECOMMUNICATIONS PROCEEDINGS, 2006, : 812 - +
  • [5] Key Management for Secure Multicast Communication: A Survey
    Baddi, Youssef
    Ech-Cherif El Kettani, Mohamed Dafir
    [J]. 2013 NATIONAL SECURITY DAYS (JNS3), 2013,
  • [6] An Efficient Rekeying Approach for Secure Multicast Communication
    Wei, Gao-Jun
    Liang, Hu-Dong
    Ming, Wang-Yu
    Kai, Yang-Zhong
    [J]. 2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15, 2007, : 1949 - +
  • [7] Computation and Communication Efficient Key Distribution Protocol for Secure Multicast Communication
    Vijayakumar, P.
    Bose, S.
    Kannan, A.
    Deborah, L. Jegatha
    [J]. KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2013, 7 (04): : 878 - 894
  • [8] Multicrypt: A Provably Secure Encryption Scheme for Multicast Communication
    Prakash, A. John
    Uthariaraj, V. Rhymend
    [J]. 2009 FIRST INTERNATIONAL CONFERENCE ON NETWORKS & COMMUNICATIONS (NETCOM 2009), 2009, : 246 - 253
  • [9] Towards Scalable Key Management for Secure Multicast Communication
    Tseng, Yuh-Min
    Yu, Chen-Hung
    Wu, Tsu-Yang
    [J]. INFORMATION TECHNOLOGY AND CONTROL, 2012, 41 (02): : 173 - 182
  • [10] Scalable secure group communication over IP multicast
    Banerjee, S
    Bhattacharjee, B
    [J]. NETWORK PROTOCOLS, 2001, : 261 - 269