Abstract
A KPU is a replacement for a standard RISC processor that natively runs encrypted machine code on encrypted data in registers and memory – a ‘general-purpose crypto-processor’, in other words. It works because the processor’s arithmetic is customised to make the chosen encryption into a mathematical homomorphism, resulting in what is called a ‘fully-homomorphic encryption’ design. This paper discusses the problems and solutions associated with implementing a KPU in hardware.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Breuer, P.T., Bowen, J.P.: A Fully Homomorphic Crypto-Processor Design: Correctness of a Secret Computer. In: Jürjens, J., Livshits, B., Scandariato, R. (eds.) ESSoS 2013. LNCS, vol. 7781, pp. 123–138. Springer, Heidelberg (2013)
Breuer, P.T., Bowen, J.P.: Typed Assembler for a RISC Crypto-Processor. In: Barthe, G., Livshits, B., Scandariato, R. (eds.) ESSoS 2012. LNCS, vol. 7159, pp. 22–29. Springer, Heidelberg (2012)
Breuer, P.T., Bowen, J.P.: Certifying Machine Code Safe from Hardware Aliasing: RISC is not necessarily risky. In: Counsell, S., Núñez, M. (eds.) SEFM 2013 Collocated Workshops, LNCS, vol. 8368, Springer, Heidelberg (2014)
Diffie, W., Hellman, M.: New directions in cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976), doi:10.1109/TIT.1976.1055638.
Gentry, C.: Computing arbitrary functions of encrypted data. Communications of the ACM 53(3), 97–105 (2010)
Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: Proc. 41st ACM Symposium on Theory of Computing (STOC), pp. 169–178. ACM (2009), doi:10.1145/1536414.1536440, ISBN: 978-1-60558-506-2
Gentry, C., Halevi, S.: Implementing Gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011)
Kömmerling, O., Kuhn, M.G.: Design principles for Tamper-Resistant Smartcard Processors. In: Smartcard 1999, Chicago, Illinois, USA, May 10-11, pp. 9–20 (1999)
Patterson, D.A.: Reduced Instruction Set Computers. Communications of the ACM 28(10), 8–21 (1985)
Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Foundations of Secure Computation 32(4), 169–180 (1978)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21(2), 120–126 (1978)
Wei, W., et al.: Accelerating Fully Homomorphic Encryption on GPUs. In: Proc. IEEE High Performance Extreme Computing Conference (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Breuer, P.T., Bowen, J.P. (2014). Idea: Towards a Working Fully Homomorphic Crypto-processor. In: Jürjens, J., Piessens, F., Bielova, N. (eds) Engineering Secure Software and Systems. ESSoS 2014. Lecture Notes in Computer Science, vol 8364. Springer, Cham. https://doi.org/10.1007/978-3-319-04897-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-04897-0_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04896-3
Online ISBN: 978-3-319-04897-0
eBook Packages: Computer ScienceComputer Science (R0)