Description
Fully homomorphic encryption (FHE) is a form of encryption that allows arbitrary computations on data without requiring to decrypt the ciphertexts. Among the diverse FHE schemes, CKKS is designed to efficiently perform computations on real numbers in an encrypted state. Interestingly, Drucker et al [J. Cryptol.] recently proposed an efficient strategy to use CKKS in a black-box manner to perform computations on binary data. In this talk, after an introduction on fully homomorphic encryption, I will explain how to modify CKKS to gain efficiency when handling binary data. As we will see, the obtained performance compares very favourably with that of the other FHE schemes. Based on joint work with Youngjin Bae, Jung Hee Cheon and Jaehyung Kim.
Next sessions
-
Polytopes in the Fiat-Shamir with Aborts Paradigm
Speaker : Hugo Beguinet - ENS Paris / Thales
The Fiat-Shamir with Aborts paradigm (FSwA) uses rejection sampling to remove a secret’s dependency on a given source distribution. Recent results revealed that unlike the uniform distribution in the hypercube, both the continuous Gaussian and the uniform distribution within the hypersphere minimise the rejection rate and the size of the proof of knowledge. However, in practice both these[…]-
Cryptography
-
Asymmetric primitive
-
Mode and protocol
-
-
Post-quantum Group-based Cryptography
Speaker : Delaram Kahrobaei - The City University of New York