|
Algebra and Discrete Mathematics, 2015, Volume 19, Issue 2, Pages 302–312
(Mi adm525)
|
|
|
|
RESEARCH ARTICLE
Towards practical private information retrieval from homomorphic encryption
Dmitry Zhuravlev National Taras Shevchenko University of Kyiv, The Faculty of Mechanics and Mathematics
Abstract:
Private information retrieval (PIR) allows a client to retrieve data from a remote database while hiding the client's access pattern.
To be applicable for practical usage, PIR protocol should have low communication and computational costs.
In this paper a new generic PIR protocol based on somewhat homomorphic encryption (SWHE) is proposed.
Compared to existing constructions the proposed scheme has reduced multiplicative depth of the homomorphic evaluation circuit
which allows to cut down the total overhead in schemes with ciphertext expansion.
The construction results in a system with $O(\log{n})$ communication cost and $O(n)$ computational complexity for a database of size $n$.
Keywords:
protocols, encryption, servers, complexity theory, private information retrieval, homomorphic encryption.
Received: 11.03.2015 Revised: 16.07.2015
Citation:
Dmitry Zhuravlev, “Towards practical private information retrieval from homomorphic encryption”, Algebra Discrete Math., 19:2 (2015), 302–312
Linking options:
https://www.mathnet.ru/eng/adm525 https://www.mathnet.ru/eng/adm/v19/i2/p302
|
Statistics & downloads: |
Abstract page: | 416 | Full-text PDF : | 98 | References: | 45 |
|