Главная
Study mode:
on
1
Intro
2
EXAMPLE IMAGE TAGGING
3
PREVIOUS RESULTS: OVERVIEW
4
CLIFFORD SCHEME: PH, CNOT
5
THE CHALLENGE T GATE
6
ERROR-CORRECTION "GADGET"
7
NEW SCHEME OVERVIEW
Description:
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.

Quantum Homomorphic Encryption for Polynomial Sized Circuits

TheIACR
Add to list
0:00 / 0:00