安全凭据中的有效属性

Seyed Alireza Pourbakhsh, R. Katti
{"title":"安全凭据中的有效属性","authors":"Seyed Alireza Pourbakhsh, R. Katti","doi":"10.1109/PACRIM.2015.7334818","DOIUrl":null,"url":null,"abstract":"We propose a new method to efficiently encode attributes in the Camenisch-Lysyanskaya anonymous credential system. The new method is based on the Chinese remainder theorem. We show that with this method all attributes, including integer and string based attributes can be efficiently encoded. Also, we show that the number of bits needed for encoding attributes could be decreased by up to 48%. The protocols for finite-set attributes have the same complexity level as the work by Camenisch and Groß, but for string and integer based attributes, we decrease the complexity from O(l) to O(1).","PeriodicalId":350052,"journal":{"name":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Efficient attributes in secure credentials\",\"authors\":\"Seyed Alireza Pourbakhsh, R. Katti\",\"doi\":\"10.1109/PACRIM.2015.7334818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a new method to efficiently encode attributes in the Camenisch-Lysyanskaya anonymous credential system. The new method is based on the Chinese remainder theorem. We show that with this method all attributes, including integer and string based attributes can be efficiently encoded. Also, we show that the number of bits needed for encoding attributes could be decreased by up to 48%. The protocols for finite-set attributes have the same complexity level as the work by Camenisch and Groß, but for string and integer based attributes, we decrease the complexity from O(l) to O(1).\",\"PeriodicalId\":350052,\"journal\":{\"name\":\"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2015.7334818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2015.7334818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

提出了一种有效编码Camenisch-Lysyanskaya匿名证书系统属性的新方法。该方法基于中国剩余定理。我们证明了使用该方法可以有效地编码所有属性,包括基于整数和字符串的属性。此外,我们还表明,编码属性所需的比特数最多可以减少48%。有限集属性的协议与Camenisch和Groß的工作具有相同的复杂度,但对于基于字符串和整数的属性,我们将复杂度从O(1)降低到O(1)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient attributes in secure credentials
We propose a new method to efficiently encode attributes in the Camenisch-Lysyanskaya anonymous credential system. The new method is based on the Chinese remainder theorem. We show that with this method all attributes, including integer and string based attributes can be efficiently encoded. Also, we show that the number of bits needed for encoding attributes could be decreased by up to 48%. The protocols for finite-set attributes have the same complexity level as the work by Camenisch and Groß, but for string and integer based attributes, we decrease the complexity from O(l) to O(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学术官方微信