Towards practical private information retrieval from homomorphic encryption

Towards practical private information retrieval from homomorphic encryption

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 somewha...

Повний опис

Збережено в:
Бібліографічні деталі
Дата:2015
Автор: Zhuravlev, Dmitry
Формат: Стаття
Мова:English
Опубліковано: Lugansk National Taras Shevchenko University 2015
Теми:
protocols
encryption
servers
complexity theory
private information retrieval
homomorphic encryption
11T71
Онлайн доступ:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/74
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
Назва журналу:Algebra and Discrete Mathematics

Репозитарії

Algebra and Discrete Mathematics
id admjournalluguniveduua-article-74
record_format ojs
spelling admjournalluguniveduua-article-742015-09-28T11:22:08Z Towards practical private information retrieval from homomorphic encryption Zhuravlev, Dmitry protocols, encryption, servers, complexity theory, private information retrieval, homomorphic encryption 11T71 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 circuitwhich 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\). Lugansk National Taras Shevchenko University 2015-09-28 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/74 Algebra and Discrete Mathematics; Vol 19, No 2 (2015) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/74/23 Copyright (c) 2015 Algebra and Discrete Mathematics
institution Algebra and Discrete Mathematics
baseUrl_str
datestamp_date 2015-09-28T11:22:08Z
collection OJS
language English
topic protocols
encryption
servers
complexity theory
private information retrieval
homomorphic encryption
11T71
spellingShingle protocols
encryption
servers
complexity theory
private information retrieval
homomorphic encryption
11T71
Zhuravlev, Dmitry
Towards practical private information retrieval from homomorphic encryption
topic_facet protocols
encryption
servers
complexity theory
private information retrieval
homomorphic encryption
11T71
format Article
author Zhuravlev, Dmitry
author_facet Zhuravlev, Dmitry
author_sort Zhuravlev, Dmitry
title Towards practical private information retrieval from homomorphic encryption
title_short Towards practical private information retrieval from homomorphic encryption
title_full Towards practical private information retrieval from homomorphic encryption
title_fullStr Towards practical private information retrieval from homomorphic encryption
title_full_unstemmed Towards practical private information retrieval from homomorphic encryption
title_sort towards practical private information retrieval from homomorphic encryption
description 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 circuitwhich 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\).
publisher Lugansk National Taras Shevchenko University
publishDate 2015
url https://admjournal.luguniv.edu.ua/index.php/adm/article/view/74
work_keys_str_mv AT zhuravlevdmitry towardspracticalprivateinformationretrievalfromhomomorphicencryption
first_indexed 2025-12-02T15:40:50Z
last_indexed 2025-12-02T15:40:50Z
_version_ 1850411634786304000

Схожі ресурси