Laconic Conditional Disclosure of Secrets and Applications
Offered By: IEEE via YouTube
Course Description
Overview
Explore the concept of Laconic Conditional Disclosure of Secrets and its applications in this 21-minute IEEE conference talk. Delve into the definition and significance of this cryptographic primitive, and discover how it relates to various applications in secure computation. Learn about the speakers' innovative approach, which incorporates Probabilistically Checkable Proofs and Garbled Circuits. Examine the construction presented by the researchers and understand how it leads to Malicious Laconic Oblivious Transfer based on the Computational Diffie-Hellman assumption. Gain insights from experts Nico Döttling, Sanjam Garg, Vipul Goyal, and Giulio Malavolta as they discuss this cutting-edge topic in cryptography and its potential impact on secure communication systems.
Syllabus
Intro
Conditional Disclosure of Secrets
Definition
Applications
Our Approach
Probabilistically Checkable Proofs
Garbled Circuits
Our Construction
Malicious Laconic OT from CDH
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