• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Apperceiving Computing and Intelligence Analysis (ICACIA 2009) >Fast query over encrypted data based on B+ tree
【24h】

Fast query over encrypted data based on B+ tree

机译：基于B + 树的加密数据快速查询

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

摘要

There are a lot of important and sensitive data in databases, which need to be protected from attacks. To secure the data, Cryptography support is an effective mechanism. However, a tradeoff must be made between the performance and the security because encryption and decryption greatly degrade the query performance. In this paper, a framework is proposed that can quickly implement query over encrypted data based on B+ tree. When data are stored in the form of cipher, it not only stores the encrypted data themselves, but also creates a B+ tree index for the data before encrypting them. When querying the encrypted data, firstly, it locates the encrypted records related to the querying predicate based on the B+ tree index; secondly, it decrypts the encrypted records to accomplish the results. Meanwhile, it must encrypt the B+ tree itself to protect it from leaking confidential information. According to the structure of the B+ tree, it encrypts each node of the B+ tree separately. The results of experiments show that the query performance over the encrypted data decreases about 20 percent compared with the plaintext query performance, and validate the functionality and usability of our approach.
机译：数据库中有许多重要且敏感的数据，需要加以保护以免受到攻击。为了保护数据，密码学支持是一种有效的机制。但是，必须在性能和安全性之间进行权衡，因为加密和解密会大大降低查询性能。本文提出了一种可以基于B + 树对加密数据进行快速查询的框架。当数据以密码形式存储时，它不仅会存储加密的数据本身，而且还会在加密数据之前为数据创建B + 树索引。查询加密数据时，首先根据B + 树索引查找与查询谓词相关的加密记录。其次，它将加密的记录解密以完成结果。同时，它必须对B + 树本身进行加密，以防止其泄露机密信息。根据B + 树的结构，它分别加密B + 树的每个节点。实验结果表明，与纯文本查询性能相比，对加密数据的查询性能降低了约20％，并验证了我们方法的功能性和可用性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号