Analysis and Optimization on FlexDPDP: A Practical Solution for Dynamic Provable Data Possession

  • Ertem EsinerEmail author
  • Alptekin Küpçü
  • Öznur Özkasap
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8993)


Security measures, such as proving data integrity, became more important with the increase in popularity of cloud data storage services. Dynamic Provable Data Possession (DPDP) was proposed in the literature to enable the cloud server to prove to the client that her data is kept intact, even in a dynamic setting where the client may update her files. Realizing that variable-sized updates are very inefficient in DPDP (in the worst case leading to uploading the whole file again), Flexible DPDP (FlexDPDP) was proposed.

In this paper, we analyze FlexDPDP scheme and propose optimized algorithms. We show that the initial pre-processing phase at the client and server sides during the file upload (generally the most time-consuming operation) can be efficiently performed by parallelization techniques that result in a speed up of 6 with 8 cores. We propose a way of handling multiple updates at once both at the server and the client side, achieving an efficiency gain of 60 % at the server side and 90 % in terms of the client’s update verification time.

We deployed the optimized FlexDPDP on the large-scale network testbed PlanetLab and demonstrate the efficiency of our proposed optimizations on multi-client scenarios according to real workloads based on version control system traces.


Server Side Cloud Storage Client Side Upload Bandwidth Dummy Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



We would like to thank Ozan Okumuşoğlu at Koç University, Istanbul, Turkey for his contribution on testing and debugging, working on implementation of server-client side of the project and verification algorithms. We also acknowledge the support of TÜBİTAK (the Scientific and Technological Research Council of Turkey) under project numbers 111E019 and 112E115, Türk Telekom, Inc. under grant 11315-06, the European Union COST Actions IC1206 and IC1306, and Koç Sistem, Inc.


  1. 1.
    Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos: optimal resilience with byzantine shared memory. Distrib. Comput. 18(5), 387–408 (2006)zbMATHCrossRefGoogle Scholar
  2. 2.
    Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: ACM CCS (2007)Google Scholar
  3. 3.
    Ateniese, G., Kamara, S., Katz, J.: Proofs of storage from homomorphic identification protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 319–333. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  4. 4.
    Ateniese, G., Di Pietro, R., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: SecureComm (2008)Google Scholar
  5. 5.
    Bessani, A., Correia, M., Quaresma, B., André, F., Sousa, P.: Depsky: dependable and secure storage in a cloud-of-clouds. In: EuroSys 2011. ACM (2011)Google Scholar
  6. 6.
    Boost asio library.
  7. 7.
    Bowers, K.D., Juels, A., Oprea, A.: Hail: a high-availability and integrity layer for cloud storage. In: ACM CCS (2009)Google Scholar
  8. 8.
    Brownie cashlib cryptographic library.
  9. 9.
    Cachin, C., Keidar, I., Shraer, A.: Trusting the Cloud. SIGACT News, New York (2009) Google Scholar
  10. 10.
    Cachin, C.,Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: DSN 2006. IEEE Computer Society, Washington (2006)Google Scholar
  11. 11.
    Cash, D., Küpçü, A., Wichs, D.: Dynamic proofs of retrievability via oblivious ram. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 279–295. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  12. 12.
    Chockler, G., Guerraoui, R., Keidar, I., Vukolic, M.: Reliable distributed storage. IEEE Comput. 42(4), 60–67 (2009)CrossRefGoogle Scholar
  13. 13.
    Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. In: Proceedings of PODC 2002. ACM Press (2002)Google Scholar
  14. 14.
    Curtmola, R.: Khan, O., Burns, R., Ateniese, G.: Multiple-replica provable data possession. In: ICDCS (2008)Google Scholar
  15. 15.
    Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109–127. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  16. 16.
    Erway, C., Küpçü, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: ACM CCS (2009)Google Scholar
  17. 17.
    Esiner, E., Kachkeev, A., Braunfeld, S., Küpçü, A., Özkasap, Ö.: Flexdpdp: Flexlist-based optimized dynamic provable data possession. Cryptology ePrint Archive, Report 2013/645 (2013)Google Scholar
  18. 18.
    Etemad, M., Küpçü, A.: Transparent, distributed, and replicated dynamic provable data possession. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 1–18. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  19. 19.
    Furht, B., Escalante, A.: Handbook of Cloud Computing. Computer Science. Springer, Heidelberg (2010) zbMATHCrossRefGoogle Scholar
  20. 20.
    Gafni, E., Lamport, L.: Disk paxos. Distrib. Comput. 16(1), 1–20 (2003)CrossRefGoogle Scholar
  21. 21.
    Goodson, G., Wylie, J., Ganger, G., Reiter, M.: Efficient byzantine-tolerant erasure-coded storage. In: DSN 2004 (2004)Google Scholar
  22. 22.
    Hendricks, J., Ganger, G.R., Reiter, M.k.: Low-overhead byzantine fault-tolerant storage. In: SOSP 2007. ACM (2007)Google Scholar
  23. 23.
    Jayanti, P., Chandra, T.D., Toueg, S.: Fault-tolerant wait-free shared objects. J. ACM. 45(3), 451–500 (1998)zbMATHMathSciNetCrossRefGoogle Scholar
  24. 24.
    Jensen, M., Schwenk, J., Gruschka, N., Iacono, L.L.: On technical security issues in cloud computing. In: Cloud Computing CLOUD 2009. IEEE (2009)Google Scholar
  25. 25.
    Juels, A., Kaliski, B.S.: PORs: Proofs of retrievability for large files. In: ACM CCS (2007)Google Scholar
  26. 26.
    Liskov, B., Rodrigues, R.: Tolerating byzantine faulty clients in a quorum system. In: IEEE 32nd International Conference on Distributed Computing Systems (2006)Google Scholar
  27. 27.
    Malkhi, D., Reiter, M.: Byzantine quorum systems. Distrib. Comput. 11(4), 203–213 (1998)CrossRefGoogle Scholar
  28. 28.
    Meiklejohn, S., Erway, C., Küpçü, A., Hinkle, T., Lysyanskaya, A.: Zkpdl: Enabling efficient implementation of zero-knowledge proofs and e-cash. In: USENIX Security (2010)Google Scholar
  29. 29.
    Papamanthou, C., Tamassia, R.: Time and space efficient algorithms for two-party authenticated data structures. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol. 4861, pp. 1–15. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  30. 30.
    Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90–107. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  31. 31.
    Stanton, P.T., McKeown, B., Burns, R.C., Ateniese, G.: Fastad: an authenticated directory for billions of objects. SIGOPS Oper. Syst. Rev. 44(1), 45–49 (2010)CrossRefGoogle Scholar
  32. 32.
    Wang, Q., Wang, C., Li, J., Ren, K., Lou, W.: Enabling public verifiability and data dynamics for storage security in cloud computing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 355–370. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  33. 33.
    Wooley, P.S.: Identifying cloud computing security risks. Technical report, 7 University of Oregon Eugene (2011)Google Scholar
  34. 34.
    Zheng, Q., Xu, S.: Fair and dynamic proofs of retrievability. In: CODASPY (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Ertem Esiner
    • 1
    Email author
  • Alptekin Küpçü
    • 1
  • Öznur Özkasap
    • 1
  1. 1.Department of Computer EngineeringKoç UniversityİstanbulTurkey

Personalised recommendations