Scalable Blind Matching: An Efficient Ciphertext Matching Scheme for Content-Based Pub/Sub Cloud Services

摘要

Content-based publish/subscribe cloud services are prevailing recently. Confidentiality in publish/subscribe cloud services has become a major concern, especially for applications with sensitive data. Many methods have been proposed to achieve the confidentiality of events and subscriptions. Unfortunately, all these approaches suffer significant performance deterioration while matching on large-scale subscription set. In this paper, we propose an efficient ciphertext matching scheme called SBM. To the best of our knowledge, SBM is the first approach which can preserve confidentiality while at the same time provide scalable event matching. Furthermore, we have integrated SBM with an open source publish/subscribe middleware, PADRES and conducted extensive experiments to evaluate our scheme. The experimental results demonstrate that the matching speed of our solution is faster by two orders of magnitude than its counterparts.