Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.