Perfect/Statistical 2-Party Computation with Improved Circuit Privacy

본문 미리보기

We present protocols where one entity, the server, evaluates a circuit with encrypted inputs from the second party, the client. We give secret key somewhat additive homomorphic schemes where the client has perfect privacy (server is computationally unbounded). The key idea for client privacy is the permutation table which consists of rows of vectors modulo a prime integer m: The initial row is (1, d2, ..., dc) where di-1|di, di > N(a + 1)di-1, for an integer N which is a power of 2 and integer