• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Encrypted Search: Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents.
【24h】

Encrypted Search: Enabling Standard Information Retrieval Techniques for Several New Secure Index Types While Preserving Confidentiality Against an Adversary With Access to Query Histories and Secure Index Contents.

机译：加密搜索：为几种新的安全索引类型启用标准信息检索技术，同时通过访问查询历史记录和安全索引内容来保持对对手的机密性。

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

摘要

Encrypted Search is a way for a client to store searchable documents on untrusted systems such that the untrusted system can obliviously search the documents on the client's behalf, i.e., the untrusted system does not know what the client is searching for nor what the documents contain. Several new secure index types (which enable Encrypted Search functionality) are designed and implemented, and then compared against each other and against the more typical Bloom filter-based secure index. We compare them with respect to several performance measures: time complexity, space complexity, and retrieval accuracy with respect to two rank-ordered search heuristics, MinDist* and BM25. In order to support these search heuristics, the secure indexes must store frequency and proximity information. We investigate the risk this poses to confidentiality and explore ways to mitigate said risk. Finally, we analyze the effect the false positive rate and secure index poisoning techniques have on both confidentiality and performance. Separately, we also simulate an adversary who has access to a history of hidden (encrypted) queries and design techniques that demonstrably mitigate the risk posed by this adversary, e.g., query obfuscation, without adversely effecting retrieval accuracy.
机译：加密搜索是客户端将可搜索文档存储在不可信系统上的一种方式，以便不可信系统可以明显地代表客户端搜索文档，即不可信系统不知道客户端在搜索什么或文档中包含什么内容。设计并实现了几种新的安全索引类型（启用了加密搜索功能），然后相互比较，并与更典型的基于Bloom筛选器的安全索引进行比较。我们将它们与几种性能指标进行比较：时间复杂度，空间复杂度以及相对于两种排名搜索启发式MinDist *和BM25的检索准确性。为了支持这些搜索试探法，安全索引必须存储频率和接近度信息。我们调查对机密性构成的风险，并探索减轻风险的方法。最后，我们分析了误报率和安全索引中毒技术对机密性和性能的影响。另外，我们还模拟了一个访问者，该访问者可以访问隐藏（加密）查询的历史记录和设计技术，这些技术可以明显减轻该对手造成的风险（例如查询混淆），而又不会对检索准确性产生不利影响。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号