An Overview of Partial Shuffle for Database Access Pattern Protection Using Reverse Encryption Algorithm

Abstract

Encryption of database is an important topic for research, as secure and efficient encryption algorithms are needed that provide the ability to query over encrypted database and allow optimized encryption and decryption of data. There is always a compromise between the degree of security provided by encryption algorithm and the efficient querying on the database, because the encryption and decryption on database greatly degrade query performance. For this, we propose a new encryption algorithm; Reverse Encryption Algorithm (REA). REA is simple and fast enough for most applications. REA provides maximum security and limits the added time cost for encryption and decryption to as to not degrade the performance of a database system. Privacy protection is one of the fundamental security requirements for database outsourcing. A major threat is information leakage from database access patterns generated by query executions. Recent works propose to protect access patterns by introducing a trusted component with constant storage size. The resulting privacy assurance is as strong as PIR, though with O(1) online computation cost, they still have O(n) amortized cost per query due to periodically full database shuffles. In this wok, we design a novel scheme in the same model with provable security, which only shuffles a portion of the database.

Authors and Affiliations

Priti V. Bhagat , Rohit Singhal

Keywords

Related Articles

An Unique Data mining Task for Sorting: Data Preprocessing for efficient External Sorting  

This paper presents external sorting using data preprocessing which is a data mining technique that adapted generally here. Generally, huge data of any organization possess data redundancy, noise and data inconsi...

Anomaly Detection and Prevention in Network Traffic based on Statistical approach and α-Stable Model  

Network traffic anomalies plunk for a huge division of the Internet traffic and conciliation the performance of the network resources. Detecting and diagnosing these threats is a protracted and time overriding ta...

A Survey on Multi-Focus ImageFusion Methods  

Abstract—Thispaper deals with various Multi-Focus Image Fusion Techniques in image processing.It is based on the perspective that the blurred image looks peculiar because of the degradation of high frequency informat...

Dynamic Pattern Matching: Efficient Pattern Matching using Data Preprocessing with help of One time look indexing method 

There are various pattern matching algorithms which take more comparisons in finding a given pattern in the text and are static and restrictive. In order to search pattern or substring of a pattern in the text wi...

Open-Source Network Simulation Tools: An Overview

In the network research area, implementation of a whole network in real world is not easily possible because establishing of network in a real world is very difficult. A single test bed containing multiple networked comp...

Download PDF file
  • EP ID EP115205
  • DOI -
  • Views 93
  • Downloads 0

How To Cite

Priti V. Bhagat, Rohit Singhal (2013). An Overview of Partial Shuffle for Database Access Pattern Protection Using Reverse Encryption Algorithm. International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(5), 1670-1673. https://europub.co.uk/articles/-A-115205