在普适计算中协调隐私和安全:匿名组成员的案例

I. Wakeman, Dan Chalmers, M. Fry
{"title":"在普适计算中协调隐私和安全:匿名组成员的案例","authors":"I. Wakeman, Dan Chalmers, M. Fry","doi":"10.1145/1376866.1376868","DOIUrl":null,"url":null,"abstract":"In this paper, we outline an approach to the identification of entities for access control that is based on the membership of groups, rather than individuals. By using group membership as a level of indirection between the individual and the system, we can increase privacy and provide incentives for better behaviour. Privacy comes from the use of pseudonyms generated within the group and which can be authenticated as belonging to the group. The incentives for better behaviour come from the continuous nature of groups - members may come and go, but the group lives on, and groups are organised so as to ensure group-longevity, and prevent actions which may harm the group's reputation. We present a novel pseudonym generation mechanism suitable for use in groups without a centralised administration. Finally, we argue that the use of group membership as the basis for formulating policies on interaction is more efficient for disconnected operation, facilitating proxies and the efficient storage of revoked membership and distrusted organisations within bloom filters for small memory footprints.","PeriodicalId":364168,"journal":{"name":"workshop on Middleware for Pervasive and Ad-hoc Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Reconciling privacy and security in pervasive computing: the case for pseudonymous group membership\",\"authors\":\"I. Wakeman, Dan Chalmers, M. Fry\",\"doi\":\"10.1145/1376866.1376868\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we outline an approach to the identification of entities for access control that is based on the membership of groups, rather than individuals. By using group membership as a level of indirection between the individual and the system, we can increase privacy and provide incentives for better behaviour. Privacy comes from the use of pseudonyms generated within the group and which can be authenticated as belonging to the group. The incentives for better behaviour come from the continuous nature of groups - members may come and go, but the group lives on, and groups are organised so as to ensure group-longevity, and prevent actions which may harm the group's reputation. We present a novel pseudonym generation mechanism suitable for use in groups without a centralised administration. Finally, we argue that the use of group membership as the basis for formulating policies on interaction is more efficient for disconnected operation, facilitating proxies and the efficient storage of revoked membership and distrusted organisations within bloom filters for small memory footprints.\",\"PeriodicalId\":364168,\"journal\":{\"name\":\"workshop on Middleware for Pervasive and Ad-hoc Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"workshop on Middleware for Pervasive and Ad-hoc Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1376866.1376868\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"workshop on Middleware for Pervasive and Ad-hoc Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1376866.1376868","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

在本文中,我们概述了一种识别访问控制实体的方法,该方法基于组的成员关系,而不是基于个人。通过使用群体成员作为个人和系统之间的间接层次,我们可以增加隐私并为更好的行为提供激励。隐私来自于使用组内生成的假名,这些假名可以被验证为属于该组。对更好行为的激励来自于群体的连续性——成员可能来来去去,但群体永存,而群体的组织是为了确保群体的长寿,并防止可能损害群体声誉的行为。我们提出了一种新的假名生成机制,适合在没有集中管理的群体中使用。最后,我们认为,使用组成员身份作为制定交互策略的基础,对于断开连接的操作、促进代理以及在布隆过滤器中有效存储被撤销的成员身份和不可信的组织更有效,用于小内存占用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reconciling privacy and security in pervasive computing: the case for pseudonymous group membership
In this paper, we outline an approach to the identification of entities for access control that is based on the membership of groups, rather than individuals. By using group membership as a level of indirection between the individual and the system, we can increase privacy and provide incentives for better behaviour. Privacy comes from the use of pseudonyms generated within the group and which can be authenticated as belonging to the group. The incentives for better behaviour come from the continuous nature of groups - members may come and go, but the group lives on, and groups are organised so as to ensure group-longevity, and prevent actions which may harm the group's reputation. We present a novel pseudonym generation mechanism suitable for use in groups without a centralised administration. Finally, we argue that the use of group membership as the basis for formulating policies on interaction is more efficient for disconnected operation, facilitating proxies and the efficient storage of revoked membership and distrusted organisations within bloom filters for small memory footprints.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信