HOMOMORPHIC ENCRYPTION OF CLOUD DATA BY THE MATRIX POLYNOMIAL METHOD
Journal Title: Сучасний стан наукових досліджень та технологій в промисловості - Year 2018, Vol 6, Issue 4
Abstract
The subject matter of the study is the encryption of information in cloud data computation and storage. Cloud technologies enable reducing the cost of IT infrastructure significantly and responding to changes in computing needs flexibly. In this case, the possibilities to perform calculations on the encrypted data without decrypting should be provided. Fully homomorphic encryption has this feature. The goal of this article is to increase the efficiency of fully homomorphic encryption (FHE) on the basis of matrix polynomials using the method of batch encryption to one ciphertext of several plaintexts with the subsequent complex processing of encrypted data. Batch encryption comes down to the fact that while conducting the operation on two ciphertexts, operations are simultaneously conducted coordinatewise on all the data contained in these ciphertexts in the form of plaintexts (SIMD). The task is the construction of algorithms of fully homomorphic data encryption using matrix polynomials. The following encryption methods are used in the article: the use of the Chinese remainder theorem; recording several different eigenvalues with different eigenvectors to the same matrix; the interpolation of matrix polynomials. The following results were obtained: possible approaches to constructing a batch EHE on the basis of matrix polynomials were described and analyzed, a set of algorithms that implement the FHE crypto scheme with interpolation of matrix polynomials was presented. The above algorithms and crypto schemes enable transmitting information in messages and data in queries as a plain text because an unlimited number of complex algebraic operations can be performed on the encrypted data, which makes it difficult to decrypt and read data without the knowledge of the entire algorithm. The constructed crypto schemes were shown as more efficient than analogues developed by IBM researchers. The following conclusion can be made: a batch fully homomorphic encryption using matrix polynomials can eliminate the need for at least partial decryption of data to carry out unauthorized computation on encrypted cloud data arrays.
Authors and Affiliations
Oleksandr Belej
Keywords
Related Articles
- EP ID EP472251
- DOI 10.30837/2522-9818.2018.6.005
- Views 71
- Downloads 0
ON THE APPROACH TO SEARCHING FOR FUNCTIONAL DEPENDENCES OF DATA IN RELATIONAL SYSTEMS
The subject matter of the study is information systems built on the basis of relational databases. The goal of the article is to develop a method for re-engineering relational databases that takes into account implicit i...
THE SYSTEM OF INFORMATION SUPPORT OF RECRUITING PROCESSES IN IT-COMPANY
The subject matter of the article is the processes of collecting, processing and analyzing information on recruiting personnel in a recruiting company. The goal is to reduce the time and make the collection and processio...
CORRUPTION IN BUSINESS: CORRUPT BEHAVIOUR INSIDE BUSINESS ENVIRONMENT
Corruption has become a widespread phenomenon in all respects, it significantly affects the prospects for economic growth, especially in developing countries. Entrepreneurs and experts agree that a high level of corrupti...
INFORMATION TECHNOLOGY FOR THE INTEGRATED ASSESSMENT OF EXPERT COMPETENCY
The subject matter of the study is the processes of selecting and assessing the competency of experts. The goal of the study is to increase the objectivity of expert assessment by developing and applying a model and info...
MODEL OF TIME MANAGEMENT IN THE SYSTEM OF STRATEGIC PROJECT MANAGEMENT
The subject of research of the article is the process of choosing ways to improve time management as one of the major resources of the projects with strategic project management positions. The goal - to build a model of...