Privacy-Preserving Content-Based Publish/Subscribe Networks

  • Abdullatif Shikfa
  • Melek Önen
  • Refik Molva
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 297)

Abstract

Privacy and confidentiality are crucial issues in content-based publish/subscribe (CBPS) networks. We tackle the problem of end-user privacy in CBPS. This problem raises a challenging requirement for handling encrypted data for the purpose of routing based on protected content and encrypted subscription information. We suggest a solution based on a commutative multiple encryption scheme in order to allow brokers to operate in-network matching and content based routing without having access to the content of the packets. This is the first solution that avoids key sharing among end-users and targets an enhanced CBPS model where brokers can also be subscribers at the same time.

References

  1. 1.
    Agrawal, R., Evfimievski, A.V., Srikant, R.: Information sharing across private databases. In: SIGMOD Conference, pp. 86–97 (2003)Google Scholar
  2. 2.
    Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multiuser setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 259–274. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  3. 3.
    Birman, K.P.: The process group approach to reliable distributed computing. Commun. ACM 36(12), 37–53 (1993)CrossRefGoogle Scholar
  4. 4.
    Boneh, D., Di 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)CrossRefGoogle Scholar
  5. 5.
    Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and evaluation of a wide-area event notification service. ACM Trans. Comput. Syst. 19(3), 332–383 (2001)CrossRefGoogle Scholar
  6. 6.
    Chmielewski, L., Hoepman, J.-H.: Fuzzy private matching (extended abstract). In: ARES, pp. 327–334. IEEE Computer Society, Los Alamitos (2008)Google Scholar
  7. 7.
    Datta, A.K., Gradinariu, M., Raynal, M., Simon, G.: Anonymous publish/subscribe in p2p networks. In: IPDPS 2003: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, Washington, DC, USA. IEEE Computer Society, Los Alamitos (2003)Google Scholar
  8. 8.
    Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding routing information. In: Information Hiding, pp. 137–150. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  10. 10.
    Li, Y., Tygar, J., Hellerstein, J.M.: Private matching. IRB-TR-04-005 (February 2004)Google Scholar
  11. 11.
    Önen, M., Molva, R.: Secure data aggregation with multiple encryption. In: Langendoen, K.G., Voigt, T. (eds.) EWSN 2007. LNCS, vol. 4373, pp. 117–132. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Opyrchal, L., Prakash, A.: Secure distribution of events in content-based publish subscribe systems. In: SSYM 2001: Proceedings of the 10th conference on USENIX Security Symposium, Berkeley, CA, USA, pp. 21–21. USENIX Association (2001)Google Scholar
  13. 13.
    Opyrchal, L., Prakash, A., Agrawal, A.: Supporting privacy policies in a publish-subscribe substrate for pervasive environments. JNW, 17–26 (2007)Google Scholar
  14. 14.
    Pannetrat, A., Molva, R.: Multiple layer encryption for multicast groups. In: The proceedings of CMS 2002, Portoroz, Slovenia (September 2002)Google Scholar
  15. 15.
    Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory 24(1), 106–110 (1978)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Raiciu, C., Rosenblum, D.S.: Enabling confidentiality in content-based publish/subscribe infrastructures. In: Securecomm and Workshops, 2006, 28 2006-September 1 2006, pp. 1–11 (2006)Google Scholar
  17. 17.
    Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120–126 (1978)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 44–55 (2000)Google Scholar
  19. 19.
    Srivatsa, M., Liu, L.: Secure event dissemination in publish-subscribe networks. In: ICDCS 2007: Proceedings of the 27th International Conference on Distributed Computing Systems, Washington, DC, USA, p. 22. IEEE Computer Society, Los Alamitos (2007)Google Scholar
  20. 20.
    Wang, C., Carzaniga, A., Evans, D., Wolf, A.: Security issues and requirements for internet-scale publish-subscribe systems. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002). IEEE Computer Society, Los Alamitos (2002)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2009

Authors and Affiliations

  • Abdullatif Shikfa
    • 1
  • Melek Önen
    • 1
  • Refik Molva
    • 1
  1. 1.EURECOMFrance

Personalised recommendations