A central server needs to perform statistical inference based on samples that are distributed
over multiple users who can each send a message of limited length to the center. We study …

For any unsatisfiable CNF formula F that is hard to refute in the Resolution proof system, we
show that a gadget-composed version of F is hard to refute in any proof system whose lines …

Given an alphabet size m∈N thought of as a constant, and ⃗k=(k_1,...,k_m) whose entries
sum of up n, the ⃗k-multi-slice is the set of vectors x∈m^n in which each symbol i∈m …

The task of manipulating correlated random variables in a distributed setting has received
attention in the fields of both Information Theory and Computer Science. Often shared …

Correlated secret randomness is a useful resource for secure computation protocols, often
enabling dramatic speedups compared to protocols in the plain model. This has motivated a …

In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …

A basic problem in information theory is the following: Let P=(X, Y) be an arbitrary
distribution where the marginals X and Y are (potentially) correlated. Let Alice and Bob be …

Correlated pairs of random variables are a central concept in information-theoretically
secure cryptography. Secure reductions between different correlations have been studied …

Abstract Secure Non-Interactive Reductions (SNIR) is a recently introduced, but fundamental
cryptographic primitive. The basic question about SNIRs is how to determine if there is an …

This paper considers a special class of nonlocal games (G,ψ), where G is a two-player one-
round game, and ψ is a bipartite state independent of G. In the game (G,ψ), the players are …