QQ客服 官方微博 反馈留言

	Zero-knowledge proofs of retrievability
	Zhu Yan ; Wang HuaiXi ; Hu ZeXing ; Ahn, Gail-Joon ; Hu HongXin
	2011
关键词	cryptography integrity of outsourced data proofs of retrievability interactive protocol zero-knowledge soundness rewindable knowledge extractor
英文摘要	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 assumption. In particular, the verification process of this scheme requires a low, constant amount of overhead, which minimizes communication complexity.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000293188100006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Computer Science, Information Systems; SCI(E); 16; ARTICLE; 8; 1608-1617; 54
语种	英语
出处	SCI
出版者	science china information sciences
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/161854]
专题	数学科学学院 信息科学技术学院
推荐引用方式 GB/T 7714	Zhu Yan,Wang HuaiXi,Hu ZeXing,et al. Zero-knowledge proofs of retrievability. 2011-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。