Privacy preserving SQL queries

Hyun A. Park, Justin Zhan, Dong Hoon Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

One of the most substantial ways to protect sensitive information is encryption of data. However, the crypto-graphic method brings in some problems such as inefficiency and malfunctioning, especially impossibility of arithmetic. The previous works in this area have been proved insecure or can provide only a few or several SQL queries. Actually, there is no scheme which can support secure all kinds of SQL queries and arithmetic. We propose a novel scheme to solve this problem. We do not encrypt every data itself but permute all the data within each attribute so that we can break the relation of the data and the owner. Accordingly, the proposed scheme guarantees intractability of re-identification for data-owners' privacy and at the same time enables the miner to get the information he wants.

Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Information Security and Assurance, ISA 2008
Pages549-554
Number of pages6
DOIs
Publication statusPublished - 2008 Sep 15
Event2nd International Conference on Information Security and Assurance, ISA 2008 - Busan, Korea, Republic of
Duration: 2008 Apr 242008 Apr 26

Other

Other2nd International Conference on Information Security and Assurance, ISA 2008
CountryKorea, Republic of
CityBusan
Period08/4/2408/4/26

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems and Management
  • Electrical and Electronic Engineering
  • Communication

Cite this

Park, H. A., Zhan, J., & Lee, D. H. (2008). Privacy preserving SQL queries. In Proceedings of the 2nd International Conference on Information Security and Assurance, ISA 2008 (pp. 549-554). [4511626] https://doi.org/10.1109/ISA.2008.40