Practical Techniques for Querying over Encrypted Character String Based on B* Tree Cluster Index
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To improve the performance of querying over encrypted character string in database, this paper proposes a method that creating B* tree cluster index base on index characteristic code. Every encrypted data has an index characteristic code which store in an index filed as index. When querying the encrypted character data, applies the principle of two_phase query. In the first place, make use of index characteristic code to filter the records which is not related to the querying condition. Secondly, decrypt the rest records and take advantage of plaintext querying condition to get the final records. Results of experiments validate the performance of our method compared with exsiting ways at present.

    Reference
    Related
    Cited by
Get Citation

刘洁.基于B*树聚簇索引的加密字符串查询方法.计算机系统应用,2013,22(6):91-94

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:November 04,2012
  • Revised:December 17,2012
  • Adopted:
  • Online: July 25,2013
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063