Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession
暂无分享,去创建一个
[1] Cong Wang,et al. Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing , 2011, IEEE Transactions on Parallel and Distributed Systems.
[2] Dahlia Malkhi,et al. Active Disk Paxos with infinitely many processes , 2002, PODC '02.
[3] Idit Keidar,et al. Trusting the cloud , 2009, SIGA.
[4] Idit Keidar,et al. Byzantine disk paxos: optimal resilience with byzantine shared memory , 2004, PODC '04.
[5] Sam Toueg,et al. Fault-tolerant wait-free shared objects , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[6] Jörg Schwenk,et al. On Technical Security Issues in Cloud Computing , 2009, 2009 IEEE International Conference on Cloud Computing.
[7] Randal C. Burns,et al. FastAD: an authenticated directory for billions of objects , 2010, OPSR.
[8] Roberto Di Pietro,et al. Scalable and efficient provable data possession , 2008, IACR Cryptol. ePrint Arch..
[9] Alptekin Küpçü,et al. ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash , 2010, USENIX Security Symposium.
[10] Jonathan Katz,et al. Proofs of Storage from Homomorphic Identification Protocols , 2009, ASIACRYPT.
[11] Michael K. Reiter,et al. Efficient Byzantine-tolerant erasure-coded storage , 2004, International Conference on Dependable Systems and Networks, 2004.
[12] Ari Juels,et al. HAIL: a high-availability and integrity layer for cloud storage , 2009, CCS.
[13] David Cash,et al. Dynamic Proofs of Retrievability Via Oblivious RAM , 2013, Journal of Cryptology.
[14] Leslie Lamport,et al. Disk Paxos , 2003, Distributed Computing.
[15] Ertem Esiner,et al. FlexDPDP , 2016, ACM Trans. Storage.
[16] Shouhuai Xu,et al. Fair and dynamic proofs of retrievability , 2011, CODASPY '11.
[17] Rodrigo Rodrigues,et al. Tolerating Byzantine Faulty Clients in a Quorum System , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).
[18] Paul S. Wooley. Identifying Cloud Computing Security Risks , 2011 .
[19] Reza Curtmola,et al. Provable data possession at untrusted stores , 2007, CCS '07.
[20] Roberto Tamassia,et al. Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures , 2007, ICICS.
[21] Borko Furht,et al. Handbook of Cloud Computing , 2010 .
[22] Marko Vukolic,et al. Reliable Distributed Storage , 2009, Computer.
[23] Alysson Neves Bessani,et al. DepSky: dependable and secure storage in a cloud-of-clouds , 2011, EuroSys '11.
[24] Miguel Correia,et al. DepSky: Dependable and Secure Storage in a Cloud-of-Clouds , 2013, TOS.
[25] Michael K. Reiter,et al. Byzantine quorum systems , 1997, STOC '97.
[26] Cong Wang,et al. Enabling Public Verifiability and Data Dynamics for Storage Security in Cloud Computing , 2009, ESORICS.
[27] Alptekin Küpçü,et al. Transparent, Distributed, and Replicated Dynamic Provable Data Possession , 2013, ACNS.
[28] Reza Curtmola,et al. MR-PDP: Multiple-Replica Provable Data Possession , 2008, 2008 The 28th International Conference on Distributed Computing Systems.
[29] Yevgeniy Dodis,et al. Proofs of Retrievability via Hardness Amplification , 2009, IACR Cryptol. ePrint Arch..
[30] Stefano Tessaro,et al. Optimal Resilience for Erasure-Coded Byzantine Distributed Storage , 2005, International Conference on Dependable Systems and Networks (DSN'06).
[31] Hovav Shacham,et al. Compact Proofs of Retrievability , 2008, Journal of Cryptology.
[32] Ari Juels,et al. Pors: proofs of retrievability for large files , 2007, CCS '07.
[33] Michael K. Reiter,et al. Low-overhead byzantine fault-tolerant storage , 2007, SOSP.