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

cryptographyintegrity of outsourced datainteractive protocolproofs of retrievabilityrewindable knowledge extractorsoundnesszero-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

• Compact Proofs of Retrievability
• Efficient pairing computation on supersingular abelian varieties
• Efficient signature generation by smart cards
• Efficient zero-knowledge proofs of knowledge without intractability assumptions
• Foundations of Cryptography
• Identity-based encryption from the Weil pairing
• On a Class of Pseudorandom Sequences From Elliptic Curves Over Finite Fields
• Proofs of Retrievability via Hardness Amplification
• Short group signatures

Cited in

(5)

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

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)