Policy Aware Social Miner

Sharon Paradesi, O. Seneviratne, Lalana Kagal
{"title":"Policy Aware Social Miner","authors":"Sharon Paradesi, O. Seneviratne, Lalana Kagal","doi":"10.1109/SPW.2012.28","DOIUrl":null,"url":null,"abstract":"There is a wealth of sensitive information available on the Web about any individual that is generated either by her or by others on social networking sites. This information could be used to make important decisions about that individual. The problem is that although people know that searches for their personal information are possible, they have no way to either control the data that is put on the Web by others or indicate how they would like to restrict usage of their own data. We describe a framework called Policy Aware Social Miner (PASM) that would provide a solution to these problems by giving users a way to semantically annotate data on the Web using policies to guide how searches about them should be executed. PASM accepts search queries and applies the user's policies on the results. It filters results over data the user owns and provides the user's refutation link on search results that the user does not own. These usage control mechanisms for privacy allow users to break away from siloed data privacy management and have their privacy settings applied to all their data available on the Web.","PeriodicalId":201519,"journal":{"name":"2012 IEEE Symposium on Security and Privacy Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Symposium on Security and Privacy Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPW.2012.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

There is a wealth of sensitive information available on the Web about any individual that is generated either by her or by others on social networking sites. This information could be used to make important decisions about that individual. The problem is that although people know that searches for their personal information are possible, they have no way to either control the data that is put on the Web by others or indicate how they would like to restrict usage of their own data. We describe a framework called Policy Aware Social Miner (PASM) that would provide a solution to these problems by giving users a way to semantically annotate data on the Web using policies to guide how searches about them should be executed. PASM accepts search queries and applies the user's policies on the results. It filters results over data the user owns and provides the user's refutation link on search results that the user does not own. These usage control mechanisms for privacy allow users to break away from siloed data privacy management and have their privacy settings applied to all their data available on the Web.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有政策意识的社会矿工
网络上有大量关于个人的敏感信息,这些信息要么是由个人产生的,要么是由社交网站上的其他人产生的。这些信息可以用来做出关于那个人的重要决定。问题是,尽管人们知道搜索他们的个人信息是可能的,但他们既没有办法控制其他人放到网络上的数据,也没有办法表明他们希望如何限制自己数据的使用。我们描述了一个名为策略感知社会挖掘器(Policy Aware Social Miner, PASM)的框架,该框架将为这些问题提供解决方案,它为用户提供了一种对Web上的数据进行语义注释的方法,使用策略来指导如何执行对它们的搜索。PASM接受搜索查询,并对结果应用用户的策略。它过滤用户拥有的数据的结果,并在用户不拥有的搜索结果上提供用户的反驳链接。这些隐私使用控制机制允许用户摆脱孤立的数据隐私管理,并将其隐私设置应用于Web上可用的所有数据。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Insider Threats against Trust Mechanism with Watchdog and Defending Approaches in Wireless Sensor Networks Using Consensus Clustering for Multi-view Anomaly Detection Side-Channel Analysis of Grøstl and Skein Fog Computing: Mitigating Insider Data Theft Attacks in the Cloud Slender PUF Protocol: A Lightweight, Robust, and Secure Authentication by Substring Matching
×
引用
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