分野別セミナー

In cryptography, fully homomorphic encryption (FHE) is a special kind of encryption scheme where anyone can perform arbitrary operation on encrypted data without decrypting them. Since the first construction of FHE scheme by Gentry in 2009, all the known "successful" constructions of FHE are based on ciphertexts with noise, which leads to inefficiency for refreshing noisy ciphertexts into ones with less noise. In this talk, I will explain my recent trial to develop FHE schemes without ciphertext noise based on group theory.