An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
k-anonymous secret handshakes with reusable credentials
Proceedings of the 11th ACM conference on Computer and communications security
A Private, Secure, and User-Centric Information Exposure Model for Service Discovery Protocols
IEEE Transactions on Mobile Computing
Mobile Networks and Applications - Special issue: Wireless mobile wireless applications and services on WLAN hotspots
Controlled privacy preserving keyword search
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Hi-index | 0.00 |
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 method of membership verification to resolve this issue and analyze its performance. Using this method, we propose a privacy-preserving 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.