YoVDO

Witness Indistinguishability for Any Single-Round Argument with Applications to Access Control

Offered By: TheIACR via YouTube

Tags

Cryptography Courses Theoretical Computer Science Courses Access Control Courses

Course Description

Overview

Explore a conference talk on witness indistinguishability for single-round arguments and their applications to access control. Delve into the research presented by Zvika Brakerski and Yael Kalai at PKC 2020, covering topics such as delegating NP computation, generic WI transformation, handling secret verifiability, WI proof systems, and practical applications in access control. Gain insights into cutting-edge cryptographic techniques and their real-world implications for secure systems.

Syllabus

Intro
Delegating NP Computation
Our Results
Our Generic Wl Transformation
Handling Secret Verifiability
WI Proof System
Application: Access Control


Taught by

TheIACR

Related Courses

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera