Tagged Questions

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 *).

182 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 ...
102 views

Fully Homomorphic Encryption over Integers

On the section 3 of the paper Fully Homomorphic Encryption over the Integers, there is a construction of a somewhat encryption scheme, as follow: key generation Choose an odd η-bit integer $p$ in ...
238 views

How to homomorphically and “efficiently” evaluate $$(a_1 + b_1) \cdot c_1 + (a_2 + b_2) \cdot c_2 + \ldots + (a_n + b_n) \cdot c_n$$

Can i evaluate a formula $(a_i + b_i) \cdot c_i$ if i have the encryption of $a_i,b_i,c_i$ respectively using a homomorphic encryption scheme that supports multiplications and additions, supposing ...
133 views

Do irrational number contain infinate/every 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 ...
145 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 ...
204 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 ...
386 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 ...