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
Fast Secure Computation for Small Population over the InternetAssociation for Computing Machinery (ACM) via YouTube Stacked Garbling for Disjunctive Zero-Knowledge Proofs
TheIACR via YouTube GAZELLE - A Low Latency Framework for Secure Neural Network Inference
USENIX via YouTube Garbling Gadgets for Boolean and Arithmetic Circuits
Association for Computing Machinery (ACM) via YouTube Optimizing Semi-Honest Secure Multiparty Computation for the Internet
Association for Computing Machinery (ACM) via YouTube