Non-Malleable Commitments Using Goldreich-Levin List Decoding
Offered By: IEEE via YouTube
Course Description
Overview
Explore the concept of non-malleable commitments using Goldreich-Levin list decoding in this 22-minute IEEE conference talk. Delve into topics such as semantic security, commitment schemes, and the man-in-the-middle attack. Understand the formal extraction process and its applications. Learn about Bloom's bit commitment and the Goldreich-Levin theorem. Examine interactive commitments, extraction proofs, and hiding proofs. Gain insights into distributional extraction and its implications for cryptographic security.
Syllabus
Introduction
Semantic Security
NonMalleability
Commitment Schemes
Commit Phase
Binding
Formally
Model
Applications
Prior Work
Man in the Middle
Extractability
Intuition
Formal
Extraction
The Problem
Disclaimer
Introducing Blooms Bit Commitment
GoldreichLevin Theorem
Interactive Commitments
Extraction Proof
Hiding Proof
Summary
Conclusion
Distributional Extraction
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube