Completed
Constructing Zero-Knowledge Proofs - For discrete log relations - a simple sigma protocol
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
One Shot Verifiable Encryption from Lattices
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Examples
- 3 Polynomial Rings
- 4 Constructing Zero-Knowledge Proofs - For discrete log relations - a simple sigma protocol
- 5 Implications of the Extraction
- 6 Practical ( 20KB per proof) Applications
- 7 Main Open Problems
- 8 and Verifiable Encryption
- 9 Ring-LWE Encryption Scheme
- 10 Approximate Proofs and Proofs of Plaintext knowledge
- 11 Our Solution Outline
- 12 Limiting the Number of RO Queries by the Adversary
