BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//hacksw/handcal//NONSGML v1.0//EN
BEGIN:VEVENT
UID:node-11398@webedit.cs.cornell.edu
DTSTAMP:20201130T212000Z
DTSTART:20201130T212000Z
DTEND:20201130T222000Z
SUMMARY:Extractors and Secret Sharing Against Bounded Collusion Protocols
DESCRIPTION:Jesse Goodman, PhD at Cornell University. Extractors and Secret Sharing Against Bounded Collusion Protocols (via Zoom)Abstract: Bounded collusion protocols (BCPs) are multiparty communication protocols in which N players, holding n bits each, wish to compute some joint function f : ({0,1}^n)^N —> {0,1}. In each round, p players are allowed to work together to write a single bit on a public blackboard, and the protocol continues until everyone knows the value of f.BCPs are a natural generalization of the well studied number-in-hand (NIH) and number-on-forehead (NOF) models, which are just endpoints on this rich spectrum (corresponding to p=1 and p=N-1, respectively). In this talk, we will investigate BCPs more thoroughly, and answer questions about them in the context of communication complexity, pseudorandomness, and cryptography.Our investigation will culminate in the explicit construction of three related objects: (1) functions with strong *lower bounds* against BCPs, (2) leakage...https://webedit.cs.cornell.edu/content/extractors-and-secret-sharing-against-bounded-collusion-protocols
LOCATION:Streaming via Zoom
END:VEVENT
END:VCALENDAR