Advertisement

Implementing Searchable Encryption Schemes over Multilinear Maps

  • Victor-Mihai TalifEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11359)

Abstract

We generalize known searchable encryption schemes [8] to N-party contexts using constructions based on multilinear maps. The span of the maps used is also expanded, as the schemes we propose can make use of both prime order and composite order group contexts.

References

  1. 1.
    Albrecht, M.R., Farshim, P., Hofheinz, D., Larraia, E., Paterson, K.G.: Multilinear maps from obfuscation. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 446–473. Springer, Heidelberg (2016).  https://doi.org/10.1007/978-3-662-49096-9_19CrossRefGoogle Scholar
  2. 2.
    Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1–18. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44647-8_1CrossRefGoogle Scholar
  3. 3.
    Boneh, D.: The decision Diffie-Hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998).  https://doi.org/10.1007/BFb0054851CrossRefGoogle Scholar
  4. 4.
    Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535–554. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-70936-7_29CrossRefGoogle Scholar
  5. 5.
    Freire, E.S.V., Hofheinz, D., Kiltz, E., Paterson, K.G.: Non-interactive key exchange. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 254–271. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-36362-7_17CrossRefzbMATHGoogle Scholar
  6. 6.
    Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1–17. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-38348-9_1CrossRefGoogle Scholar
  7. 7.
    Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882–929 (2016)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Iovino, V., Persiano, G.: Hidden-vector encryption with groups of prime order. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 75–88. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-85538-5_5CrossRefGoogle Scholar
  9. 9.
    Van Rompay, C., Molva, R., Önen, M.: Secure and scalable multi-user searchable encryption. In: Proceedings of the 6th International Workshop on Security in Cloud Computing, pp. 15–25. ACM (2018)Google Scholar
  10. 10.
    Wang, Y., Wang, J., Chen, X.: Secure searchable encryption: a survey. J. Commun. Inf. Netw. 1(4), 52–65 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer ScienceAlexandru Ioan Cuza University of IașiIașiRomania

Personalised recommendations