Explore a presentation on a novel cryptographic concept called "A Subversion-Resistant SNARK" delivered at Asiacrypt 2017. Delve into the paper by Behzad Abdolmaleki, Karim Baghery, Helger Lipmaa, and Michal Zajac, which introduces a groundbreaking approach to enhancing the security of SNARKs (Succinct Non-interactive ARguments of Knowledge). Learn about the key components of this cryptographic innovation, including verification processes, zero-knowledge proofs, trust assumptions, and the properties of SNARKs. Understand the problem this research aims to solve and the two main reasons behind it. Gain insights into the notation used, the concept of Common Reference String (CRS), and CRS verification. The presentation concludes with a commercial break and a question session, providing a comprehensive overview of this cutting-edge development in cryptography.
Overview
Syllabus
Introduction
Outline
Verification
Zero Knowledge
Trust Assumption
Zero Knowledge Proof
Properties
SNARK
The Problem
Two Reasons
Notation
CRS
CRS Verification
Commercial Break
Question
Taught by
TheIACR
Related Courses
-
A Shuffle Argument Secure in the Generic Model
-
Non Interactive Zero Knowledge Proofs for Composite Statements
-
SNARKs for C - Verifying Program Executions Succinctly and in Zero Knowledge
-
Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits
-
On the Existence of Three Round Zero-Knowledge Proofs
