• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Symposium on Mass Storage Systems and Technologies >Percival: A searchable secret-split datastore
【24h】

Percival: A searchable secret-split datastore

机译：Percival：一个可搜索的秘密拆分数据存储

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Maintaining information privacy is challenging when sharing data across a distributed long-term datastore. In such applications, secret splitting the data across independent sites has been shown to be a superior alternative to fixed-key encryption; it improves reliability, reduces the risk of insider threat, and removes the issues surrounding key management. However, the inherent security of such a datastore normally precludes it from being directly searched without reassembling the data; this, however, is neither computationally feasible nor without risk since reassembly introduces a single point of compromise. As a result, the secret-split data must be pre-indexed in some way in order to facilitate searching. Previously, fixed-key encryption has also been used to securely pre-index the data, but in addition to key management issues, it is not well suited for long term applications. To meet these needs, we have developed Percival: a novel system that enables searching a secret-split datastore while maintaining information privacy. We leverage salted hashing, performed within hardware security modules, to access prerecorded queries that have been secret split and stored in a distributed environment; this keeps the bulk of the work on each client, and the data custodians blinded to both the contents of a query as well as its results. Furthermore, Percival does not rely on the datastore's exact implementation. The result is a flexible design that can be applied to both new and existing secret-split datastores. When testing Percival on a corpus of approximately one million files, it was found that the average search operation completed in less than one second.
机译：维护信息隐私是在一个分布式的长期数据存储共享数据时挑战。在这种应用中，秘密分割跨独立站点数据已被证明是固定密钥加密一个更好的选择;它提高了可靠性，减少了内部威胁的风险，并消除周围的密钥管理问题。然而，这样的数据存储区的固有安全性，通常被直接搜索的没有重新组装数据排除它;然而，这既不是计算上可行，也没有风险，因为重组引入折衷的一个单点。其结果是，秘密分割数据必须预先建立索引以某种方式，以便于搜索。此前，固定密钥加密也被用于安全地预索引的数据，但除了主要的管理问题，它并不完全适合长期应用。为了满足这些需求，我们开发了珀西瓦尔：一个新的系统，使搜索秘密分割数据存储，同时保持信息的私密性。我们利用盐渍哈希内的硬件安全模块来执行对已秘密分割并存储在分布式环境中获得预先录制的查询;这保持散装每个客户端上的工作，并蒙蔽查询的两个内容以及其结果的数据托管。此外，珀西瓦尔不依赖于数据存储的具体实现。其结果是一个灵活的设计，可以适用于新的和现有的秘密分割数据存储。当约一百万个文件语料测试波斯富街，发现平均搜索操作在不到一秒钟完成。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号