无法追踪的秘密凭证:信任机构与隐私

Laurent Bussard, Y. Roudier, R. Molva
{"title":"无法追踪的秘密凭证:信任机构与隐私","authors":"Laurent Bussard, Y. Roudier, R. Molva","doi":"10.1109/PERCOMW.2004.1276917","DOIUrl":null,"url":null,"abstract":"There is generally no a priori trust relationship among entities interacting in pervasive computing environments which makes it necessary to establish trust from scratch. This task becomes extremely challenging when it is simultaneously necessary to protect the privacy of the actors involved. We show how trust can be based on previous interactions yet remain unlinkable to any previous event or any specific entity. A solution based on group blind signatures is proposed that relies on credentials both secret, meaning that they contain an encrypted description of previous interactions, and untraceable, meaning that they cannot be recognized when presented to their issuer.","PeriodicalId":262138,"journal":{"name":"IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second","volume":"193 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"Untraceable secret credentials: trust establishment with privacy\",\"authors\":\"Laurent Bussard, Y. Roudier, R. Molva\",\"doi\":\"10.1109/PERCOMW.2004.1276917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There is generally no a priori trust relationship among entities interacting in pervasive computing environments which makes it necessary to establish trust from scratch. This task becomes extremely challenging when it is simultaneously necessary to protect the privacy of the actors involved. We show how trust can be based on previous interactions yet remain unlinkable to any previous event or any specific entity. A solution based on group blind signatures is proposed that relies on credentials both secret, meaning that they contain an encrypted description of previous interactions, and untraceable, meaning that they cannot be recognized when presented to their issuer.\",\"PeriodicalId\":262138,\"journal\":{\"name\":\"IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second\",\"volume\":\"193 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERCOMW.2004.1276917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2004.1276917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

摘要

在普惠计算环境中,相互作用的实体之间通常不存在先验的信任关系,因此需要从头开始建立信任。当需要同时保护相关行为者的隐私时,这项任务就变得极具挑战性。我们展示了信任是如何基于先前的交互,而与任何先前的事件或任何特定实体保持不可链接的。提出了一种基于组盲签名的解决方案,该解决方案依赖于机密凭证,这意味着它们包含先前交互的加密描述,并且不可追踪,这意味着它们在提交给其发行者时无法被识别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Untraceable secret credentials: trust establishment with privacy
There is generally no a priori trust relationship among entities interacting in pervasive computing environments which makes it necessary to establish trust from scratch. This task becomes extremely challenging when it is simultaneously necessary to protect the privacy of the actors involved. We show how trust can be based on previous interactions yet remain unlinkable to any previous event or any specific entity. A solution based on group blind signatures is proposed that relies on credentials both secret, meaning that they contain an encrypted description of previous interactions, and untraceable, meaning that they cannot be recognized when presented to their issuer.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信