Abstract
We propose a key exchange protocol that works in a polynomial ideal setting. We do this so that the key can be used for a homomorphic cryptography protocol. The advantage of using key exchange over a public key system is that a large proportion of the process needs to be carried out only once instead of needing a more complicated encryption function to use for each piece of data. Polynomials rings are an appropriate choice of structure for this particular type of scheme as they allow universal computation. This paper will examine how we can perform computation correctly on cipher texts and address some of the potential weaknesses of such a process.
This work was supported by the Engineering and Physical Sciences Research Council, Centre for Doctoral Training in Cloud Computing for Big Data [grant number EP/L015358/1].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
L. A. M. L. D. Rivest, R. L.: On Data Banks and Privacy Homomorphisms. Foundations of secure computation (1978)
X. P. R. a. B. E. Yi: Homomorphic Encryption and Applications. Springer (2014)
F. a. Z. P. Hao: The power of anonymous veto in public discussion. In: Transactions on Computational Science, Springer, Berlin (2009)
L. K. V. V. Naehrig, M.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop (2011)
G. A.: Google tests new crypto in chrome to fend off quantum attacks. www.wired.com/2016/07/google-tests-new-crypto-chrome-fend-off-quantum-attacks/ (2016)
V. d. P. J., Lattice-Based Cryptography. Eindhoven (2011)
C. J. E. P. R. M. N. W. E. M. S. B. H. a. Z. N. Curino: Relational Cloud: A Database-as-a-Service for the Cloud (2011)
Buchberger, B.: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symbolic Comput. 475–511 (1965)
W. a. L. P. Adams.: An Introduction to Grobner Bases. American Mathematical Society (1994)
Rai, T.: Infinite Grobner Bases and Noncommutative Polly Cracker Cryptosystems (2004)
Garber, D.: Braid group cryptography. In: Braids: Introductory Lectures on Braids, Configurations and Their Applications, pp. 329–403 (2010)
Gentry, C.: A Fully Homomorphic Encryption Scheme. Stanford University (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
To prevent tedious amounts of expanding brackets, we will keep a lot of the polynomials factored and we will also make the substitutions
This means that we have the public ideal \( \left\langle { \left( {W + z} \right)^{2} } \right\rangle \) that we can use to reduce terms while in the cloud. We will also have the private ideal \( \left\langle {\left( {A + B + C + D} \right)\left( {W + z} \right) - 1,~\left( {W + z} \right)\left( {A + B + C + D} \right) - 1} \right\rangle \) to be used for further reduction once offline. Now let’s do a simple calculation.
Our public ideal space kills off multiples of \( \left( {W + z} \right)^{2} \), so that leaves us with
Performing the decryption method, we have
Once again reducing according to our public ideal we are left with
Now that we are offline we can use the private ideal which gives us
as required.
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Aiston, J. (2020). Ring Theoretic Key Exchange for Homomorphic Encryption. In: Arai, K., Bhatia, R. (eds) Advances in Information and Communication. FICC 2019. Lecture Notes in Networks and Systems, vol 70. Springer, Cham. https://doi.org/10.1007/978-3-030-12385-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-030-12385-7_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-12384-0
Online ISBN: 978-3-030-12385-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)