{"title":"基于id的指定验证者签名方案的可委派性","authors":"Y. Ling, Yiming Xiang, Xun Sun","doi":"10.1109/ICCT.2008.4716230","DOIUrl":null,"url":null,"abstract":"In this paper we criticize the claimed security of an identity-based strong designated verifier signature (IBSDVS) scheme proposed recently based on bilinear pairings. In particular, we show that, contrary to the authorspsila claim, this scheme is delegatable if the computational Diffie-Hellman problem in the underlying group is intractable. We also explain why the claimed proof fails, in the hope that similar mistake is not repeated in future research.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Delegatability of an ID-based designated verifier signature scheme\",\"authors\":\"Y. Ling, Yiming Xiang, Xun Sun\",\"doi\":\"10.1109/ICCT.2008.4716230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we criticize the claimed security of an identity-based strong designated verifier signature (IBSDVS) scheme proposed recently based on bilinear pairings. In particular, we show that, contrary to the authorspsila claim, this scheme is delegatable if the computational Diffie-Hellman problem in the underlying group is intractable. We also explain why the claimed proof fails, in the hope that similar mistake is not repeated in future research.\",\"PeriodicalId\":259577,\"journal\":{\"name\":\"2008 11th IEEE International Conference on Communication Technology\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 11th IEEE International Conference on Communication Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCT.2008.4716230\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th IEEE International Conference on Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCT.2008.4716230","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Delegatability of an ID-based designated verifier signature scheme
In this paper we criticize the claimed security of an identity-based strong designated verifier signature (IBSDVS) scheme proposed recently based on bilinear pairings. In particular, we show that, contrary to the authorspsila claim, this scheme is delegatable if the computational Diffie-Hellman problem in the underlying group is intractable. We also explain why the claimed proof fails, in the hope that similar mistake is not repeated in future research.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
