具有最小化隐私的机密凭证选择方案

Yajun Jiang, Bo Yang, Mingwu Zhang
{"title":"具有最小化隐私的机密凭证选择方案","authors":"Yajun Jiang, Bo Yang, Mingwu Zhang","doi":"10.4156/JDCTA.VOL4.ISSUE9.25","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a classified credential selection scheme with disclosure-minimizing privacy and give protocols for realizing it in point-based management model. The client has two or more classes of credentials, and defines a quantitative privacy score for each credential, while the server defines a point value for each credential disclosed by the client and a minimum access threshold of point values to access a resource. When the server requires the client to disclose at least one credential in each class, the proposed scheme allows the server and client to jointly compute an optimal subset of credentials without revealing their private information such that the total private scores of disclosed credentials is minimal while the server’s access threshold is satisfied. We also prove the security of the protocols in our scheme in the semi-honest model.","PeriodicalId":293875,"journal":{"name":"J. Digit. Content Technol. its Appl.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Classified Credential Selection Scheme with Disclosure-minimizing Privacy\",\"authors\":\"Yajun Jiang, Bo Yang, Mingwu Zhang\",\"doi\":\"10.4156/JDCTA.VOL4.ISSUE9.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a classified credential selection scheme with disclosure-minimizing privacy and give protocols for realizing it in point-based management model. The client has two or more classes of credentials, and defines a quantitative privacy score for each credential, while the server defines a point value for each credential disclosed by the client and a minimum access threshold of point values to access a resource. When the server requires the client to disclose at least one credential in each class, the proposed scheme allows the server and client to jointly compute an optimal subset of credentials without revealing their private information such that the total private scores of disclosed credentials is minimal while the server’s access threshold is satisfied. We also prove the security of the protocols in our scheme in the semi-honest model.\",\"PeriodicalId\":293875,\"journal\":{\"name\":\"J. Digit. Content Technol. its Appl.\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Digit. Content Technol. its Appl.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4156/JDCTA.VOL4.ISSUE9.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Digit. Content Technol. its Appl.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4156/JDCTA.VOL4.ISSUE9.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种隐私最小化的机密凭证选择方案,并给出了在基于点的管理模型中实现该方案的协议。客户端有两个或多个凭证类,并为每个凭证定义一个定量的隐私评分,而服务器为客户端公开的每个凭证定义一个分值,并为访问资源定义一个分值的最小访问阈值。当服务器要求客户端在每个类中至少公开一个凭证时,该方案允许服务器和客户端共同计算凭证的最优子集,而不泄露它们的私有信息,从而在满足服务器访问阈值的情况下,公开凭证的总私有分数最小。在半诚实模型下证明了协议的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Classified Credential Selection Scheme with Disclosure-minimizing Privacy
In this paper, we propose a classified credential selection scheme with disclosure-minimizing privacy and give protocols for realizing it in point-based management model. The client has two or more classes of credentials, and defines a quantitative privacy score for each credential, while the server defines a point value for each credential disclosed by the client and a minimum access threshold of point values to access a resource. When the server requires the client to disclose at least one credential in each class, the proposed scheme allows the server and client to jointly compute an optimal subset of credentials without revealing their private information such that the total private scores of disclosed credentials is minimal while the server’s access threshold is satisfied. We also prove the security of the protocols in our scheme in the semi-honest model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信