Derandomization Security of Homomorphic Encryption

The paper considers the problems of developing and analysis of cloud database systems. We determine the requrments for encryption to be usable in practical applications. A new notion - a non-derandomizable encryption - allows to do this and we explain the practical value of this notion as well as li...

Full description

Bibliographic Details
Published in:Труды Института системного программирования РАН
Main Author: A. . Trepacheva
Format: Article
Language:English
Published: Russian Academy of Sciences, Ivannikov Institute for System Programming 2018-10-01
Subjects:
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/933
_version_ 1848653601942011904
author A. . Trepacheva
author_facet A. . Trepacheva
author_sort A. . Trepacheva
collection DOAJ
container_title Труды Института системного программирования РАН
description The paper considers the problems of developing and analysis of cloud database systems. We determine the requrments for encryption to be usable in practical applications. A new notion - a non-derandomizable encryption - allows to do this and we explain the practical value of this notion as well as links between it and classical notions of cryptosystem’s security, practical security of whole cloud computing system. We show the examples of simple algebraically homomorphic cryptosystems - both derandomizable and not non-derandomizable. The paper finally concludes about usability of considered cryptosystems for practical cloud systems.
format Article
id doaj-art-bc28fa9cc9bb46ffa7895567558dfef6
institution Directory of Open Access Journals
issn 2079-8156
2220-6426
language English
publishDate 2018-10-01
publisher Russian Academy of Sciences, Ivannikov Institute for System Programming
record_format Article
spelling doaj-art-bc28fa9cc9bb46ffa7895567558dfef62025-11-02T20:11:22ZengRussian Academy of Sciences, Ivannikov Institute for System ProgrammingТруды Института системного программирования РАН2079-81562220-64262018-10-0127638139410.15514/ISPRAS-2015-27(6)-24933Derandomization Security of Homomorphic EncryptionA. . Trepacheva0Южный федеральный университетThe paper considers the problems of developing and analysis of cloud database systems. We determine the requrments for encryption to be usable in practical applications. A new notion - a non-derandomizable encryption - allows to do this and we explain the practical value of this notion as well as links between it and classical notions of cryptosystem’s security, practical security of whole cloud computing system. We show the examples of simple algebraically homomorphic cryptosystems - both derandomizable and not non-derandomizable. The paper finally concludes about usability of considered cryptosystems for practical cloud systems.https://ispranproceedings.elpub.ru/jour/article/view/933защита информациивычисления над зашифрованными даннымигомоморфное шифрованиекриптоанализдерандомизация
spellingShingle A. . Trepacheva
Derandomization Security of Homomorphic Encryption
защита информации
вычисления над зашифрованными данными
гомоморфное шифрование
криптоанализ
дерандомизация
title Derandomization Security of Homomorphic Encryption
title_full Derandomization Security of Homomorphic Encryption
title_fullStr Derandomization Security of Homomorphic Encryption
title_full_unstemmed Derandomization Security of Homomorphic Encryption
title_short Derandomization Security of Homomorphic Encryption
title_sort derandomization security of homomorphic encryption
topic защита информации
вычисления над зашифрованными данными
гомоморфное шифрование
криптоанализ
дерандомизация
url https://ispranproceedings.elpub.ru/jour/article/view/933
work_keys_str_mv AT atrepacheva derandomizationsecurityofhomomorphicencryption