Trust Negotiations with Customizable Anonymity

A. Squicciarini, Abhilasha Bhargav-Spantzel, E. Bertino, E. Ferrari, I. Ray
{"title":"Trust Negotiations with Customizable Anonymity","authors":"A. Squicciarini, Abhilasha Bhargav-Spantzel, E. Bertino, E. Ferrari, I. Ray","doi":"10.1109/WI-IATW.2006.138","DOIUrl":null,"url":null,"abstract":"Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosing digital credentials and policies. Credentials, exchanged during trust negotiations, often contain sensitive attributes that attest to the properties of the credential owner. Uncontrolled disclosure of such sensitive attributes may cause grave damage to the credential owner. Research has shown that disclosing non-sensitive attributes only can cause identity to be revealed as well. Consequently, we impose a stronger requirement: our negotiations should have the k-anonymity property the set of credentials submitted by a subject during a negotiation should be equal to k other such sets received by the counterpart during earlier negotiations. In this paper we propose a protocol that ensures k-anonymity. Our protocol has a number of important features. First, a credential submitter before submitting its set of credentials has the assurance that its set will be identical to k other sets already stored with the counterpart. Second, we provide a cryptographic protocol ensuring that the credentials submitted by the submitter during different negotiations cannot be linked to each other. Third, we ensure that the critical data exchanged during the protocol is valid. Fourth, the major part of the protocol involves the negotiating parties only; the protocol invokes the validator only when some critical information needs to be validated","PeriodicalId":358971,"journal":{"name":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IATW.2006.138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosing digital credentials and policies. Credentials, exchanged during trust negotiations, often contain sensitive attributes that attest to the properties of the credential owner. Uncontrolled disclosure of such sensitive attributes may cause grave damage to the credential owner. Research has shown that disclosing non-sensitive attributes only can cause identity to be revealed as well. Consequently, we impose a stronger requirement: our negotiations should have the k-anonymity property the set of credentials submitted by a subject during a negotiation should be equal to k other such sets received by the counterpart during earlier negotiations. In this paper we propose a protocol that ensures k-anonymity. Our protocol has a number of important features. First, a credential submitter before submitting its set of credentials has the assurance that its set will be identical to k other sets already stored with the counterpart. Second, we provide a cryptographic protocol ensuring that the credentials submitted by the submitter during different negotiations cannot be linked to each other. Third, we ensure that the critical data exchanged during the protocol is valid. Fourth, the major part of the protocol involves the negotiating parties only; the protocol invokes the validator only when some critical information needs to be validated
可自定义匿名的信任协商
信任协商首先通过请求和披露数字凭证和策略的双边迭代过程建立信任,从而使双方能够进行安全交易。在信任协商期间交换的凭证通常包含证明凭证所有者属性的敏感属性。不加控制地披露这些敏感属性可能会对凭证所有者造成严重损害。研究表明,只披露非敏感属性也会导致身份暴露。因此,我们提出了一个更强的要求:我们的协商应该具有k-匿名性——一个主体在一次协商中提交的凭据集应该等于对方在先前的协商中收到的其他k个这样的凭据集。在本文中,我们提出了一个保证k-匿名的协议。我们的协议有许多重要的特性。首先,在提交凭据集之前,凭据提交者可以保证它的凭据集与已经存储在对应物中的其他k个凭据集是相同的。其次,我们提供了一个加密协议,确保提交者在不同协商期间提交的凭据不能相互链接。第三,我们确保在协议期间交换的关键数据是有效的。第四,议定书的主要部分只涉及谈判各方;协议仅在需要验证某些关键信息时调用验证器
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信