YoVDO

Non-Interactive Zero-Knowledge in Pairing-Free Groups from Weaker Assumptions

Offered By: TheIACR via YouTube

Tags

Cryptography Courses Theoretical Computer Science Courses Zero-Knowledge Proofs Courses

Course Description

Overview

Explore a groundbreaking paper on Non-Interactive Zero-Knowledge Proofs (NIZKs) in pairing-free groups presented at Eurocrypt 2020. Delve into the authors' innovative approach to constructing NIZKs under weaker assumptions, examining key concepts such as Sigma Protocols, Correlation-Intractable Hash Functions, and the Short-Exponent Discrete Logarithm problem. Gain insights into the step-by-step construction process, from the initial Sigma Protocol for LOH to the final transformation into NIZKs for NP. Understand the significance of this research in advancing cryptographic techniques and its potential impact on secure communication systems.

Syllabus

Intro
Non-Interactive Zero-Knowledge Proofs (NIZKS)
NIZKs in Pairing-Free Groups - Known Results
Our Improvements
Construction Overview
Key Intuition
Sigma Protocol for LOH
Step 2 CI Hash Function to NIZK
Step 2 Correlation-Intractable (CI) Hash Function
From NIZKH to NIZKs for NP
Our Second Contribution
Key Idea for Step 3
Short-Exponent Discrete Logarithm


Taught by

TheIACR

Related Courses

Homomorphic Encryption in the SPDZ Protocol for MPC
Simons Institute via YouTube
Signatures, Commitments, Zero-Knowledge, and Applications
Simons Institute via YouTube
Efficient Zero Knowledge Proof from Interactive Proofs
Simons Institute via YouTube
Berkeley in the 80s - Episode 1- Shafi Goldwasser
Simons Institute via YouTube
ITC Conference - Line Point Zero Knowledge and Its Applications
Paul G. Allen School via YouTube