Extractors and Secret Sharing Against Bounded Collusion Protocols

Eshan Chattopadhyay
Eshan Chattopadhyay
Jesse Goodman
Jesse Goodman
Vipul Goyal
Vipul Goyal
Ashutosh Kumar
Ashutosh Kumar
Xin Li
Xin Li
David Zuckerman
David Zuckerman

FOCS, pp. 1226-1242, 2020.

Cited by: 0|Views0
EI

Abstract:

In a recent work, Kumar, Meka, and Sahai (FOCS 2019) introduced the notion of bounded collusion protocols (BCPs). BCPs are multiparty communication protocols in which $N$ parties, holding $n$ bits each, attempt to compute some joint function of their inputs, $f:(\\{0,1\\}^{n})^{N}\\rightarrow\\{0,1\\}$ . In each round, $p$ parties ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments