PrESerD - Privacy ensured service discovery in mobile peer-to-peer environment

In mobile peer-to-peer networks many service discovery protocols have been proposed. Most of these protocols disregard the exposure of the participating peers\u27 privacy details, although they consider the security issues. In these methods, the participating peers must provide their identities, during the service discovery process, to be authorized to utilize the service. However, a peer might not be willing to reveal its identity until it identifies the service providing peer. So these peers face a problem; should the requesting peer or the service providing peer reveal the identity first, and hence, this is similar to the chicken-and-egg problem. The protocol presented in Private and Secure Service Discovery via Progressive and Probabilistic Exposure, solves this problem to some extent and works considerably to discover the services available in the user\u27s vicinity in a single-hop time sync peers only. In this paper, we propose a privacy-preserving model based on challenge/response idea to discover the services available in the mobile peer-to-peer network even when the moving user and the service provider are at a multi-hop distance away. The performance studies shows that our protocol does this in a communication efficient way with reduced false positives while preserving the privacy details of the user and service provider --Abstract, page iv

PrEServD - Privacy Ensured Service Discovery in Mobile Peer-to-peer Networks

In mobile peer-to-peer networks, proposed service discovery protocols disregard the exposure of the participating peers\u27 privacy details (privileged information). in these methods, the participating peers must provide their identities during the service discovery process to be authorized to utilize services. However, a peer may not be willing to reveal its privileged information until it identifies the service providing peer. So, these peers face a problem; should the service requesting or the service providing peer reveal the identity first. the protocol presented in [12] solves this problem to some extent and discover the services available in the service requester\u27s vicinity in a single-hop time sync peers only. in this paper, we propose a privacy-preserving model based on challenged/response idea to discover the services available in the mobile peer-to-peer network even when the moving service requester and the service provider are at a multi-hop distance away. the performance studies shows that our protocol does preserve the privacy in a communication efficient way with reduced false positives in comparison to one other recently proposed protocol. © 2010 IEEE

Private and secure service discovery via progressive and Probabilistic exposure

The involvement of only the necessary users and service providers for service discovery in pervasive computing environments is challenging. Without prudence, users' and service providers' requests or service information, their identities, and their presence information may be sacrificed. We identify that the problem may be as difficult as a chicken- and- egg problem, in which both users and service providers want the other parties to expose sensitive information first. In this paper, we propose a progressive and probabilistic approach to solve the problem. Users and service providers expose partial information in turn and avoid unnecessary exposure if there is any mismatch. Although 1 or 2 bits of information are exchanged in each message, we prove that the process converges and that the false- positive overhead decreases quickly. Experiments and hypothesis tests show that security properties hold. We implemented the approach and the performance measurements show that the approach runs efficiently on PDAs

Private and Secure Service Discovery via Progressive and Probabilistic Exposure

Abstract—The involvement of only the necessary users and service providers for service discovery in pervasive computing environments is challenging. Without prudence, users ’ and service providers ’ requests or service information, their identities, and their presence information may be sacrificed. We identify that the problem may be as difficult as a chicken-and-egg problem, in which both users and service providers want the other parties to expose sensitive information first. In this paper, we propose a progressive and probabilistic approach to solve the problem. Users and service providers expose partial information in turn and avoid unnecessary exposure if there is any mismatch. Although 1 or 2 bits of information are exchanged in each message, we prove that the process converges and that the false-positive overhead decreases quickly. Experiments and hypothesis tests show that security properties hold. We implemented the approach and the performance measurements show that the approach runs efficiently on PDAs. Index Terms—Authentication, pervasive computing, privacy, probabilistic, security.