9 citations · 15 across the 12 of their papers we have counts for
12 papers
An Obfuscating C Compiler for Encrypted Computing
Peter Breuer
This paper describes an `obfuscating' C compiler for encrypted computing. The context consists of (i) a processor that `works encrypted', taking in encrypted inputs and producing e…
Safe and Chaotic Compilation for Hidden Deterministic Hardware Aliasing
Peter T. Breuer
Hardware aliasing occurs when the same logical address can access different physical memory locations. This is a problem for software on some embedded systems and more generally wh…
Chaotic Compilation for Encrypted Computing: Obfuscation but Not in Name
Peter T. Breuer
An `obfuscation' for encrypted computing is quantified exactly here, leading to an argument that security against polynomial-time attacks has been achieved for user data via the de…
Compiled Obfuscation for Data Structures in Encrypted Computing
Peter T. Breuer
Encrypted computing is an emerging technology based on a processor that `works encrypted', taking encrypted inputs to encrypted outputs while data remains in encrypted form through…
Safe Compilation for Hidden Deterministic Hardware Aliasing and Encrypted Computing
Peter T. Breuer
Hardware aliasing occurs when the same logical address sporadically accesses different physical memory locations and is a problem encountered by systems programmers (the opposite,…
(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…
Empirical Patterns in Google Scholar Citation Counts
Peter T. Breuer, Jonathan P. Bowen
Scholarly impact may be metricized using an author's total number of citations as a stand-in for real worth, but this measure varies in applicability between disciplines. The detai…
Soundness and Completeness of the NRB Verification Logic
Peter T. Breuer, Simon J. Pickin
This short paper gives a model for and a proof of completeness of the NRB verification logic for deterministic imperative programs, the logic having been used in the past as the ba…
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…
Certifying Machine Code Safe from Hardware Aliasing: RISC is not necessarily risky
Peter T. Breuer, Jonathan P. Bowen
Sometimes machine code turns out to be a better target for verification than source code. RISC machine code is especially advantaged with respect to source code in this regard beca…