Giulio Malavolta, Max Planck Institute for Security and Privacy
Quantum fully-homomorphic encryption (QFHE) allows one to encrypt quantum states and “blindly” perform an arbitrary quantum computation without the need to decrypt. QFHE is a powerful tool to delegate computation to an untrusted server, without blowing up the communication complexity of the protocol. In this talk, we present an approach to construct QFHE schemes with rate (i.e. the ratio between plaintext size and ciphertext size) approaching 1. We then discuss some motivating applications for this primitive.
If time permits, we will also survey over other new primitives in the landscape of quantum cryptography.
Based on joint works with Orestis Chardouvelis, Nico Döttling, and James Bartusek.
Recording of the talk