Quantum Homomorphic Encryption for Polynomial Sized Circuits

YouTube·Conference Talks

Explore quantum homomorphic encryption for polynomial sized circuits in this 21-minute conference talk from Crypto 2016. Delve into the Clifford scheme, including PH and CNOT gates, and examine the challenges of T gates. Learn about error-correction "gadgets" and gain insights into a new scheme overview. Presented by Yfke Dulek, Christian Schaffner, and Florian Speelman, this talk provides a comprehensive look at advancements in quantum cryptography.