{"title":"新的无随机oracle的CCA-Secure代理重加密方案","authors":"Xu An Wang, Ping Wei, Minqing Zhang","doi":"10.1109/CIS.2010.87","DOIUrl":null,"url":null,"abstract":"Proxy re-encryption PRE) allows a ciphertext computed under Alice’s public key to be transformed to thos which can be decrypted by Bob. In PKC’08, Libert an Vergnaud proposed the ?rst unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.’s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"New CCA-Secure Proxy Re-encryption Scheme without Random Oracles\",\"authors\":\"Xu An Wang, Ping Wei, Minqing Zhang\",\"doi\":\"10.1109/CIS.2010.87\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proxy re-encryption PRE) allows a ciphertext computed under Alice’s public key to be transformed to thos which can be decrypted by Bob. In PKC’08, Libert an Vergnaud proposed the ?rst unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.’s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.\",\"PeriodicalId\":420515,\"journal\":{\"name\":\"2010 International Conference on Computational Intelligence and Security\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2010.87\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2010.87","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New CCA-Secure Proxy Re-encryption Scheme without Random Oracles
Proxy re-encryption PRE) allows a ciphertext computed under Alice’s public key to be transformed to thos which can be decrypted by Bob. In PKC’08, Libert an Vergnaud proposed the ?rst unidirectional RCCA-secure PRE scheme in the standard model. They left the open problem of constructing unidirectional CCA-secure PRE scheme in the standard model open. Until recently, this open problem was solved by Weng et al. and Shao et al. independently. In this paper, based on Shao et al.’s proposal, we give a new efficient CCA-secure PRE scheme without random oracles and prove its security.