Explore a comprehensive analysis of Conditional Disclosure of Secrets (CDS) in this 23-minute conference talk presented at Crypto 2017. Delve into the paper by Benny Applebaum, Barak Arkis, Pavel Raykov, and Prashant Nalini Vasudevan, which covers amplification, closure, amortization, lower bounds, and separation. Gain insights into the reasons for studying CDS, current knowledge in the field, and key concepts such as the collision problem, indexing operation, and collision function. Examine privacy errors and their implications, and understand the importance of amortization in CDS. Conclude with a summary of the presented findings and their significance in the field of cryptography.
Overview
Syllabus
Introduction
Reasons to Study
What We Know
First result
Collision problem
Indexing operation
Collision function
Privacy Errors
Amortization
Summary
Taught by
TheIACR