Towards Efficient and Secure Encrypted Databases: Extending Message-Locked Encryption in Three-Party Model

  • Yuuji FurutaEmail author
  • Naoto Yanai
  • Masashi Karasaki
  • Katsuhiko Eguchi
  • Yasunori Ishihara
  • Toru Fujiwara
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10436)


In database systems with three parties consisting of a data owner, a database manager and a data analyst, the data owner uploads encrypted data to a database and the data analyst delegated by the data owner analyzes the data by accessing to the database without knowing plaintexts. In this work, towards an efficient and secure scheme whose encryption can be processed in real time, we extend message-locked encryption (Bellare et al. [2]), where parts of ciphertexts are generated from their plaintexts deterministically. In particular, we introduce both delegations of relational search between ciphertexts from a data owner to a data analyst, and re-encryption of ciphertexts such that ciphertexts of the message-locked encryption become truly probabilistic against a database manager. We call the scheme message-locked encryption with re-encryption and relational search, and formalize the security, which is feasible and practical, in two cases, i.e., any relationship in a general setting and only an equality test in a restricted setting. Both settings are useful from a standpoint of trade-offs between the security and the efficiency. We also propose an instantiation with the equality test between ciphertexts.


Message-locked encryption Encrypted database Re-encryption Relational search Three-party model 



We would like to thank Taisuke Yamauchi in NIPPON TELEGRAPH AND TELEPHONE WEST CORPORATION for his support.


  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. LNCS, vol. 8042, pp. 374–391. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-40041-4_21CrossRefGoogle Scholar
  2. 2.
    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). doi: 10.1007/978-3-642-38348-9_18CrossRefGoogle Scholar
  3. 3.
    Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998). doi: 10.1007/BFb0055718CrossRefGoogle Scholar
  4. 4.
    Boneh, D., Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 506–522. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24676-3_30CrossRefGoogle Scholar
  5. 5.
    Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253–273. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-19571-6_16CrossRefGoogle Scholar
  6. 6.
    Chen, R., Mu, Y., Yang, G., Guo, F.: BL-MLE: block-level message-locked encryption for secure large file deduplication. IEEE Trans. Inf. Forensics Secur. 10(12), 2643–2652 (2015)CrossRefGoogle Scholar
  7. 7.
    Gentry, C.: Fully homomorphic encryption using ideal lattice. In: Proceedings of STOC 1999, pp. 169–178. ACM (2009)Google Scholar
  8. 8.
    Jiang, T., Chen, X., Wu, Q., Ma, J., Susilo, W., Lou, W.: Towards efficient fully randomized message-locked encryption. In: Liu, J.K.K., Steinfeld, R. (eds.) ACISP 2016. LNCS, vol. 9722, pp. 361–375. Springer, Cham (2016). doi: 10.1007/978-3-319-40253-6_22CrossRefGoogle Scholar
  9. 9.
    Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258–274. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-39884-1_22CrossRefGoogle Scholar
  10. 10.
    Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman and Hall/Crc Cryptography and Network Security Series, pp. 82–104. Chapman and Hall/CRC, Boca Ration (2007)zbMATHGoogle Scholar
  11. 11.
    Lei, L., Cai, Q., Chen, B., Lin, J.: Towards efficient re-encryption for secure client-side deduplication in public clouds. In: Lam, K.-Y., Chi, C.-H., Qing, S. (eds.) ICICS 2016. LNCS, vol. 9977, pp. 71–84. Springer, Cham (2016). doi: 10.1007/978-3-319-50011-9_6CrossRefGoogle Scholar
  12. 12.
    Li, J., Qin, C., Lee, P.P.C., Li, J.: Rekeying for encrypted deduplication storage. In: Proceedings of DSN 2016, pp. 618–629. IEEE (2016)Google Scholar
  13. 13.
    Naveed, M., Prabhakaran, M., Gunter, C.A.: Dynamic searchable encryption via blind storage. In: Proceedings of IEEE S&P, pp. 639–654. IEEE (2014)Google Scholar
  14. 14.
    Ogata, W., Koiwa, K., Kanaoka, A., Matsuo, S.: Toward practical searchable symmetric encryption. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 151–167. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-41383-4_10CrossRefGoogle Scholar
  15. 15.
    Okamoto, T., Takashima, K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 191–208. Springer, Heidelberg (2010). doi: 10.1007/978-3-642-14623-7_11CrossRefGoogle Scholar
  16. 16.
    Rogaway, P., Bellare, M., Black, J., Krovetz, T.: OCB: a block-cipher mode of operation for efficient authenticated encryption. In: Proceedings of ACM CCS 2001, pp. 196–205. ACM (2001)Google Scholar
  17. 17.
    Shi, E., Chan, T.-H.H., Rieffel, E.G., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: Proceedings of NDSS 2011 (2011)Google Scholar
  18. 18.
    Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of IEEE S&P 2000, pp. 44–55. IEEE (2000)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Yuuji Furuta
    • 1
    Email author
  • Naoto Yanai
    • 1
  • Masashi Karasaki
    • 2
  • Katsuhiko Eguchi
    • 2
  • Yasunori Ishihara
    • 1
  • Toru Fujiwara
    • 1
  1. 1.Osaka UniversitySuitaJapan
  2. 2.Nippon Telegraph and Telephone West CorporationChuo-kuJapan

Personalised recommendations