Explore the concept of Leakage Resilient Secret Sharing Against Colluding Parties in this 20-minute IEEE conference talk. Delve into the intricacies of leakage-resilient secret sharing, bounded collusion protocols, and their applications in communication complexity. Examine the main results, including the logarithmic barrier and tampering adversaries. Learn about non-malleable secret sharing and leakage-resilient NMSS. Discover the two-phase approach involving (.p+1.+1)-LRSS and lifting techniques, as well as the scatter and reuse shares method. Consider open problems in the field and gain insights from speakers Ashutosh Kumar, Raghu Meka, and Amit Sahai.
Leakage Resilient Secret Sharing Against Colluding Parties
Overview
Syllabus
Intro
Leakage?
Leakage-Resilient Secret Sharing
Limitations of Model
Modeling Leakage
Bounded Collusion Protocols (BCP)
BCPs in Communication Complexity
Leakage-Resilience against CPS
Our Main Result
Logarithmic Barrier
Tampering adversaries?
Non-malleable Secret Sharing
Leakage-Resilient NMSS
Concurrent and independent Work
Outline
Phase 1: (.p+1.+1)-LRSS
Phase 2: Lifting
Scatter and Reuse Shares
Disjoint subsets?
Open Problems
Thank you
Taught by
IEEE FOCS: Foundations of Computer Science
