Liang Chen, Lansheng Han, Jiandu Jing and Dongping Hu A post-quantum provable data possession protocol in cloud Security and Communication Networks 6
This paper proposes a homomorphic hash-based provable data possession protocol (HH-PDP) from ideal lattice assumptions. We prove that the proposed protocol guarantees data possession in the standard model if the shortest polynomial problem is hard. Experimental result shows that HH-PDP is approximate five times lower in cost in preprocessing and checking proof, half the cost in generating proof compared with the most efficient PDP proposed by Ateniese et al. in 2011.
Complete the form below and we will send an e-mail message containing a link to the selected article on your behalf