Dissertation > Excellent graduate degree dissertation topics show

Index-based encryption of database queries

Author: LeiChunHong
Tutor: YuJianQiao
School: Southwestern University
Course: Computer Software and Theory
Keywords: B~+ tree index of cipher-text single-value queries range queries binary search
CLC: TP311.13
Type: Master's thesis
Year: 2010
Downloads: 79
Quote: 2
Read: Download Dissertation

Abstract


Data encryption is an important measure to ensure confidentiality of important data. It is a difficult problem that how to query the encrypt database data efficiently.To enhance query performance of the encrypted database, a new type of B+tree index is designed for it. It makes a single index node can hold any number of keyword by using a cipher-text block array to organize the encrypted keywords,thus breaking the limit on number of keywords in the index node by the encryption length. In the index node, keywords are encrypted and stored separately with pointers. So what a cipher-text block holds are all keywords or pointers. This can increase the effective rate of keywords in a cipher-text block, reduce the length of the keyword array. Reducing the length of the keyword array can speed up the query, lead to less decryption. To support the range query, a prior-pointer and a next-pointer are added in the leaf node, pointing to the adjacent front leaf node and the next adjacent leaf node, so from a leaf node it is easy to find all the front and all the back leaf nodes of it.To speed up search on the cipher-text block array of keywords, binary search algorithms are designed for single-value queries and range queries on cipher-text block array. Binary search algorithm for single-value queries on cipher-text block array is based on the characteristics of the cipher-text block array and regards a block cipher as a single value, but in the query process it must check all the values of the cipher-text block. This would reduce the amount of cipher-text block to be decrypt. Binary search algorithm for range queries on cipher-text block also regards a block cipher as a single value. But what the algorithm looks for on the leaf node is the boundary keyword that satisfies the query. The ultimate query results are the pointer corresponding to the boundary keyword and all the left (or right) pointers of it, and all the pointers in the leaf nodes on the left (or right) of the leaf node being search on. By the prior-pointers and the next-pointers in the leaf nodes, you can find all the leaf nodes satisfying the query. So scope queries on the encrypted database are realized, which contain operators such as<,≤,>,≥. Binary search algorithms on cipher-text block array solve problems in these situations that query value is less than the first keyword of a cipher-text block, more than the last keyword of a cipher-text block, between blocks and between the two adjacent leaf nodes. The algorithms also resole the problem that keywords have different semantics in different nodes such as the root node, branch nodes, leaf nodes. Meanwhile, by using this index, it can be easy to get the maximum, the minimum of all records.Simulation results show that block binary search on the cipher-text array need much less amount of decryption, and return the answer more quickly than sequential search.

Related Dissertations

  1. Research on the Complete Coverage Path Planning Algorithm of Mobile Robot,TP242
  2. A Fault Location Algorithms Based on Two-terminal Data for Hybrid Transmission Lines,TM755
  3. Structured P2P network complex query mechanism,TP393.02
  4. Research of a New Dictionary in the Search Engine,TP391.1
  5. Research and Implementation of Network Topology Discovery Algorithms,TP393.02
  6. Research on the Technology of a Binary Search-Based Search Engine,TP391.3
  7. Seeing the Equitable Colorings in a Different View,O157.5
  8. Ministry of Public Security Investigations Data Warehouse and Data Mining Construction,TP311.13
  9. Study of Mine Personnel Tracking and Orientation System Based on Binary Search Algorithm,TP29-A1
  10. Radio frequency identification system anti-collision algorithm,TP391.44
  11. Study on Anti-collision Algorithm of Multi-slotted with Assigned Slots Based on ALOHA,TP391.44
  12. Implement of the RFID Reader and Study of Anti-collision Algorithms,TP368.12
  13. Study on the Key Technology of RFID,TP391.44
  14. Some Strong Limit Properties in Binary Search Trees,O157.5
  15. Research of the Key Questions of RFID System,TP391.44
  16. Topology-Aware Overlay Network Based on RAQ,TP393.02
  17. RFID dynamic information processing strategy,TP391.44
  18. Wireless authentication system and anti- collision algorithm,TN918.6
  19. Research on the Object-Orientation-Based Direction Relation Query in Three-Dimensional Space,TP311.131
  20. Research on the Improvement of Association Rules Mining Algorithm and Its Application,TP311.13

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Computer software > Program design,software engineering > Programming > Database theory and systems
© 2012 www.DissertationTopic.Net  Mobile