{"title":"高效的证书签名方案","authors":"Yang Ming, Yumin Wang","doi":"10.1109/IAS.2009.62","DOIUrl":null,"url":null,"abstract":"In this paper, we give the secure model of certificate-based signature (CBS) and propose an efficient CBS scheme. The proposed scheme is shown to be existentially unforgeable against adaptive chosen message and identity attacks under the discrete logarithm assumption in the random oracle model. Compared with the schemes in RSA 2004 and in EuroPKI 2007, no pairing computation and the special MapToPoint hash function is needed in all phase, and hence,our scheme is more efficient.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Efficient Certificate-Based Signature Scheme\",\"authors\":\"Yang Ming, Yumin Wang\",\"doi\":\"10.1109/IAS.2009.62\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we give the secure model of certificate-based signature (CBS) and propose an efficient CBS scheme. The proposed scheme is shown to be existentially unforgeable against adaptive chosen message and identity attacks under the discrete logarithm assumption in the random oracle model. Compared with the schemes in RSA 2004 and in EuroPKI 2007, no pairing computation and the special MapToPoint hash function is needed in all phase, and hence,our scheme is more efficient.\",\"PeriodicalId\":240354,\"journal\":{\"name\":\"2009 Fifth International Conference on Information Assurance and Security\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-08-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Conference on Information Assurance and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAS.2009.62\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Information Assurance and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAS.2009.62","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we give the secure model of certificate-based signature (CBS) and propose an efficient CBS scheme. The proposed scheme is shown to be existentially unforgeable against adaptive chosen message and identity attacks under the discrete logarithm assumption in the random oracle model. Compared with the schemes in RSA 2004 and in EuroPKI 2007, no pairing computation and the special MapToPoint hash function is needed in all phase, and hence,our scheme is more efficient.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
