An Open Question on the Uniqueness of (Encrypted) Arithmetic

Conference item

Breuer, PT and Bowen, JP (2013). An Open Question on the Uniqueness of (Encrypted) Arithmetic. International Conference on Computational Science. Barcelona, Spain 05 - 07 Jun 2013 London South Bank University.
AuthorsBreuer, PT and Bowen, JP
Abstract

We ask whether two or more images of arithmetic may inhabit the same space via different encodings. The answers have significance for a class of processor design that does all its computation in an encrypted form, without ever performing any decryption or encryption itself. Against the possibility of algebraic attacks against the arithmetic in a `crypto-processor' (KPU) we propose a defence called `ABC encryption' and show how this kind of encryption makes it impossible for observations of the arithmetic to be used by an attacker to discover the actual values. We also show how to construct such encrypted arithmetics.

Year2013
PublisherLondon South Bank University
Publisher's version
License
Publication dates
Print05 Jun 2013
Publication process dates
Deposited24 Jan 2017
Permalink -

https://openresearch.lsbu.ac.uk/item/87902

Download files

Publisher's version
1306.0018v1.pdf
License: CC BY-NC-ND 4.0

  • 82
    total views
  • 30
    total downloads
  • 1
    views this month
  • 0
    downloads this month

Export as

Related outputs

Fully encrypted high-speed microprocessor architecture: The secret computer in simulation
Breuer, PT and Bowen, JP (2019). Fully encrypted high-speed microprocessor architecture: The secret computer in simulation. International Journal of Critical Computer-Based Systems. 9 (1-2), pp. 26-55. https://doi.org/10.1504/IJCCBS.2019.098797
The Secret Processor Will Go to the Ball: Benchmark Insider-Proof Encrypted Computing.
Breuer, PT, Bowen, JP, Palomar, E and Liu, Z (2018). The Secret Processor Will Go to the Ball: Benchmark Insider-Proof Encrypted Computing. 2018 IEEE European Symposium on Security and Privacy Workshops. 23 - 27 Apr 2018 Institute of Electrical and Electronics Engineers (IEEE). pp. 145-152 https://doi.org/10.1109/EuroSPW.2018.00027
Empirical Patterns in Google Scholar Citation Counts
Breuer, PT and Bowen, JP (2014). Empirical Patterns in Google Scholar Citation Counts. 2014 IEEE 8th International Symposium on Service Oriented System Engineering. 07 - 11 Apr 2014 Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/SOSE.2014.55
On obfuscating compilation for encrypted computing
Breuer, PT, Bowen, JP, Palomar, E and Liu, Z (2017). On obfuscating compilation for encrypted computing. 14th International Conference on Security and Cryptography. Madrid, Spain 24 - 26 Jul 2017
Encrypted computing: Speed, security and provable obfuscation against insiders
Breuer, PT, Bowen, JP, Palomar, E and Liu, Z (2017). Encrypted computing: Speed, security and provable obfuscation against insiders. International Carnahan Conference on Security Technology. Madrid, Spain 23 - 26 Oct 2017 Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/CCST.2017.8167847
Certifying Machine Code Safe from Hardware Aliasing: RISC is not necessarily risky
Breuer, PT and Bowen, JP (2013). Certifying Machine Code Safe from Hardware Aliasing: RISC is not necessarily risky. International Conference on Software Engineering and Formal Methods. Madrid, Spain London South Bank University. https://doi.org/10.1007/978-3-319-05032-4_27
A Fully Encrypted Microprocessor: The Secret Computer is Nearly Here
Breuer, PT and Bowen, JP (2016). A Fully Encrypted Microprocessor: The Secret Computer is Nearly Here. Procedia Computer Science. 83, pp. 1282-1287. https://doi.org/10.1016/j.procs.2016.04.267
A practical encrypted microprocessor
Breuer, PT, Bowen, JP, Palomar, E and Liu, Z (2016). A practical encrypted microprocessor. IEEE Proceedings of the 13th International Joint Conference on e-Business and Telecommunications. Lisbon, Portugal 26 - 28 Jul 2016 ScitePress. https://doi.org/10.5220/0005955902390250
On the Security of Fully Homomorphic Encryption and Encrypted Computing: Is Division safe?
Breuer, PT and Bowen, JP (2014). On the Security of Fully Homomorphic Encryption and Encrypted Computing: Is Division safe? arXiv.