YoVDO

Quantum Homomorphic Encryption for Polynomial Sized Circuits

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Quantum Computing Courses Quantum Cryptography Courses Homomorphic Encryption Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Intro
EXAMPLE IMAGE TAGGING
PREVIOUS RESULTS: OVERVIEW
CLIFFORD SCHEME: PH, CNOT
THE CHALLENGE T GATE
ERROR-CORRECTION "GADGET"
NEW SCHEME OVERVIEW


Taught by

TheIACR

Related Courses

Fundamentals of Database Engineering
Udemy Stanford Seminar - Secure Data Science on the Internet of Things
Stanford University via YouTube Homomorphic Encryption in the SPDZ Protocol for MPC
Simons Institute via YouTube Practical Applications of Homomorphic Encryption
Simons Institute via YouTube Lattices, Post-Quantum Security and Homomorphic Encryption
Simons Institute via YouTube