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...
Main Author: | A. . Trepacheva |
---|---|
Format: | Article |
Language: | English |
Published: |
Ivannikov Institute for System Programming of the Russian Academy of Sciences
2018-10-01
|
Series: | Труды Института системного программирования РАН |
Subjects: | |
Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/933 |
Similar Items
-
Batch Symmetric Fully Homomorphic Encryption Using Matrix Polynomials
by: Ph. Burtyka
Published: (2018-10-01) -
A Threshold Cryptosystem in Secure Cloud Computations
by: N. P. Varnovskij, et al.
Published: (2018-10-01) -
О нестойкости двух симметричных гомоморфных криптосистем, основанных на системе остаточных классов
by: Ludmila Kliment'evna Babenko, et al.
Published: (2019-02-01) -
Improved known plaintexts attack on Domingo-Ferrer homomorphic cryptosystem
by: A. V. Trepacheva
Published: (2018-10-01) -
On Constructing a Fully Homomorphic Encryption
by: A. V. Shokurov, et al.
Published: (2018-10-01)