Advertisement

Towards Efficient Fully Randomized Message-Locked Encryption

  • Tao Jiang
  • Xiaofeng ChenEmail author
  • Qianhong Wu
  • Jianfeng Ma
  • Willy Susilo
  • Wenjing Lou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9722)

Abstract

Cross-user data deduplication will greatly reduce the storage cost of storage service provider. Motivated by secure data deduplication, Abadi et al. extended the work Message-Locked Encryption (MLE) and introduced the primitive of MLE2 with nice security properties. However, their fully randomized scheme (R-MLE2) requires the inefficient equality-testing algorithm to identify all duplicate ciphertexts. Thus, an interesting open problem is how to reduce the overhead of R-MLE2 and propose an efficient construction for R-MLE2. In this paper, we introduce a new primitive called \(\mu \)R-MLE2, which gives a partial positive answer to this open problem. Our main trick is to use the client-assistant way based on static or dynamic decision trees. The advantage gained from it is that by interacting with clients, the server will reduce the time complexity of deduplication equality test from linear time to efficient logarithmic time over the whole database items.

Keywords

Deduplication Convergent encryption Message-locked encryption Interactive protocol 

Notes

Acknowledgement

We are grateful to the anonymous referees for their invaluable suggestions. This work is supported by the National Natural Science Foundation of China (No. 61272455, and No. 61370190), China 111 Project (No. B08038), Doctoral Fund of Ministry of Education of China (No.20130203110004), Program for New Century Excellent Talents in University (No. NCET-13-0946), the Fundamental Research Funds for the Central Universities (No. BDY151402), and National High Technology Research and Development Program (863 Program) of China (No.2015AA016007); Besides, this work is also supported by US National Science Foundation under grant (CNS-1217889 and CNS-1446479).

References

  1. 1.
    Abadi, M., Boneh, D., Mironov, I., Raghunathan, A., Segev, G.: Message-locked encryption for lock-dependent messages. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 374–391. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  2. 2.
    Bellare, M., Keelveedhi, S.: Interactive message-locked encryption and secure deduplication. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 516–538. Springer, Heidelberg (2015)Google Scholar
  3. 3.
    Bellare, M., Keelveedhi, S., Ristenpart, T.: Dupless: server-aided encryption for deduplicated storage. In: Proceedings of the USENIX Security Symposium, pp. 179–194, DC, USA, August 2013Google Scholar
  4. 4.
    Bellare, M., Keelveedhi, S., Ristenpart, T.: Message-locked encryption and secure deduplication. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 296–312. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  5. 5.
    Chen, X., Li, J., Ma, J., Tang, Q., Lou, W.: New algorithms for secure outsourcing of modular exponentiations. IEEE Trans. Parallel Distrib. Syst. 25(9), 2386–2396 (2014)CrossRefGoogle Scholar
  6. 6.
    Chen, X., Li, J., Weng, J., Ma, J., Lou, W.: Verifiable computation over large database with incremental updates. In: Kutyłowski, M., Vaidya, J. (eds.) ICAIS 2014, Part I. LNCS, vol. 8712, pp. 148–162. Springer, Heidelberg (2014)Google Scholar
  7. 7.
    Douceur, J., Adya, A., Bolosky, W., Simon, D., Theimer, M.: Reclaiming space from duplicate files in a serverless distributed file system. In: Proceedings of IEEE International Conference on Distributed Computing Systems, pp. 617–624, Macau, China, June 2002Google Scholar
  8. 8.
    Dropbox: Dropbox. https://www.dropbox.com/, your stuff, anywhere
  9. 9.
    Google: Google drive. http://drive.google.com, all your files, ready where you are
  10. 10.
    Harnik, D., Pinkas, B., Shulman-Peleg, A.: Side channels in cloud services: deduplication in cloud storage. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 40–47. CA, USA, January 2010Google Scholar
  11. 11.
    Knuth, D.E.: Optimum binary search trees. J. Acta Inform. 1, 14–25 (1971)CrossRefzbMATHGoogle Scholar
  12. 12.
    Li, J., Chen, X., Li, M., Li, J., Lee, P., Lou, W.: Secure deduplication with efficient and reliable convergent key management. IEEE Trans. Parallel Distrib. Syst. 25, 1615–1625 (2013)CrossRefGoogle Scholar
  13. 13.
    Li, J., Chen, X., Li, M., Li, J., Lee, P.P.C., Lou, W.: A hybrid cloud approach for secure authorized deduplication. IEEE Trans. Parallel Distrib. Syst. 1–12 (2014)Google Scholar
  14. 14.
    Liu, J., Asokan, N., Pinkas, B.: Secure deduplication of encrypted data without additional independent servers. In: Proceedings of the ACM Conference on Computerand Communications Security, pp. 874–885. CO, USA, October 2015Google Scholar
  15. 15.
    Mehlhorn, K.: Nearly optimal binary search trees. J. Acta Inform. 5, 287–295 (1975)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Mulazzani, M., Schrittwieser, S., Leithner, M., Huber, M., Weippl, E.R.: Darkclouds on the horizon: using cloud storage as attack vector and online slackspace. In: Proceedings of USENIX Security Symposium, pp. 65–76. CA, USA, August 2011Google Scholar
  17. 17.
    NetApp: Netapp. http://www.netapp.com/us/products/platform-os/dedupe.aspx, universal Storage System
  18. 18.
    Reed, B.: The height of a random binary search tree. J. ACM 50, 306–332 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Stanek, J., Sorniotti, A., Androulaki, E., Kencl, L.: A secure data deduplication scheme for cloud storage. In: Proceedings of Financial Cryptography, pp. 99–118. CA, USA, March 2014Google Scholar
  20. 20.
    Yuan, J., Yu, S.: Secure and constant cost public cloud storage auditing with deduplication. In: Proceedings of IEEE Conference on Communications and Network Security, pp. 145–153, MD, USA, October 2013Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Tao Jiang
    • 1
    • 4
  • Xiaofeng Chen
    • 1
    Email author
  • Qianhong Wu
    • 2
  • Jianfeng Ma
    • 1
  • Willy Susilo
    • 3
  • Wenjing Lou
    • 4
  1. 1.State Key Laboratory of Integrated Service Networks (ISN)Xidian UniversityXi’anChina
  2. 2.School of Electronic and Information EngineeringBeihang UniversityBeijingChina
  3. 3.Centre for Computer and Information Security Research, School of Computing and Information TechnologyUniversity of WollongongWollongongAustralia
  4. 4.Department of Computer ScienceVirginia Polytechnic Institute and State UniversityBlacksburgUSA

Personalised recommendations