一类基于id的签名的安全参数

Zhengwei Guo, Xinzheng He, Baocheng Xun
{"title":"一类基于id的签名的安全参数","authors":"Zhengwei Guo, Xinzheng He, Baocheng Xun","doi":"10.1109/ICDS.2008.34","DOIUrl":null,"url":null,"abstract":"Provable security based on complexity theory provides an efficient way for providing the convincing evidences of security. In this paper, we present a definition of generic ID-based signature schemes by extending the definition of generic signature schemes, and prove the Forking lemma for that. Then we propose a new and efficient ID-based signature scheme built upon bilinear maps. We prove its security under k-CAA computational assumption in the random oracle model.","PeriodicalId":422080,"journal":{"name":"Second International Conference on the Digital Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Security Arguments for a Class of ID-Based Signatures\",\"authors\":\"Zhengwei Guo, Xinzheng He, Baocheng Xun\",\"doi\":\"10.1109/ICDS.2008.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Provable security based on complexity theory provides an efficient way for providing the convincing evidences of security. In this paper, we present a definition of generic ID-based signature schemes by extending the definition of generic signature schemes, and prove the Forking lemma for that. Then we propose a new and efficient ID-based signature scheme built upon bilinear maps. We prove its security under k-CAA computational assumption in the random oracle model.\",\"PeriodicalId\":422080,\"journal\":{\"name\":\"Second International Conference on the Digital Society\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Second International Conference on the Digital Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDS.2008.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Second International Conference on the Digital Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDS.2008.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于复杂性理论的可证明安全性为提供令人信服的安全证据提供了一种有效的方法。本文通过扩展一般签名方案的定义,给出了一般基于身份的签名方案的定义,并证明了其分叉引理。在此基础上,提出了一种新的基于双线性映射的高效身份签名方案。在随机oracle模型的k-CAA计算假设下证明了其安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Security Arguments for a Class of ID-Based Signatures
Provable security based on complexity theory provides an efficient way for providing the convincing evidences of security. In this paper, we present a definition of generic ID-based signature schemes by extending the definition of generic signature schemes, and prove the Forking lemma for that. Then we propose a new and efficient ID-based signature scheme built upon bilinear maps. We prove its security under k-CAA computational assumption in the random oracle 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学术文献互助群
群 号:604180095
Book学术官方微信