On the privacy protection in publish/subscribe systems

In a publish/subscribe (pub/sub) system, information (referred to as events) published by publishers and interests submitted by subscribers are sent to the network, which conducts matching between events and interests, and only delivers those events satisfying the interests. When the pub/sub infrastructure is untrusted, it is often desirable to keep both events and interests secret from the pub/sub network. In this paper, we formulate this goal as the private subscription problem. We then describe cryptographic schemes to solve this problem in some types of publish/subscribe systems. The algorithms we present are efficient in that they are based on symmetric encryptions requiring O(n) cipher operations for a message of length n.

[1]  Guruduth Banavar,et al.  Gryphon: An Information Flow Based Approach to Message Brokering , 1998, ArXiv.

[2]  Moni Naor,et al.  Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..

[3]  Yuval Ishai,et al.  Improved upper bounds on information-theoretic private information retrieval (extended abstract) , 1999, STOC '99.

[4]  José A. B. Fortes,et al.  Transnational digital government research: building regional partnerships , 2003 .

[5]  Dawn Xiaodong Song,et al.  Practical techniques for searches on encrypted data , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[6]  Rafail Ostrovsky,et al.  Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[7]  Rafail Ostrovsky,et al.  Universal service-providers for database private information retrieval (extended abstract) , 1998, PODC '98.

[8]  Taiichi Saito,et al.  Private Information Retrieval Based on the Subgroup Membership Problem , 2001, ACISP.

[9]  Donald F. Towsley,et al.  SANDS: Specialized Active Networking for Distributed Simulation , 2002, Proceedings DARPA Active Networks Conference and Exposition.

[10]  Silvio Micali,et al.  Computationally Private Information Retrieval with Polylogarithmic Communication , 1999, EUROCRYPT.

[11]  Elaine Shi,et al.  Multi-Dimensional Range Query over Encrypted Data , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

[12]  Eyal Kushilevitz,et al.  Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Rafail Ostrovsky,et al.  Replication is not needed: single database, computationally-private information retrieval , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[15]  Alexander L. Wolf,et al.  Security issues and requirements for Internet-scale publish-subscribe systems , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[16]  Niv Gilboa,et al.  Computationally private information retrieval (extended abstract) , 1997, STOC '97.

[17]  Yuval Ishai,et al.  Improved upper bounds on information-theoretic private information retrieval , 1999, STOC 1999.

[18]  Herman Lam,et al.  Event and rule services for achieving a Web-based knowledge network , 2004, Knowl. Based Syst..

[19]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[20]  Donald F. Towsley,et al.  Matchmaker: signaling for dynamic publish/subscribe applications , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..