|
|||||
|
|
Zero-knowledge proofs of retrievability |
|
| Authors: | ZHU Yan WANG HuaiXi HU ZeXing AHN Gail-Joon & HU HongXin Institute of Computer Science Technology Peking University Beijing China Beijing Key Laboratory of Internet Security Technology School of Mathematical Sciences School of Computing Informatics Decision Systems Engineering Arizona State University Tempe AZ USA |
| Affiliation: | ZHU Yan 1,2,WANG HuaiXi 3,HU ZeXing 1,AHN Gail-Joon 4 & HU HongXin 41 Institute of Computer Science and Technology,Peking University,Beijing 100871,China,2 Beijing Key Laboratory of Internet Security Technology,3 School of Mathematical Sciences,4 School of Computing,Informatics,and Decision Systems Engineering,Arizona State University,Tempe,AZ 85287,USA |
| Abstract: | Proof of retrievability (POR) is a technique for ensuring the integrity of data in outsourced storage services.In this paper,we address the construction of POR protocol on the standard model of interactive proof systems.We propose the first interactive POR scheme to prevent the fraudulence of prover and the leakage of verified data.We also give full proofs of soundness and zero-knowledge properties by constructing a polynomial-time rewindable knowledge extractor under the computational Diffie-Hellman assump... |
| Keywords: | cryptography integrity of outsourced data proofs of retrievability interactive protocol zero- knowledge soundness rewindable knowledge extractor |
| 本文献已被 CNKI 维普 等数据库收录！ | |