YoVDO

Relativistic or 2 Prover 1 Round Zero Knowledge Protocol for NP Secure Against Quantum Adversaries

Offered By: TheIACR via YouTube

Tags

Conference Talks Courses Cryptography Courses Quantum Computing Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a presentation on relativistic or two-prover one-round zero-knowledge protocols for NP secure against quantum adversaries. Delve into the paper by André Chailloux and Anthony Leverrier, presented at Eurocrypt 2017, covering topics such as initial motivation, Sigma protocols, quantum consecutive measurements, main theorems, and applications to proofs of knowledge. Examine the construction of relativistic Fobit commitment and the zero-knowledge protocol for Hamiltonian Cycle problems. Conclude with open questions regarding the composability of such schemes, gaining insights into advanced cryptographic concepts and their quantum-resistant properties.

Syllabus

Initial motivation
Motivation (2)
Concrete example: Sigma protocols
Sigma protocols (2) - How to go from 1 to 2 challenges?
Quantum consecutive measurements
Recap of the problem
Main theorems
Tightness of the bounds.
Application of the bound Proofs of knowledge
Construction
Relativistic Fobit commitment
ZK protocol for Hamiltonian Cycle (informal) . Given a graph G. does there exista closed path going thought al nodes without using the same edge twice?
Open questions Composability of such schemes.


Taught by

TheIACR

Related Courses

Intro to Computer Science
University of Virginia via Udacity
Quantum Mechanics for IT/NT/BT
Korea University via Open Education by Blackboard
Emergent Phenomena in Science and Everyday Life
University of California, Irvine via Coursera
Quantum Information and Computing
Indian Institute of Technology Bombay via Swayam
Quantum Computing
Indian Institute of Technology Kanpur via Swayam