A trust-based secure service discovery (TSSD) model for pervasive computing

被引:17
作者
Ahamed, Sheikh I. [1 ]
Sharmin, Moushumi [2 ]
机构
[1] Marquette Univ, Milwaukee, WI 53233 USA
[2] Univ Illinois, Urbana, IL 61801 USA
关键词
MARKS; Secure service discovery; Pervasive computing;
D O I
10.1016/j.comcom.2008.07.014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
To cope with the challenges posed by device capacity and capability, and also the nature of ad hoc networks, a Service discovery model is needed that can resolve security and privacy issues with simple solutions. The use of complex algorithms and powerful fixed infrastructure is infeasible due to the volatile nature of pervasive environment and tiny pervasive devices. In this paper, we present a trust-based secure Service discovery model, TSSD (trust-based secure service discovery) for a truly pervasive environment. Our model is a hybrid one that allows both secure and non-secure discovery of services. This model allows Service discovery and sharing based oil mutual trust. The security model handles the communication and service sharing security issues. TSSD also incorporates a trust mode for sharing Services with unknown devices. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:4281 / 4293
页数:13
相关论文
共 54 条
[1]  
Ahmed S, 2005, PSC '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON PERVASIVE SYSTEMS AND COMPUTING, P206
[2]  
Ahmed S, 2005, P INT COMP SOFTW APP, P17
[3]  
AHMED S, 2007, INT J NETWORK SECURI, V4, P271
[4]   Developing a model for trust management in pervasive devices [J].
Almenárez, F ;
Marín, A ;
Díaz, D ;
Sanchéz, J .
FOURTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS, 2006, :267-+
[5]  
ALMENAREZ F, 2004, PTM PERVASIVE TRUST
[6]  
Almenarez F., 2003, 9 OP EUR SUMM SCH IF
[7]  
[Anonymous], 1997, 2104 RFC IETF
[8]  
[Anonymous], SPEC BLUET SYST COR
[9]  
[Anonymous], POLITICS KNOWLEDGE A
[10]  
Balazinska M., 2002, Pervasive Computing. First International Conference, Pervasive 2002. Proceedings (Lecture Notes in Computer Science Vol.2414), P195