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.
|Authors||Breuer, PT and Bowen, JP|
Since fully homomorphic encryption and homomorphically encrypted computing preserve algebraic identities such as 2*2=2+2, a natural question is whether this extremely utilitarian feature also sets up cryptographic attacks that use the encrypted arithmetic operators to generate or identify the encryptions of known constants. In particular, software or hardware might use encrypted addition and multiplication to do encrypted division and deliver the encryption of x/x=1. That can then be used to generate 1+1=2, etc, until a complete codebook is obtained. This paper shows that there is no formula or computation using 32-bit multiplication x*y and three-input addition x+y+z that yields a known constant from unknown inputs. We characterise what operations are similarly `safe' alone or in company, and show that 32-bit division is not safe in this sense, but there are trivial modifications that make it so.
|Web address (URL)||https://arxiv.org/abs/1411.4813|
CC BY 4.0
|Publication process dates|
|Deposited||20 Dec 2016|
|Submitted||18 Sep 2014|
0views this month
0downloads this month