| 数据可恢复性的零知识证明 |
| |
| 引用本文： | 朱岩,王怀习,胡泽行,Gail-Joon AHN,胡宏新. 数据可恢复性的零知识证明[J]. 中国科学:信息科学, 2011, 0(10) |
| |
| 作者姓名： | 朱岩 王怀习 胡泽行 Gail-Joon AHN 胡宏新 |
| |
| 作者单位： | 北京大学计算机科学技术研究所;北京大学互联网安全技术北京市重点实验室;北京大学数学科学学院;School of Computing;Informatics;and Decision Systems Engineering;Arizona State University;Tempe;AZ 85287; |
| |
| 基金项目： | 国家自然科学基金(批准号:61003216); 美国国家自然科学基金(批准号:NSF-IIS-0900970,NSF-CNS-0831360)资助项目 |
| |
| 摘 要： | 可恢复性证明是一种外包存储服务中的数据完整性检测技术.本文致力于交互式证明系统标准模型下的可恢复性证明协议构造方法研究,提出了首个能够防止证明者欺骗和验证数据泄露的交互式可恢复性证明协议,并通过构造多项式时间的可回卷知识抽取器,给出了基于计算Diffie-Hellman假设下的协议完备性、稳固性,以及零知识性证明.特别是,所提方案的验证过程只要求低的、固定大小的负载,达到了最小化通信复杂性的目的.
|
| 关 键 词： | 密码学 存储安全 可恢复性证明 交互协议 零知识 |
Zero-knowledge proofs of retrievability |
| |
| ZHU Yan ,,WANG HuaiXi ,HU ZeXing ,Gail-Joon AHN , 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. Zero-knowledge proofs of retrievability[J]. Scientia Sinica Informationis, 2011, 0(10) |
| |
| Authors: | ZHU Yan WANG HuaiXi HU ZeXing Gail-Joon AHN & 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,Gail-Joon AHN 4 & HU HongXin 4 1 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 polynomialtime rewindable knowledge extractor under the computational Diffie-Hellman assumpt... |
| |
| Keywords: | cryptography storage security proofs of retrievability interactive protocol zero-knowledge |
| 本文献已被 CNKI 等数据库收录！ |
|
