{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:50:27Z","timestamp":1762005027906},"reference-count":0,"publisher":"National Library of Serbia","issue":"3","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ComSIS","COMPUT SCI INF SYST","COMPUT SCI INFORM SY","COMPUTER SCI INFORM","COMSIS J"],"published-print":{"date-parts":[[2018]]},"abstract":"<jats:p>Recently Liang et al. propose an interesting privacy-preserving ciphertext multi-sharing control for big data storage mechanism, which is based on the cryptographic primitive of anonymous multi-hop identity based conditional proxy re-encryption scheme AMH-IBCPRE. They propose a concrete AMH-IBCPRE scheme and conclude their scheme can achieve IND-sCon-sID-CCA secure (indistinguishable secure under selectively conditional selectively identity chosen ciphertext attack). However, our research show their scheme can not be IND-sConsID- CCA secure for single-hop and multi-hop data sharing. Also in 2014, Liang et al. propose an interesting deterministic finite automata-based functional proxy reencryption scheme DFA-based FPRE for secure public cloud data sharing, they also conclude their scheme can achieve IND-CCA secure (indistinguishable secure under chosen ciphertext attack), we also show their scheme can not be IND-CCA secure either. For these two proposals, the main reason of insecurity is that part of the re-encryption key has the same structure as the valid ciphertext, thus the adversary can query on the decryption oracle with this part of the re-encryption key to get secret keys, which will break the CCA-security of their scheme.We give an improved AMH-IBCPRE scheme and an improved DFA-based FPRE scheme for cloud data sharing and show the new schemes can resist our attack and be CCA-secure.We also demonstrate our improved AMH-IBCPRE scheme?s efficiency compared with other related identity based proxy re-encryption schemes, the results show our scheme is almost the most efficient one.<\/jats:p>","DOI":"10.2298\/csis171218024w","type":"journal-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T10:22:52Z","timestamp":1537525372000},"page":"585-614","source":"Crossref","is-referenced-by-count":12,"title":["Improved functional proxy re-encryption schemes for secure cloud data sharing"],"prefix":"10.2298","volume":"15","author":[{"suffix":"An","given":"Xu","family":"Wang","sequence":"first","affiliation":[{"name":"Key Laboratory of Information and Network Security, Engineering University of Chinese Armed Police Force, P. R. China + Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyuan","family":"Yang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Information and Network Security, Engineering University of Chinese Armed Police Force, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cong","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Information and Network Security, Engineering University of Chinese Armed Police Force, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yudong","family":"Liu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Information and Network Security, Engineering University of Chinese Armed Police Force, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Ding","sequence":"additional","affiliation":[{"name":"Guangxi Key Laboratory of Cryptography and Information Security, Guilin University of Electronic Technology, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1078","container-title":["Computer Science and Information Systems"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:33:34Z","timestamp":1685349214000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=1820-02141800024W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018]]}},"URL":"https:\/\/doi.org\/10.2298\/csis171218024w","relation":{},"ISSN":["1820-0214","2406-1018"],"issn-type":[{"value":"1820-0214","type":"print"},{"value":"2406-1018","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}