Explore a cutting-edge cryptographic paper presented at Crypto 2018 that delves into sub-linear lattice-based zero-knowledge arguments for arithmetic circuits. Gain insights into the innovative work by Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafael del Pino, Jens Groth, and Vadim Lyubashevsky. Discover the latest advancements in lattice-based cryptography and zero-knowledge proofs, and understand their applications in securing arithmetic circuits. This 20-minute presentation offers a concise yet comprehensive overview of the research, providing valuable knowledge for cryptography enthusiasts and professionals alike.
Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits
Overview
Syllabus
Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits
Taught by
TheIACR
Related Courses
-
Lattice Based Zero Knowledge Arguments for Integer Relations
-
Zero Knowledge Arguments for Lattice-Based PRFs and Applications to E-Cash
-
Zero-Knowledge Arguments for Lattice-Based Accumulators - Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
-
Lattice-Based Zero Knowledge Protocols - Session Overview
-
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application
-
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
