Advertisement

Ring Theoretic Key Exchange for Homomorphic Encryption

  • Jack AistonEmail author
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 70)

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.

Keywords

Cryptography Homomorphic Key exchange Rings Ideals 

References

  1. 1.
    L. A. M. L. D. Rivest, R. L.: On Data Banks and Privacy Homomorphisms. Foundations of secure computation (1978) Google Scholar
  2. 2.
    X. P. R. a. B. E. Yi: Homomorphic Encryption and Applications. Springer (2014)Google Scholar
  3. 3.
    F. a. Z. P. Hao: The power of anonymous veto in public discussion. In: Transactions on Computational Science, Springer, Berlin (2009)CrossRefGoogle Scholar
  4. 4.
    L. K. V. V. Naehrig, M.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop (2011)Google Scholar
  5. 5.
    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)
  6. 6.
    V. d. P. J., Lattice-Based Cryptography. Eindhoven (2011)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    W. a. L. P. Adams.: An Introduction to Grobner Bases. American Mathematical Society (1994)Google Scholar
  10. 10.
    Rai, T.: Infinite Grobner Bases and Noncommutative Polly Cracker Cryptosystems (2004)Google Scholar
  11. 11.
    Garber, D.: Braid group cryptography. In: Braids: Introductory Lectures on Braids, Configurations and Their Applications, pp. 329–403 (2010)CrossRefGoogle Scholar
  12. 12.
    Gentry, C.: A Fully Homomorphic Encryption Scheme. Stanford University (2009)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Newcastle UniversityNewcastle upon TyneEngland, UK

Personalised recommendations