利用同伴间的合作和兴趣混合来保护移动定向广告中的隐私

A. Fawaz, Ali Hojaij, Hadi Kobeissi, H. Artail
{"title":"利用同伴间的合作和兴趣混合来保护移动定向广告中的隐私","authors":"A. Fawaz, Ali Hojaij, Hadi Kobeissi, H. Artail","doi":"10.1109/ITST.2011.6060104","DOIUrl":null,"url":null,"abstract":"Organizations are starting to realize the significant value of advertising on mobile devices, and a number of systems have been developed to exploit this opportunity. We propose a system for delivering location and preference-aware advertisements to vehicles and to mobile devices using a novel architecture for preserving privacy. Our model assumes the main adversary is the server distributing the ads trying to identify users and track them. It also considers other peers in the network as potential threats who may disclose information to third parties. When a node wants an ad, it forms a group of nearby nodes seeking ads and willing to cooperate to achieve privacy. Peers combine their interests using a mixing mechanism using an ad-hoc network and send them through a primary peer to the ad server. In this way, preferences are masqueraded to request custom ads which are then distributed by the primary peer. Another mechanism is proposed to implement the billing process without disclosing user identities.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"159 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Using cooperation among peers and interest mixing to protect privacy in targeted mobile advertisement\",\"authors\":\"A. Fawaz, Ali Hojaij, Hadi Kobeissi, H. Artail\",\"doi\":\"10.1109/ITST.2011.6060104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Organizations are starting to realize the significant value of advertising on mobile devices, and a number of systems have been developed to exploit this opportunity. We propose a system for delivering location and preference-aware advertisements to vehicles and to mobile devices using a novel architecture for preserving privacy. Our model assumes the main adversary is the server distributing the ads trying to identify users and track them. It also considers other peers in the network as potential threats who may disclose information to third parties. When a node wants an ad, it forms a group of nearby nodes seeking ads and willing to cooperate to achieve privacy. Peers combine their interests using a mixing mechanism using an ad-hoc network and send them through a primary peer to the ad server. In this way, preferences are masqueraded to request custom ads which are then distributed by the primary peer. Another mechanism is proposed to implement the billing process without disclosing user identities.\",\"PeriodicalId\":220290,\"journal\":{\"name\":\"2011 11th International Conference on ITS Telecommunications\",\"volume\":\"159 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 11th International Conference on ITS Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITST.2011.6060104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2011.6060104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

组织开始意识到移动设备上广告的巨大价值,并开发了许多系统来利用这一机会。我们提出了一个系统,为车辆和移动设备提供位置和偏好感知广告,使用一种新颖的架构来保护隐私。我们的模型假设主要对手是分发广告的服务器,试图识别并跟踪用户。它还将网络中的其他节点视为可能向第三方泄露信息的潜在威胁。当一个节点需要广告时,它会在附近形成一组寻找广告并愿意合作以实现隐私的节点。对等体通过使用ad-hoc网络的混合机制将它们的兴趣组合在一起,并通过主对等体将它们发送到广告服务器。通过这种方式,偏好被伪装成请求自定义广告,然后由主要对等体分发。提出了另一种机制来实现计费过程而不泄露用户身份。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Using cooperation among peers and interest mixing to protect privacy in targeted mobile advertisement
Organizations are starting to realize the significant value of advertising on mobile devices, and a number of systems have been developed to exploit this opportunity. We propose a system for delivering location and preference-aware advertisements to vehicles and to mobile devices using a novel architecture for preserving privacy. Our model assumes the main adversary is the server distributing the ads trying to identify users and track them. It also considers other peers in the network as potential threats who may disclose information to third parties. When a node wants an ad, it forms a group of nearby nodes seeking ads and willing to cooperate to achieve privacy. Peers combine their interests using a mixing mechanism using an ad-hoc network and send them through a primary peer to the ad server. In this way, preferences are masqueraded to request custom ads which are then distributed by the primary peer. Another mechanism is proposed to implement the billing process without disclosing user identities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
From user wishes to system architecture safety for children going to and from school by bus An efficient destination-based data management policy for vehicular networks Joint IP networking and radio architecture for vehicular networks Navigation without GPS: Fake location for mobile phone tracking Analysis of robust collision resolution algorithm with successive interference cancellation and bursty arrivals
×
引用
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