移动点对点网络中保护隐私的服务发现

Santhosh Muthyapu, S. Madria, M. Linderman
{"title":"移动点对点网络中保护隐私的服务发现","authors":"Santhosh Muthyapu, S. Madria, M. Linderman","doi":"10.1109/SRDS.2010.9","DOIUrl":null,"url":null,"abstract":"In mobile peer-to-peer networks, proposed service discovery protocols disregard the exposure of the participating peers’ 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’s 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.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PrEServD - Privacy Ensured Service Discovery in Mobile Peer-to-Peer Networks\",\"authors\":\"Santhosh Muthyapu, S. Madria, M. Linderman\",\"doi\":\"10.1109/SRDS.2010.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In mobile peer-to-peer networks, proposed service discovery protocols disregard the exposure of the participating peers’ 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’s 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.\",\"PeriodicalId\":219204,\"journal\":{\"name\":\"2010 29th IEEE Symposium on Reliable Distributed Systems\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 29th IEEE Symposium on Reliable Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SRDS.2010.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 29th IEEE Symposium on Reliable Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDS.2010.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在移动对等网络中,所提出的服务发现协议忽略了参与对等的隐私细节(特权信息)的暴露。在这些方法中,参与的对等体必须在服务发现过程中提供其身份,才能获得使用服务的授权。但是,在识别提供服务的对等方之前,对等方可能不愿意透露其特权信息。因此,这些对等体面临一个问题,即服务请求或服务提供对等体应该首先揭示身份。[12]中提出的协议在一定程度上解决了这一问题,仅在单跳时间同步对等体中发现服务请求者附近可用的服务。本文提出了一种基于挑战/响应思想的隐私保护模型,用于发现移动点对点网络中服务的可用性,即使移动服务请求者和服务提供者之间存在多跳距离。性能研究表明,与最近提出的其他协议相比,我们的协议以有效的通信方式保护了隐私,减少了误报。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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’ 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’s 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Optimization Based Topology Control for Wireless Ad Hoc Networks to Meet QoS Requirements An Entity-Centric Approach for Privacy and Identity Management in Cloud Computing On-Demand Recovery in Middleware Storage Systems Adaptive Routing Scheme for Emerging Wireless Ad Hoc Networks Diskless Checkpointing with Rollback-Dependency Trackability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1