Extractors and Secret Sharing Against Bounded Collusion Protocols
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 35-minute IEEE conference talk delving into extractors and secret sharing techniques designed to counter bounded collusion protocols. Learn from experts Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, and David Zuckerman as they discuss complexity theory, the number and hands model, multiparty communication complexity, and explicit lower bounds. Gain insights into leakage-resilient extractors and discover future research directions in this field.
Syllabus
Introduction
Outline
Complexity Theory
Number and Hands Model
Multiparty Communication Complexity
Main Results
Explicit Lower Bounds
Proof
Leakage resilient extractors
Whats Next
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
The Next Generation of InfrastructureDelft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera