Abstract. Chosen-Ciphertext (IND-CCA) security is generally consid-ered the right notion of security for a cryptosystem. Because of its central importance much effort has been devoted to constructing IND-CCA se-cure cryptosystems. In this work, we consider constructing IND-CCA secure cryptosystems from (group) homomorphic encryption. Our main results give natural and efficient constructions of IND-CCA secure cryptosystems from any homomorphic encryption scheme that satisfies weak cyclic properties, either in the plaintext, ciphertext or randomness space. Our results have the added benefit of being simple to describe and analyze
We propose a new and simple framework for constructing fully homomorphic encryption (FHE) which is c...
We propose a generic approach to design homomorphic en-cryption schemes, which extends Gjøsteen's fr...
International audienceWe propose a generic approach to design homomorphic en-cryption schemes, which...
We study homomorphic authenticated encryption, where privacy and authenticity of data are protected ...
Abstract. We study homomorphic authenticated encryption, where privacy and authenticity of data are ...
International audienceSemantic security against chosen-ciphertext attacks (IND-CCA) is widely believ...
We give a complete characterization both in terms of security and design of all currently existing g...
It is a well-known result that homomorphic encryption is not secure against adaptive chosen cipherte...
We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure again...
It is a well-known result that homomorphic encryption is not secure against adaptive chosen cipherte...
We propose a generic approach to design homomorphic encryption schemes, which extends Gj\o steen's f...
We propose a simple and e#cient construction of a CCAsecure public-key encryption scheme from any C...
Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arb...
AbstractThe study of homomorphic encryption techniques has led to significant advancements in the co...
Abstract. Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryp...
We propose a new and simple framework for constructing fully homomorphic encryption (FHE) which is c...
We propose a generic approach to design homomorphic en-cryption schemes, which extends Gjøsteen's fr...
International audienceWe propose a generic approach to design homomorphic en-cryption schemes, which...
We study homomorphic authenticated encryption, where privacy and authenticity of data are protected ...
Abstract. We study homomorphic authenticated encryption, where privacy and authenticity of data are ...
International audienceSemantic security against chosen-ciphertext attacks (IND-CCA) is widely believ...
We give a complete characterization both in terms of security and design of all currently existing g...
It is a well-known result that homomorphic encryption is not secure against adaptive chosen cipherte...
We propose simple and efficient CCA-secure public-key encryption schemes (i.e., schemes secure again...
It is a well-known result that homomorphic encryption is not secure against adaptive chosen cipherte...
We propose a generic approach to design homomorphic encryption schemes, which extends Gj\o steen's f...
We propose a simple and e#cient construction of a CCAsecure public-key encryption scheme from any C...
Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arb...
AbstractThe study of homomorphic encryption techniques has led to significant advancements in the co...
Abstract. Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryp...
We propose a new and simple framework for constructing fully homomorphic encryption (FHE) which is c...
We propose a generic approach to design homomorphic en-cryption schemes, which extends Gjøsteen's fr...
International audienceWe propose a generic approach to design homomorphic en-cryption schemes, which...