Efficient implementation of lattice operations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient management of transitive relationships in large data and knowledge bases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Protocols for Key Establishment and Authentication
Protocols for Key Establishment and Authentication
Efficient Matchmaking and Directory Services
WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
PrudentExposure: A Private and User-centric Service Discovery Protocol
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
Scalable Service Discovery for MANET
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficient semantic service discovery in pervasive computing environments
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Interoperable Semantic and Syntactic Service Discovery for Ambient Computing Environments
International Journal of Ambient Computing and Intelligence
| Hi-index | 0.00 |
Service discovery is critical to the privacy of service clients and providers. Personal information can be disclosed when looking for services or deduced from historical service discovery data, and must hence be protected from illegitimate access. Privacy-aware service discovery protocols, however, must still be flexible and scalable, in particular to support the requirements of service-oriented pervasive computing. In this paper we present EVEY, a privacy-aware service discovery protocol that supports syntactic match and semantic match of service requests and advertisements. Private information related to service discovery is protected by introducing ambiguity in both service advertisements and service requests so that they can possibly represent a group of services instead of a single specific service instance. We detail the protocol and based on a prototype we present a preliminary performance evaluation.