To obtain access to full text of journal and articles you must register!
- Article name
- Fully homomorphic encryption (Review)
- Authors
- Makarevich O. B., , mak@tgn.sfedu.ru, Southern Federal University, Taganrog, Russia
Babenko L. K., , blk@tgn.sfedu.ru, Southern Federal University, Taganrog, Russia
Trepacheva A. V., , alina1989malina@yandex.ru, Southern Federal University, Taganrog, Russia
Burtyka F. B., , , Southern Federal University, Taganrog, Russia
- Keywords
- information security / cryptography / fully homomorphic encryption / computing over encrypted data / cloud computations
- Year
- 2015 Issue 3 Pages 3 - 26
- Code EDN
- Code DOI
- Abstract
- The paper provides a survey of main achievemnts in the field of fully homomorphic cryptosystems (FHC). Particular attention is given to FHC based on Gentry method. The kea ideas are described and the basic stages of their evolution are highlighted. The main purpose is to demonstrate how the performance of Gentry like FHC was changed. Analysis shows that in the last two years efficiency of Gentry like FHC was improved dramatically. However they are still totally impractical. Therefore here alternative FHC are discussed. Their advantages and disadvantages in comparison with Gentry constructions are considered.
- Text
- To obtain access to full text of journal and articles you must register!
- Buy