Classical vs Quantum: What does the future hold for fully homomorphic encryption schemes?
Date
2019-08
Authors
Omollo, Richard
Odote, Jackson
Okello, Bernard
Journal Title
Journal ISSN
Volume Title
Publisher
Strathmore University
Abstract
The construction of homomorphic encryption schemes has supported arbirtrary
computations on outsourced data, without revealing their true contents. Recent
introduction of fully homomorphic versions has further improved the remedy to security
challenges that affect data especially when not in custody of its owners, by supporting
computations including those of higher polynomials functions. Despite these positive
developments, implementation of these fully homomorphic encryption schemes has
impacted negatively on the computing resources. These developments also have been
made both for classical computing systems that are based on assumed hardness of
mathematical problems and quantum computing systems that are based on Heisenberg
principle. This paper aim at comparing the two sets of fully homomorphic encryption
schemes: classical and quantum, with a view of providing future state-of-the-art of
computational needs on management of consumer data. The output of this paper shall be
useful not only to the scholarly world but also to the production units that shall desire to
adopt a more efficient computational approach that inexpensively safeguard consumer
data.
Description
Paper presented at the 5th Strathmore International Mathematics Conference (SIMC 2019), 12 - 16 August 2019, Strathmore University, Nairobi, Kenya
Keywords
Homomorphic Encryption Scheme;, Data security, Quantum