Limits of Provable Security for Homomorphic Encryption
نویسندگان
چکیده
We show that public-key bit encryption schemes which support weak (i.e., compact) homomorphic evaluation of any sufficiently “sensitive” collection of functions cannot be proved message indistinguishable beyond AM ∩ coAM via general (adaptive) reductions, and beyond statistical zero-knowledge via reductions of constant query complexity. Examples of sensitive collections include parities, majorities, and the class consisting of all AND and OR functions. Our techniques also give a method for converting a strong (i.e., distribution-preserving) homomorphic evaluator for essentially any boolean function (except the trivial ones, the NOT function, and the AND and OR functions) into a rerandomization algorithm: This is a procedure that converts a ciphertext into another ciphertext which is statistically close to being independent and identically distributed with the original one. Our transformation preserves negligible statistical error.
منابع مشابه
Multiplicative Homomorphic E-Auction with Formally Provable Security
A new method, homomorphic e-auction based on multiplicative homomorphic encryption algorithm like ElGamal encryption is proposed in this paper. Its advantage is obvious and useful in practice: efficient distributed private key generation and thus efficient trust sharing. A long existing problem in homomorphic e-auction, inefficiency of bid validity check, is solved in the new multiplicative hom...
متن کاملAn Efficient Proof of Retrievability Scheme for Fully Homomorphic Encrypted Data
Proof of retrievability (POR) is an interactive knowledge proof technique for a storage server to prove the integrity and ownership of clients’ data without downloading them. In this paper we consider efficiency of the POR scheme, when the data stored in cloud is encrypted under fully homomorphic encryption schemes. We presented a POR scheme with new, efficient homomorphic authenticator, which ...
متن کاملScale-Invariant Fully Homomorphic Encryption over the Integers
At Crypto 2012, Brakerski constructed a scale-invariant fully homomorphic encryption scheme based on the LWE problem, in which the same modulus is used throughout the evaluation process, instead of a ladder of moduli when doing “modulus switching”. In this paper we describe a variant of the van Dijk et al. FHE scheme over the integers with the same scale-invariant property. Our scheme has a sin...
متن کاملAn Efficient Somewhat Homomorphic Encryption Scheme Based on Factorization
Surprisingly, most of existing provably secure FHE or SWHE schemes are lattice-based constructions. It is legitimate to question whether there is a mysterious link between homomorphic encryptions and lattices. This paper can be seen as a rst (partial) negative answer to this question. We propose a very simple private-key (partially) homomorphic encryption scheme whose security relies on factori...
متن کاملContributions to provable security and efficient cryptography
This thesis deals with two main matters of modern public key cryptography: provable security and efficient implementation. Indubitably, security is the most important property of any cryptographic scheme. Nevertheless, cryptographic algorithms have often been designed on a trial-and-error basis, i. e., a system has been regarded as secure as long as it withstood cryptanalytic attacks. In contra...
متن کامل