Homomorphic Evaluation of Database Queries

Hamid Usefi; Sudharaka Palamakumbura

Mobile Networks and Management. 9th International Conference, MONAMI 2017, Melbourne, Australia, December 13-15, 2017, Proceedings

Research Article

Homomorphic Evaluation of Database Queries

Download

145 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-319-90775-8_17,
    author={Hamid Usefi and Sudharaka Palamakumbura},
    title={Homomorphic Evaluation of Database Queries},
    proceedings={Mobile Networks and Management. 9th International Conference, MONAMI 2017, Melbourne, Australia, December 13-15, 2017, Proceedings},
    proceedings_a={MONAMI},
    year={2018},
    month={5},
    keywords={Homomorphic Privacy Encryption Database Query},
    doi={10.1007/978-3-319-90775-8_17}
}

Hamid Usefi
Sudharaka Palamakumbura
Year: 2018
Homomorphic Evaluation of Database Queries
MONAMI
Springer
DOI: 10.1007/978-3-319-90775-8_17

Hamid Usefi^,*, Sudharaka Palamakumbura¹^,*

1: Memorial University of Newfoundland

*Contact email: usefi@mun.ca, sudharakap@mun.ca

Abstract

Homomorphic encryption is an encryption method that enables computing over encrypted data. This has a wide range of real world ramifications such as being able to blindly compute a search result sent to a remote server without revealing its content. This paper discusses how database search queries can be made secure using a homomorphic encryption scheme. We propose a new database search technique that can be used with the ring-based fully homomorphic encryption scheme proposed by Braserski.

Keywords: Homomorphic Privacy Encryption Database Query

Published: 2018-05-18
Appears in: SpringerLink

: http://dx.doi.org/10.1007/978-3-319-90775-8_17