"In mobile peer-to-peer networks many service discovery protocols have been proposed. Most of these protocols disregard the exposure of the participating peers' 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's 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.
Madria, Sanjay Kumar
Cheng, Maggie Xiaoyan
Sarangapani, Jagannathan, 1965-
M.S. in Computer Science
Missouri University of Science and Technology. Intelligent Systems Center
Missouri University of Science and Technology
ix, 40 pages
© 2008 Santhosh Muthyapu, All rights reserved.
Thesis - Open Access
Library of Congress Subject Headings
Mobile communication systems -- Security measures
Peer-to-peer architecture (Computer networks) -- Security measures
Print OCLC #
Electronic OCLC #
Link to Catalog Recordhttp://laurel.lso.missouri.edu/record=b8531031~S5
Muthyapu, Santhosh, "PrESerD - Privacy ensured service discovery in mobile peer-to-peer environment" (2008). Masters Theses. 5132.