Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application

TheIACR via YouTube

Overview

Explore a conference talk on zero-knowledge arguments for arithmetic circuits and their applications, presented at PKC 2020. Delve into the paper by Carsten Baum and Ariel Nof, which covers topics such as MPC-in-the-head techniques, pre-processing in MPC, and the SIS problem. Learn about circuit sampling on the fly, bit test amortization, and implementation results. Gain insights into concrete efficiency improvements for zero-knowledge proofs and their potential applications in cryptography.

Syllabus

Intro
Our Results
MPC (in-the-Head) with Pre-Processing
Pre-processing in MPC
MPC-in-the-head: 1st approach [KKW18]
MPC-in-the-head: 2nd approach Ours
Comparing the two approaches
Application: The SiS problem
The Binary SIS problem
Can we do better?
Circuit Sampling on the Fly
Example: Amortize bit tests
Implementation & Experimental Results
Conclusions

Taught by

TheIACR

Reviews

Start your review of Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.