loading
Documents

Research.Publish.Connect.

Paper

Authors: Majid Nateghizad ; Zekeriya Erkin and Reginald L. Lagendijk

Affiliation: Cyber Security Group, Department of Intelligent Systems, Delft University of Technology and The Netherlands

ISBN: 978-989-758-319-3

Keyword(s): Searching in Encrypted Databases, Homomorphic Encryption, Statistical Query, Indexing, Privacy.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data and Application Security and Privacy ; Data Engineering ; Database Security and Privacy ; Databases and Data Security ; Information and Systems Security ; Privacy ; Security and Privacy for Big Data ; Security and Privacy in IT Outsourcing ; Security in Information Systems

Abstract: It is astonishing to see more and more services built on user-oriented data, providing numerous tools to improve ones daily life. Nowadays, data collected from numerous sources is being used to monitor daily activities, i.e., monitoring patients. These innovations allow for more cost-efficient and scalable solutions. Nevertheless, these types of services can pose a threat to the privacy of individuals due to the possibility of leaking highly privacy-sensitive data. Therefore, it is essential to design such systems in a privacy-preserving manner. Inspired by a real-life project in the health-care domain, we propose to secure the data using encryption, while enabling the involved parties to run queries directly on this encrypted data. A vital component of such a system is searching for specific data entries within a large dataset. In this work, we present two cryptographic protocols that complete such a query by creating an encrypted vector in a simulation secure way. These vectors cons ist of a 1 for intended database entry, whereas other items would be represented as a 0. By creating index tables before the execution of the queries, it has become possible to execute a search query with high performance. As we show in our analyses, it takes less than one second to find the matching encrypted data-entry within a database with 100K records. Our proposal is generic, can be applied to several application domains, and practically compared to similar works. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

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 34.237.76.91

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:
Nateghizad, M.; Erkin, Z. and L. Lagendijk, R. (2018). Efficient Index-based Search Protocols for Encrypted Databases.In Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT, ISBN 978-989-758-319-3, pages 270-281. DOI: 10.5220/0006869804360447

@conference{secrypt18,
author={Majid Nateghizad. and Zekeriya Erkin. and Reginald L. Lagendijk.},
title={Efficient Index-based Search Protocols for Encrypted Databases},
booktitle={Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT,},
year={2018},
pages={270-281},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006869804360447},
isbn={978-989-758-319-3},
}

TY - CONF

JO - Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 1: SECRYPT,
TI - Efficient Index-based Search Protocols for Encrypted Databases
SN - 978-989-758-319-3
AU - Nateghizad, M.
AU - Erkin, Z.
AU - L. Lagendijk, R.
PY - 2018
SP - 270
EP - 281
DO - 10.5220/0006869804360447

Login or register to post comments.

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