{"title":"无随机Oracle的基于id的安全盲签名方案","authors":"Xiaoming Hu, Jian Wang, Yinchun Yang","doi":"10.1109/NCIS.2011.56","DOIUrl":null,"url":null,"abstract":"The known construction of an identity-based blind signature scheme that is secure in the standard model is based on a generic approach which attaches a certificate to an ordinary (i.e. non-identity-based) blind signature scheme, and thus the identity-based blind signature scheme constructed by this method is inefficient and has long signature size. In this paper, based on the identity-based encryption scheme proposed by Gentry recently, we present a direct construction of an identity-based blind signature scheme. Our identity-based blind signature scheme is computationally efficient and the signature is short. We prove that our scheme is concurrently secure with a tight security reduction in the standard model assuming that the $q$-SDH problem is hard.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Secure ID-Based Blind Signature Scheme without Random Oracle\",\"authors\":\"Xiaoming Hu, Jian Wang, Yinchun Yang\",\"doi\":\"10.1109/NCIS.2011.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The known construction of an identity-based blind signature scheme that is secure in the standard model is based on a generic approach which attaches a certificate to an ordinary (i.e. non-identity-based) blind signature scheme, and thus the identity-based blind signature scheme constructed by this method is inefficient and has long signature size. In this paper, based on the identity-based encryption scheme proposed by Gentry recently, we present a direct construction of an identity-based blind signature scheme. Our identity-based blind signature scheme is computationally efficient and the signature is short. We prove that our scheme is concurrently secure with a tight security reduction in the standard model assuming that the $q$-SDH problem is hard.\",\"PeriodicalId\":215517,\"journal\":{\"name\":\"2011 International Conference on Network Computing and Information Security\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Network Computing and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCIS.2011.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Network Computing and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCIS.2011.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Secure ID-Based Blind Signature Scheme without Random Oracle
The known construction of an identity-based blind signature scheme that is secure in the standard model is based on a generic approach which attaches a certificate to an ordinary (i.e. non-identity-based) blind signature scheme, and thus the identity-based blind signature scheme constructed by this method is inefficient and has long signature size. In this paper, based on the identity-based encryption scheme proposed by Gentry recently, we present a direct construction of an identity-based blind signature scheme. Our identity-based blind signature scheme is computationally efficient and the signature is short. We prove that our scheme is concurrently secure with a tight security reduction in the standard model assuming that the $q$-SDH problem is hard.