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

YouTube

XJsnark - A Framework for Efficient Verifiable Computation

IEEE via YouTube

Overview

Explore a comprehensive presentation on xJsnark, a framework for efficient verifiable computation, delivered at the 2018 IEEE Symposium on Security & Privacy. Delve into the challenges of expressing computation tasks as arithmetic circuits and learn how xJsnark aims to bridge the gap between programmability and circuit size optimization. Discover new circuit-friendly algorithms for frequent operations, globally aware optimizations for integer arithmetic, and circuit minimization techniques. Examine the framework's applicability in developing large application circuits, such as ZeroCash, while achieving circuit size reductions comparable to low-level implementations. Gain insights into various topics including verifiable computation, expressing computations as circuits, long integer arithmetic, random memory access, static read-only memory, smart memory, and non-determinism. Conclude with an evaluation of the framework, its limitations, future work, and information about the open-source implementation.

Syllabus

Intro
Verifiable Computation
Expressing computations as circuits
Use case: Long Integer Arithmetic
Random Memory Access
Static Read-only Memory
Smart memory
Non-Determinism
Evaluation
Limitations and Future Work
Open Source Implementation

Taught by

IEEE Symposium on Security and Privacy

Reviews

Start your review of XJsnark - A Framework for Efficient Verifiable Computation

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.