{"title":"基于离散对数和因子分解的广义签名方案的安全性","authors":"Chien-Lung Hsu, Yu-Hao Chuang, Wei-Hua He, So-Lin Yen, C. Tseng, Chia-Wen Chen","doi":"10.1109/CCST.2009.5335530","DOIUrl":null,"url":null,"abstract":"In 2005, Pon et al. proposed a generalized signature scheme based on the intractability of solving two well-known cryptographic assumptions, the factorization (FAC) and the discrete logarithm problem (DLP). They claimed that their scheme is still secure, provided that one of these two assumptions is solved. This paper, however, will show that Pon et al.'s scheme is insecure against the universal forgery attack if the adversary can solve the DLP.","PeriodicalId":117285,"journal":{"name":"43rd Annual 2009 International Carnahan Conference on Security Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Security of generalized signature scheme based on discrete logarithms and factorization\",\"authors\":\"Chien-Lung Hsu, Yu-Hao Chuang, Wei-Hua He, So-Lin Yen, C. Tseng, Chia-Wen Chen\",\"doi\":\"10.1109/CCST.2009.5335530\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 2005, Pon et al. proposed a generalized signature scheme based on the intractability of solving two well-known cryptographic assumptions, the factorization (FAC) and the discrete logarithm problem (DLP). They claimed that their scheme is still secure, provided that one of these two assumptions is solved. This paper, however, will show that Pon et al.'s scheme is insecure against the universal forgery attack if the adversary can solve the DLP.\",\"PeriodicalId\":117285,\"journal\":{\"name\":\"43rd Annual 2009 International Carnahan Conference on Security Technology\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"43rd Annual 2009 International Carnahan Conference on Security Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCST.2009.5335530\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"43rd Annual 2009 International Carnahan Conference on Security Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCST.2009.5335530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Security of generalized signature scheme based on discrete logarithms and factorization
In 2005, Pon et al. proposed a generalized signature scheme based on the intractability of solving two well-known cryptographic assumptions, the factorization (FAC) and the discrete logarithm problem (DLP). They claimed that their scheme is still secure, provided that one of these two assumptions is solved. This paper, however, will show that Pon et al.'s scheme is insecure against the universal forgery attack if the adversary can solve the DLP.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
