New proofs of ownership for efficient data deduplication in the adversarial conspiracy model

International Journal of Intelligent SystemsVolume 36, Issue 6 p. 2753-2766 RESEARCH ARTICLE New proofs of ownership for efficient data deduplication in the adversarial conspiracy model Meixia Miao, Corresponding Author Meixia Miao [email protected] orcid.org/0000-0002-9503-4013 School of Cyberspace Security, Xi'an University of Posts and Telecommunications, Xi'an, China State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, China Correspondence Meixia Miao, School of Cyberspace Security, Xi'an University of Posts and Telecommunications, 710121 Xi'an, China. Email: [email protected]Search for more papers by this authorGuohua Tian, Guohua Tian orcid.org/0000-0002-9775-695X State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, ChinaSearch for more papers by this authorWilly Susilo, Willy Susilo orcid.org/0000-0002-1562-5105 School of Computing and Information Technology, University of Wollongong, Wollongong, New South Wales, AustraliaSearch for more papers by this author Meixia Miao, Corresponding Author Meixia Miao [email protected] orcid.org/0000-0002-9503-4013 School of Cyberspace Security, Xi'an University of Posts and Telecommunications, Xi'an, China State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, China Correspondence Meixia Miao, School of Cyberspace Security, Xi'an University of Posts and Telecommunications, 710121 Xi'an, China. Email: [email protected]Search for more papers by this authorGuohua Tian, Guohua Tian orcid.org/0000-0002-9775-695X State Key Laboratory of Integrated Service Networks (ISN), Xidian University, Xi'an, ChinaSearch for more papers by this authorWilly Susilo, Willy Susilo orcid.org/0000-0002-1562-5105 School of Computing and Information Technology, University of Wollongong, Wollongong, New South Wales, AustraliaSearch for more papers by this author First published: 12 March 2021 https://doi.org/10.1002/int.22400Citations: 2Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Abstract The primitive of proofs of ownership (PoWs) enables a prover to efficiently convince a verifier that he/she indeed owns a certain message in a knowledge-proof manner. As a result, it can prevent an adversary who only has a short information of the message from accessing the whole one. We argue that the existing PoWs based on Merkle hash tree and specific encodings are not much efficient if the size of message is sufficiently huge. In this paper, we first propose a new PoW protocol based on the chameleon hash function without key exposure. Interestingly, it is equivalent to having the prover compute a new collision of chameleon hashing as the proof in our construction. Therefore, the proposed protocol is much efficient since the computation and storage overhead of proof is independent of the size of the message. Moreover, we utilize the proposed PoWs to design a deduplication scheme over ciphertext. Citing Literature Volume36, Issue6June 2021Pages 2753-2766 RelatedInformation