Zero-knowledge proofs of retrievability

DOI10.1007/S11432-011-4293-9MaRDI QIDQ350924zbMATH OpenOpenAlexFDO

Authors Zexing Hu, Gail-Joon Ahn, Huaixi Wang, Hongxin Hu, Yan Zhu

Publication date 3 July 2013

Published in Science China Information Sciences (Search for Journal in Brave)

Full work available at URL http://engine.scichina.com/doi/10.1007/s11432-011-4293-9

zbMATH Keywords

cryptographysoundnessintegrity of outsourced datainteractive protocolproofs of retrievabilityrewindable knowledge extractorzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Compact proofs of retrievability
• Compact Proofs of Retrievability
• Proofs of Retrievability via Hardness Amplification
• Proofs of retrievability via fountain code
• Multi-prover proof of retrievability

Cites work

• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• scientific article; zbMATH DE number 1440068 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• Compact Proofs of Retrievability
• Efficient pairing computation on supersingular abelian varieties
• Efficient signature generation by smart cards
• Foundations of Cryptography
• On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
• Proofs of Retrievability via Hardness Amplification

Cited in

(5)

• Private certificate-based remote data integrity checking in public clouds
• Is extracting data the same as possessing data?
• Updatable Zero-Knowledge Databases
• Compact proofs of retrievability
• Zero-knowledge elementary databases with more expressive queries

This page was built for publication: Zero-knowledge proofs of retrievability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q350924)