基于双线性映射的匿名属性认证协议

Qin Yu, Feng Dengguo, Xu Zhen
{"title":"基于双线性映射的匿名属性认证协议","authors":"Qin Yu, Feng Dengguo, Xu Zhen","doi":"10.1109/CSE.2009.84","DOIUrl":null,"url":null,"abstract":"Remote attestation presented in TCG specification is one of the significant ways to establish trust between the two endpoints. There are two categories of remote attestation: anonymous identity attestation of TPM and the security properties attestation of trust computing platform, and the verifier can verify both at the far endpoint. In order to simplify the attestations, we propose the hybrid attestation called APA(anonymous property attestation) from the elliptic curve cryptography and bilinear map. The scheme is provable security under the LRSW assumption, the hardness of discrete logarithms. The lengths of the attestation signature in our scheme are much shorter than directly associated two attestations, and also takes the less computation cost.","PeriodicalId":6838,"journal":{"name":"2021 IEEE 24th International Conference on Computational Science and Engineering (CSE)","volume":"59 1","pages":"732-738"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Anonymous Property-Based Attestation Protocol from Bilinear Maps\",\"authors\":\"Qin Yu, Feng Dengguo, Xu Zhen\",\"doi\":\"10.1109/CSE.2009.84\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Remote attestation presented in TCG specification is one of the significant ways to establish trust between the two endpoints. There are two categories of remote attestation: anonymous identity attestation of TPM and the security properties attestation of trust computing platform, and the verifier can verify both at the far endpoint. In order to simplify the attestations, we propose the hybrid attestation called APA(anonymous property attestation) from the elliptic curve cryptography and bilinear map. The scheme is provable security under the LRSW assumption, the hardness of discrete logarithms. The lengths of the attestation signature in our scheme are much shorter than directly associated two attestations, and also takes the less computation cost.\",\"PeriodicalId\":6838,\"journal\":{\"name\":\"2021 IEEE 24th International Conference on Computational Science and Engineering (CSE)\",\"volume\":\"59 1\",\"pages\":\"732-738\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 24th International Conference on Computational Science and Engineering (CSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSE.2009.84\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 24th International Conference on Computational Science and Engineering (CSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSE.2009.84","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

TCG规范中提出的远程认证是在两个端点之间建立信任的重要方式之一。远程认证有两类:TPM的匿名身份认证和信任计算平台的安全属性认证,验证者可以在远端端点对两者进行验证。为了简化认证,我们从椭圆曲线密码学和双线性映射中提出了一种名为APA(匿名属性认证)的混合认证方法。在LRSW假设和离散对数的硬度下,证明了该方案的安全性。该方案的认证签名长度比直接关联的两个认证短得多,而且计算成本更低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Anonymous Property-Based Attestation Protocol from Bilinear Maps
Remote attestation presented in TCG specification is one of the significant ways to establish trust between the two endpoints. There are two categories of remote attestation: anonymous identity attestation of TPM and the security properties attestation of trust computing platform, and the verifier can verify both at the far endpoint. In order to simplify the attestations, we propose the hybrid attestation called APA(anonymous property attestation) from the elliptic curve cryptography and bilinear map. The scheme is provable security under the LRSW assumption, the hardness of discrete logarithms. The lengths of the attestation signature in our scheme are much shorter than directly associated two attestations, and also takes the less computation cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
25th IEEE International Conference on Computational Science and Engineering, CSE 2022, Wuhan, China, December 9-11, 2022 UAV-empowered Vehicular Networking Scheme for Federated Learning in Delay Tolerant Environments A novel sentiment classification based on “word-phrase” attention mechanism CFP- A New Approach to Predicting Fantasy Points of NFL Quarterbacks A K-nearest neighbor classifier based on homomorphic encryption scheme
×
引用
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