29 citations · 66 across the 15 of their papers we have counts for
4 papers · 1 filter
(Un)Encrypted Computing and Indistinguishability Obfuscation
Peter T. Breuer, Jonathan P. Bowen
This paper first describes an `obfuscating' compiler technology developed for encrypted computing, then examines if the trivial case without encryption produces much-sought indisti…
A First Practical Fully Homomorphic Crypto-Processor Design: The Secret Computer is Nearly Here
Peter Breuer, Jonathan Bowen
Following a sequence of hardware designs for a fully homomorphic crypto-processor - a general purpose processor that natively runs encrypted machine code on encrypted data in regis…
On the Security of Fully Homomorphic Encryption and Encrypted Computing: Is Division safe?
Peter T. Breuer, Jonathan P. Bowen
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 f…
An Open Question on the Uniqueness of (Encrypted) Arithmetic
Peter T. Breuer, Jonathan P. Bowen
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…