An Efficient and Secure Service Discovery Protocol for Ubiquitous Computing Environments

Jangseong KIM; Joonsang BAEK; Jianying ZHOU; Taeshik SHON

doi:10.1587/transinf.E95.D.117

An Efficient and Secure Service Discovery Protocol for Ubiquitous Computing Environments

Jangseong KIM, Joonsang BAEK, Jianying ZHOU, Taeshik SHON

Full Text Views

0

Share
Cite this

Summary :

Recently, numerous service discovery protocols have been introduced in the open literature. Unfortunately, many of them did not consider security issues, and for those that did, many security and privacy problems still remain. One important issue is to protect the privacy of a service provider while enabling an end-user to search an alternative service using multiple keywords. To deal with this issue, the existing protocols assumed that a directory server should be trusted or owned by each service provider. However, an adversary may compromise the directory server due to its openness property. In this paper, we suggest an efficient verification of service subscribers to resolve this issue and analyze its performance and security. Using this method, we propose an efficient and secure service discovery protocol protecting the privacy of a service provider while providing multiple keywords search to an end-user. Also, we provide performance and security analysis of our protocol.

Publication: IEICE TRANSACTIONS on Information Vol.E95-D No.1 pp.117-125

Publication Date: 2012/01/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E95.D.117

Type of Manuscript: Special Section PAPER (Special Section on Trust, Security and Privacy in Computing and Communication Systems)

Category: Security

Cite this

Copy

Jangseong KIM, Joonsang BAEK, Jianying ZHOU, Taeshik SHON, "An Efficient and Secure Service Discovery Protocol for Ubiquitous Computing Environments" in IEICE TRANSACTIONS on Information, vol. E95-D, no. 1, pp. 117-125, January 2012, doi: 10.1587/transinf.E95.D.117.
Abstract: Recently, numerous service discovery protocols have been introduced in the open literature. Unfortunately, many of them did not consider security issues, and for those that did, many security and privacy problems still remain. One important issue is to protect the privacy of a service provider while enabling an end-user to search an alternative service using multiple keywords. To deal with this issue, the existing protocols assumed that a directory server should be trusted or owned by each service provider. However, an adversary may compromise the directory server due to its openness property. In this paper, we suggest an efficient verification of service subscribers to resolve this issue and analyze its performance and security. Using this method, we propose an efficient and secure service discovery protocol protecting the privacy of a service provider while providing multiple keywords search to an end-user. Also, we provide performance and security analysis of our protocol.
URL: https://globals.ieice.org/en_transactions/information/10.1587/transinf.E95.D.117/_p

Copy

@ARTICLE{e95-d_1_117,
author={Jangseong KIM, Joonsang BAEK, Jianying ZHOU, Taeshik SHON, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient and Secure Service Discovery Protocol for Ubiquitous Computing Environments},
year={2012},
volume={E95-D},
number={1},
pages={117-125},
abstract={Recently, numerous service discovery protocols have been introduced in the open literature. Unfortunately, many of them did not consider security issues, and for those that did, many security and privacy problems still remain. One important issue is to protect the privacy of a service provider while enabling an end-user to search an alternative service using multiple keywords. To deal with this issue, the existing protocols assumed that a directory server should be trusted or owned by each service provider. However, an adversary may compromise the directory server due to its openness property. In this paper, we suggest an efficient verification of service subscribers to resolve this issue and analyze its performance and security. Using this method, we propose an efficient and secure service discovery protocol protecting the privacy of a service provider while providing multiple keywords search to an end-user. Also, we provide performance and security analysis of our protocol.},
keywords={},
doi={10.1587/transinf.E95.D.117},
ISSN={1745-1361},
month={January},}

Copy

TY - JOUR
TI - An Efficient and Secure Service Discovery Protocol for Ubiquitous Computing Environments
T2 - IEICE TRANSACTIONS on Information
SP - 117
EP - 125
AU - Jangseong KIM
AU - Joonsang BAEK
AU - Jianying ZHOU
AU - Taeshik SHON
PY - 2012
DO - 10.1587/transinf.E95.D.117
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2012
AB - Recently, numerous service discovery protocols have been introduced in the open literature. Unfortunately, many of them did not consider security issues, and for those that did, many security and privacy problems still remain. One important issue is to protect the privacy of a service provider while enabling an end-user to search an alternative service using multiple keywords. To deal with this issue, the existing protocols assumed that a directory server should be trusted or owned by each service provider. However, an adversary may compromise the directory server due to its openness property. In this paper, we suggest an efficient verification of service subscribers to resolve this issue and analyze its performance and security. Using this method, we propose an efficient and secure service discovery protocol protecting the privacy of a service provider while providing multiple keywords search to an end-user. Also, we provide performance and security analysis of our protocol.
ER -