{"title":"Aggregate Signature-Based Efficient Attributes Proof with Pairing-Based Anonymous Credential","authors":"Nan Guo, Jianju Cheng, Bin Zhang, Kangbin Yim","doi":"10.1109/NBiS.2013.42","DOIUrl":null,"url":null,"abstract":"We present a novel pairing-based anonymous credential in the random oracle model. To solve the linear complexity of attributes proof, it is to certify each single attribute in an individual credential, and prove any combination of attributes by aggregating the corresponding credentials into a single one. The BLS signature and BGLS aggregate signature schemes are extended to construct anonymous credentials. Through performance analysis of attributes proof of AND relation, our anonymous credential can obtain the constant complexity respect to the number of exponentiations and parings, at the meanwhile, the signature and public parameters are short.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 16th International Conference on Network-Based Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NBiS.2013.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We present a novel pairing-based anonymous credential in the random oracle model. To solve the linear complexity of attributes proof, it is to certify each single attribute in an individual credential, and prove any combination of attributes by aggregating the corresponding credentials into a single one. The BLS signature and BGLS aggregate signature schemes are extended to construct anonymous credentials. Through performance analysis of attributes proof of AND relation, our anonymous credential can obtain the constant complexity respect to the number of exponentiations and parings, at the meanwhile, the signature and public parameters are short.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
