Secure and Constant Cost Public Cloud Storage Auditing with Deduplication
暂无分享,去创建一个
[1] F. Moore,et al. Polynomial Codes Over Certain Finite Fields , 2017 .
[2] Cong Wang,et al. Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing , 2011, IEEE Transactions on Parallel and Distributed Systems.
[3] Reza Curtmola,et al. Provable data possession at untrusted stores , 2007, CCS '07.
[4] Benny Pinkas,et al. Proofs of ownership in remote storage systems , 2011, CCS '11.
[5] P. Mell,et al. The NIST Definition of Cloud Computing , 2011 .
[6] Hovav Shacham,et al. Compact Proofs of Retrievability , 2008, Journal of Cryptology.
[7] Shouhuai Xu,et al. Secure and efficient proof of storage with deduplication , 2012, CODASPY '12.
[8] Ian Goldberg,et al. Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.
[9] Ari Juels,et al. Pors: proofs of retrievability for large files , 2007, CCS '07.
[10] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[11] Kwangjo Kim,et al. Security weakness in the Proof of Storage with Deduplication , 2012, IACR Cryptol. ePrint Arch..
[12] Yevgeniy Dodis,et al. Proofs of Retrievability via Hardness Amplification , 2009, IACR Cryptol. ePrint Arch..
[13] Victor Shoup,et al. A computational introduction to number theory and algebra , 2005 .
[14] Roberto Di Pietro,et al. Scalable and efficient provable data possession , 2008, IACR Cryptol. ePrint Arch..
[15] Roberto Di Pietro,et al. Boosting efficiency and security in proof of ownership for deduplication , 2012, ASIACCS '12.
[16] Daniel R. L. Brown,et al. The Static Diffie-Hellman Problem , 2004, IACR Cryptology ePrint Archive.
[17] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[18] Shucheng Yu,et al. Proofs of retrievability with public verifiability and constant communication cost in cloud , 2013, Cloud Computing '13.
[19] Jia Xu,et al. Towards Efficient Provable Data Possession , 2011, IACR Cryptol. ePrint Arch..