SHoPS: Set Homomorphic Proof of Data Possession Scheme in Cloud Storage Applications
暂无分享,去创建一个
[1] Ronald L. Rivest,et al. How to tell if your cloud files are vulnerable to drive crashes , 2011, CCS '11.
[2] Kenneth W. Regan. Minimum-Complexity Pairing Functions , 1992, J. Comput. Syst. Sci..
[3] Ratna Dutta,et al. Pairing-Based Cryptographic Protocols : A Survey , 2004, IACR Cryptol. ePrint Arch..
[4] Brent Waters,et al. Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys , 2005, CRYPTO.
[5] Reza Curtmola,et al. Provable data possession at untrusted stores , 2007, CCS '07.
[6] Jonathan Katz,et al. Proofs of Storage from Homomorphic Identification Protocols , 2009, ASIACRYPT.
[7] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[8] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.
[9] Ronald L. Rivest,et al. Hourglass schemes: how to prove that cloud files are encrypted , 2012, CCS.
[10] Hovav Shacham,et al. Compact Proofs of Retrievability , 2008, Journal of Cryptology.
[11] Yevgeniy Dodis,et al. Proofs of Retrievability via Hardness Amplification , 2009, IACR Cryptol. ePrint Arch..
[12] John Gantz,et al. The Digital Universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East , 2012 .
[13] Reza Curtmola,et al. Remote data checking using provable data possession , 2011, TSEC.
[14] Ari Juels,et al. Pors: proofs of retrievability for large files , 2007, CCS '07.