# Questions tagged [homomorphic-encryption]

Cryptosystems which support computation on encrypted data. They may be partially homomorphic (support for one operation such as + or *), somewhat (or leveled) homomorphic (support for a limited number of two operations) or they may be fully homomorphic (any sequence of + and *).

13 questions
Filter by
Sorted by
Tagged with
89 views

### Non-interactive proof showing the multiplication of an encrypted matrix with a public vector is as claimed

Consider a "fantasy sports" setting where $m$ contestants each pick $k$ players from a set of $n$ players before a game. The state can be represented by a Boolean matrix $\mathbf{A}$ of size ...
• 393
79 views

### How can arbitrary combinational logic be done with just addition and multiplication?

Once when I was reading about SPDZ (a multi-party computation protocol), and once when I was reading about homomorphic encryption, it was taken for granted that since both addition and multiplication ...
• 101
155 views

### Q: Trusting program output from an untrusted machine

Let's suppose that we create a program P, that given input I, generates output O. We then want to run this program on an untrusted computer C that may either want to tamper with the program (run P' ...
• 183
84 views

### "Security Against Covert Adversaries" question

I was reading the paper Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries by Aumann and Lindell, and had some questions with the protocol for covert OT given errorless ...
• 778
472 views

### How and why does Recrypt function work?

The general aproach presented by Craig Gentry in 2009 to create a fully-homomorphic encryption system is roughly the follow: Create a scheme that can evaluate some functions (increasing the noise in ...
119 views

• 173
154 views

### Do irrational numbers contain an infinite number of (or all possible) patterns of sequences? [closed]

I guess the question is "does an 'infinite' number of patterns imply 'every' number of patterns?" For instance, if you could quickly calculate the decimal sequence of π, could you not (in ...
153 views

### Algorithm Design for only Mutual Information Sharing

Bob and Alice each have a bit string they want to keep private. They each want to know what the bitwise AND of their two strings would be without telling the other or anyone else listening to their ...
• 143
224 views

### Auditable encrypted ledger

Consider a cloud-based accounting system that needs access to aggregate information such as an account's balance but doesn't need access to individual transaction amounts in a ledger. Does there ...
• 23
468 views

### Threshold Fully Homomorphic Cryptosystems

recently, Craig Gentry published the first public key encryption scheme (over plaintext space {0,1}) which is fully homomorphic, meaning that one can efficiently and compactly evaluate AND and XOR on ...