loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Hasan Kadhem ; Toshiyuki Amagasa and Hiroyuki Kitagawa

Affiliation: University of Tsukuba, Japan

ISBN: 978-989-8425-30-0

Keyword(s): Order preserving encryption, Known plaintext attack, Statistical attack.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Information Security ; Knowledge Management and Information Sharing ; Knowledge-Based Systems ; Symbolic Systems

Abstract: Encryption is a well-studied technique for protecting the confidentiality of sensitive data. However, encrypting relational databases affects the performance during query processing. Preserving the order of the encrypted values is a useful technique to perform queries over the encrypted database with a reasonable overhead. Unfortunately, the existing order preserving encryption schemes are not secure against known plaintext attacks and statistical attacks. In those attacks, it is assumed that the attacker has prior knowledge about plaintext values or statistical information on the plaintext domain. This paper presents a novel database encryption scheme called MV-POPES (Multivalued - Partial Order Preserving Encryption Scheme), which allows privacy-preserving queries over encrypted databases with an improved security level. Our idea is to divide the plaintext domain into many partitions and randomize them in the encrypted domain. Then, one integer value is encrypted to different multip le values to prevent statistical attacks. At the same time, MV-POPES preserves the order of the integer values within the partitions to allow comparison operations to be directly applied on encrypted data. Our scheme is robust against known plaintext attacks and statistical attacks. MV-POPES experiments show that security for sensitive data can be achieved with reasonable overhead, establishing the practicability of the scheme. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.162.159.33

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Kadhem H., Amagasa T. and Kitagawa H. (2010). A SECURE AND EFFICIENT ORDER PRESERVING ENCRYPTION SCHEME FOR RELATIONAL DATABASES.In Proceedings of the International Conference on Knowledge Management and Information Sharing - Volume 1: KMIS, (IC3K 2010) ISBN 978-989-8425-30-0, pages 25-35. DOI: 10.5220/0003095700250035

@conference{kmis10,
author={Hasan Kadhem and Toshiyuki Amagasa and Hiroyuki Kitagawa},
title={A SECURE AND EFFICIENT ORDER PRESERVING ENCRYPTION SCHEME FOR RELATIONAL DATABASES},
booktitle={Proceedings of the International Conference on Knowledge Management and Information Sharing - Volume 1: KMIS, (IC3K 2010)},
year={2010},
pages={25-35},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003095700250035},
isbn={978-989-8425-30-0},
}

TY - CONF

JO - Proceedings of the International Conference on Knowledge Management and Information Sharing - Volume 1: KMIS, (IC3K 2010)
TI - A SECURE AND EFFICIENT ORDER PRESERVING ENCRYPTION SCHEME FOR RELATIONAL DATABASES
SN - 978-989-8425-30-0
AU - Kadhem H.
AU - Amagasa T.
AU - Kitagawa H.
PY - 2010
SP - 25
EP - 35
DO - 10.5220/0003095700250035

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.