Efficient and confidentiality-preserving content- based publish/subscribe with prefiltering

IEEE Transactions on Dependable and Secure Computing

Volumn 14, Issue 3, 2017, Pages 308-325

  Barazzutti, Raphaël ^b   Felber, Pascal ^b   Mercier, Hugues ^b   Onica, Emanuel ^a   Rivière, Etienne ^b  

^a ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

^b UNIVERSITY OF NEUCHÂTEL   (Switzerland)

Author keywords

Bloom filters; Confidentiality; Encrypted processing; Publish subscribe; Security

Indexed keywords

BLOOMS (METAL); CRYPTOGRAPHY; DATA STRUCTURES; MIDDLEWARE; NETWORK SECURITY;

BLOOM FILTERS; CONFIDENTIALITY; EXPERIMENTAL EVALUATION; LARGE-SCALE DISTRIBUTED SYSTEM; PUBLISH/SUBSCRIBE; PUBLISH/SUBSCRIBE MIDDLEWARES; RANDOMIZATION TECHNIQUES; SECURITY;

PUBLISHING;

EID: 85021751604     PISSN: 15455971     EISSN: 19410018     Source Type: Journal    
DOI: 10.1109/TDSC.2015.2449831     Document Type: Article

References (38)

1. P. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec, "The many faces of publish/subscribe," ACM Comput. Surveys, vol. 35, no. 2, pp. 114-131, 2003.
2. R. P. Barazzutti, P. Felber, C. Fetzer, E. Onica, M. Pasin, J.-F. Pineau, E. Riviere, and S. Weigert, "StreamHub: A massively parallel architecture for high-performance content-based publish/subscribe," in Proc. 7th ACM Int. Conf. Distrib. Event-Based Syst., Jul. 2013, pp. 63-74.
3. T. Ristenpart, E. Tromer, H. Shacham, and S. Savage, "Hey, you, get off of my cloud: Exploring information leakage in third-party compute clouds," in Proc. 16th ACM Conf.comput.commun. Secur., 2009, pp. 199-212.
4. J. Somorovsky, M. Heiderich, M. Jensen, J. Schwenk, N. Gruschka, and L. Lo Iacono, "All your clouds are belong to us: Security analysis of cloud management interfaces," in Proc. 3rd ACM Workshop Cloud Comput. Secur. Workshop, 2011, pp. 3-14.
5. S. Liston, "The Cloud: Data protection and privacy-Whose cloud is it anyway?" in Proc. 12th Global Symp. Regulators, 2012, pp. 1-40.
6. S. Choi, G. Ghinita, and E. Bertino, "A privacy-enhancing contentbased publish/subscribe system using scalar product preserving transformations," in Proc. 21st Int. Conf. Database Expert Syst. Appl., vol. 6261, 2010, pp. 368-384.
7. W. K. Wong, D. W.-l. Cheung, B. Kao, and N. Mamoulis, "Secure kNN computation on encrypted databases," in Proc. 35th SIGMOD Int. Conf. Manage. Data, 2009, pp. 139-152.
8. C. Raiciu and D. S. Rosenblum, "Enabling confidentiality in content- based publish/subscribe infrastructures," in Proc. IEEE Securecomm, 2006, pp. 1-11.
9. A. Shikfa, M. Onen, and R. Molva, "Privacy-preserving contentbased publish/subscribe networks," in Proc. Emerging Challenges Security, Privacy Trust, 2009, pp. 270-282.
10. M. Nabeel, N. Shang, and E. Bertino, "Privacy-preserving filtering and covering in content-based publish subscribe systems," Purdue Univ., West Lafayette, Indiana, USA, Tech. Rep. 15, 2009.
11. M. Ion, G. Russello, and B. Crispo, "Supporting publication and subscription confidentiality in pub/sub networks," in Proc. 6th Int. ICST Conf. Security Privacy Commun. Netw., 2010, pp. 272-289.
12. J. Li, C. Lu, and W. Shi, "An efficient scheme for preserving confidentiality in content-based publish-subscribe systems," College of Comput., Georgia Instit. Technol., Tech. Rep. GIT-CC-04-01, 2004.
13. H. Jafarpour, S. Mehrotra, N. Venkatasubramanian, and M. Montanari, "MICS: An efficient content space representation model for publish/subscribe systems," in Proc. 3rd ACM Int. Conf. Distrib. Event-Based Syst., 2009, pp. 1-12.
14. A. Carzaniga, D. S. Rosenblum, and A. L. Wolf, "Design and evaluation of a wide-area event notification service," ACM Trans.comput. Syst., vol. 19, no. 3, pp. 332-383, 2001.
15. H.-A. Jacobsen, A. K. Y. Cheung, G. Li, B. Maniymaran, V. Muthusamy, and R. S. Kazemzadeh, "The PADRES publish/subscribe system," in Handbook of Research on Advanced Distributed Event-Based Systems, Publish/Subscribe and Message Filtering Technologies, IGI Global, pp. 164-205, 2010.
16. R. Barazzutti, P. Felber, H. Mercier, E. Onica, and E. Riviere, "Thrifty privacy: Efficient support for privacy-preserving publish/subscribe," in Proc. 6th ACM Int. Conf. Distrib. Event-Based Syst., 2012, pp. 225-236.
17. H. Mercier, E. Onica, E. Rivière, and P. Felber, "Performance/appurity tradeoffs for content-based routing supported by Bloom filters," in Proc. 20th Int. Colloquium Structural Inf.commun.complexity, Jul. 2013, pp. 129-140.
18. A. Inan, M. Kantarcioglu, E. Bertino, and M. Scannapieco, "A hybrid approach to private record linkage," in Proc. IEEE 30th Int. Conf. Data Eng., 2008, pp. 496-505.
19. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Commn. ACM, vol. 13, no. 7, pp. 422-426, 1970.
20. M. Bellare, R. Canetti, and H. Krawczyk, "Keying hash functions for message authentication," in Proc. 16th Annu. Int. Cryptol. Conf. Adv. Cryptol., 1996, pp. 1-15.
21. A. T. Sherman and D. A. McGrew, "Key establishment in large dynamic groups using one-way function trees," IEEE Trans. Softw. Eng., vol. 29, no. 5, pp. 444-458, May 2003.
22. J. Bacon, D. M. Eyers, J. Singh, and P. R. Pietzuch, "Access control in publish/subscribe systems," in Proc. 2nd Int. Conf. Distrib. Event-Based Syst., 2008, pp. 23-34.
23. E. Shi, J. Bethencourt, T.-H. H. Chan, D. Song, and A. Perrig, "Multi-dimensional range query over encrypted data," in Proc. IEEE Symp. Security Privacy, 2007, pp. 350-364.
24. G. E. Andrews, The Theory of Partitions. Cambridge Mathematical Library, Cambridge University Press, Cambridge, UK, 1998.
25. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, 2nd ed. Reading, MA, USA: Addison-Wesley, 1994.
26. A. Gupta, O. D. Sahin, D. Agrawal, and A. E. Abbadi, "Meghdoot: Content-based publish/subscribe over p2p networks," in Proc. 5th ACM/IFIP/USENIX Int. Conf. Middleware, 2004, pp. 254-273.
27. M. E. J. Newman, "Power laws, Pareto distributions and Zipf's law," Contemporary Phys., vol. 46, pp. 323-351, 2005.
28. M. Ion, G. Russello, and B. Crispo, "An implementation of event and filter confidentiality in pub/sub systems and its application to e-health," in Proc. 17th ACM Conf.comput.commun. Security, 2010, pp. 696-698.
29. F. Kerschbaum, "Public-key encrypted Bloom filters with applications to supply chain integrity," in Proc. Data Appl. Security Privacy XXV, 2011, vol. 6818, pp. 60-75.
30. A. Shikfa, M. Onen, and R. Molva, "Broker-based private matching," in Proc. 11th Int. Conf. Privacy Enhancing Technol., 2011, pp. 264-284.
31. H. Perl, Y. Mohammed, M. Brenner, and M. Smith, "Fast confidential search for bio-medical data using Bloom filters and homomorphic cryptography," in Proc. IEEE 8th Int. Conf. E-Sci., 2012, pp. 1-8.
32. E.-J. Goh, "Secure indexes," Cryptology ePrint Archive, p. 216, 2003.
33. S. M. Bellovin and W. R. Cheswick, "Privacy-enhanced searches using encrypted Bloom filters," Cryptology ePrint Archive, p. 22, 2004.
34. M. Kuzu, M. Kantarcioglu, E. Durham, and B. Malin, "A constraint satisfaction cryptanalysis of Bloom filters in private record linkage," in Proc. 11th Int. Conf. Privacy Enhancing Technol., 2011, vol. 6794, pp. 226-245.
35. S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, "Theory and practice of Bloom filters for distributed systems," IEEE Commun. Surv. Tuts, vol. 14, no. 1, pp. 131-155, Jan.-Mar. 2012.
36. Z. Jerzak and C. Fetzer, "Bloom filter based routing for contentbased publish/subscribe," in Proc. 2nd Int. Conf. Distrib. Event- Based Syst., 2008, pp. 71-81.
37. R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan, "CryptDB: Protecting confidentiality with encrypted query processing," in Proc. 23rd ACM Symp. Oper. Syst. Principles, 2011, pp. 85-100.
38. M. Kurpicz, "Towards efficient privacy-preserving SQL processing in untrusted clouds," Master's thesis, University of Neuchatel, Neuchatel, Switzerland, Jul. 2013.