Secure group communication with distributed generation of private keys for ad-hoc networks

被引:0
作者
Sundaram, S [1 ]
Bertok, P [1 ]
Burton, B [1 ]
机构
[1] RMIT Univ, Sch Math & Geospatial Sci, Melbourne, Vic, Australia
来源
SECURITY AND PRIVACY IN THE AGE OF UBIQUITOUS COMPUTING | 2005年 / 181卷
关键词
key-insulated; ad hoc networks; key generation; threshold cryptography;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile ad-hoc networks are emerging as important computing platforms, and their users expect the security to be comparable to fixed, infrastructural networks. With the increase of group-oriented applications, secure communication has to be provided between a group of nodes that may join and leave the network in an unplanned manner. Previous solutions have achieved limited success, for example did not provide manageable confidentiality of messages. This paper proposes a fast, scalable group encryption key model that is suitable for ad-hoc networks and is resistant against multiple compromised nodes.
引用
收藏
页码:477 / 492
页数:16
相关论文
共 13 条
  • [1] Aura T, 2002, LECT NOTES COMPUT SC, V2467, P63
  • [2] Self-organized public-key management for mobile ad hoc networks
    Capkun, S
    Buttyán, L
    Hubaux, JP
    [J]. IEEE TRANSACTIONS ON MOBILE COMPUTING, 2003, 2 (01) : 52 - 64
  • [3] DODIS Y, 2003, LECT NOTES COMPUTER, V2567
  • [4] DODIS Y, 2002, EUROCRYPT 2002, V2332
  • [5] Frankel Y, 1997, LECT NOTES COMPUT SC, V1294, P440
  • [6] Securing authentication and privacy in ad hoc partitioned networks
    Kaliaperumal, S
    [J]. 2003 SYMPOSIUM ON APPLICATIONS AND THE INTERNET WORKSHOPS, PROCEEDINGS, 2003, : 354 - 357
  • [7] Group key agreement efficient in communication
    Kim, Y
    Perrig, A
    Tsudik, G
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (07) : 905 - 921
  • [8] KONG J, 2001, IEEE 9 INT C NETW PR
  • [9] Luo H., 2000, Tech. Rep.
  • [10] Self-securing ad hoc wireless networks
    Luo, HY
    Zerfos, P
    Kong, HJ
    Lu, SW
    Zhang, LX
    [J]. ISCC 2002: SEVENTH INTERNATIONAL SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2002, : 567 - 574