• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on dependable and secure computing >Efficient and Confidentiality-Preserving Content-Based Publish/Subscribe with Prefiltering
【24h】

Efficient and Confidentiality-Preserving Content-Based Publish/Subscribe with Prefiltering

机译：高效且保密的带有预过滤功能的基于内容的发布/订阅

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Content-based publish/subscribe provides a loosely-coupled and expressive form of communication for large-scale distributed systems. Confidentiality is a major challenge for publish/subscribe middleware deployed over multiple administrative domains. Encrypted matching allows confidentiality-preserving content-based filtering but has high performance overheads. It may also prevent the use of classical optimizations based on subscriptions containment. We propose a support mechanism that reduces the cost of encrypted matching, in the form of a prefiltering operator using Bloom filters and simple randomization techniques. This operator greatly reduces the amount of encrypted subscriptions that must be matched against incoming encrypted publications. It leverages subscription containment information when available, but also ensures that containment confidentiality is preserved otherwise. We propose containment obfuscation techniques and provide a rigorous security analysis of the information leaked by Bloom filters in this case. We conduct a thorough experimental evaluation of prefiltering under a large variety of workloads. Our results indicate that prefiltering is successful at reducing the space of subscriptions to be tested in all cases. We show that while there is a tradeoff between prefiltering efficiency and information leakage when using containment obfuscation, it is practically possible to obtain good prefiltering performance while securing the technique against potential leakages.
机译：基于内容的发布/订阅为大型分布式系统提供了一种松耦合的表达方式。对于发布/订阅跨多个管理域部署的中间件，机密性是一个主要挑战。加密匹配允许保留基于内容的机密性，但具有较高的性能开销。它还可能会阻止使用基于订阅包含的经典优化。我们提出一种支持机制，以使用布隆过滤器和简单随机化技术的预过滤算子的形式来减少加密匹配的成本。该运算符大大减少了必须与传入的加密出版物匹配的加密订阅的数量。它在可用时利用订阅包含信息，但也确保以其他方式保留包含机密性。在这种情况下，我们提出了密闭混淆技术，并对Bloom过滤器泄漏的信息进行了严格的安全性分析。我们对各种各样的工作负载下的预过滤进行了全面的实验评估。我们的结果表明，在所有情况下，预过滤都能成功减少要测试的订阅空间。我们表明，尽管在使用密闭模糊处理时要在预过滤效率和信息泄漏之间进行权衡，但实际上有可能获得良好的预过滤性能，同时又要确保该技术避免潜在的泄漏。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号