In multi-party threshold private set intersection (PSI), n parties each with a private set wish to
compute the intersection of their sets if the intersection is sufficiently large. Previously …

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 …

In this work, we consider the natural goal of designing secret sharing schemes that ensure
security against an adversary who may learn some “leaked''information about all the shares …

In this work, we consider the natural goal of designing secret sharing schemes that ensure
security against a powerful adaptive adversary who may learn some``leaked''information …

In the set disjointess problem, we have k players, each with a private input X i⊆[n], and the
goal is for the players to determine whether or not their sets have a global intersection. The …

We consider a multiparty setting where k parties have private inputs X_1,…, X_k⊆[n] and
wish to compute the intersection⋂ _ {𝓁= 1}^ k X_𝓁 of their sets, using as little communication …

In the multiparty number-in-hand set disjointness problem, we have k players, with private
inputs X 1,…, X k⊆[n]. The players' goal is to check whether∩ ℓ= 1 k X ℓ=∅. It is known that …

In the multi-party set disjointness problem, k players receive private inputs in the form of sets
X 1,..., Xk⊆[n], and their goal is to check whether their sets intersect. The set intersection …

In this work we study bounded collusion protocols (BCPs) recently introduced in the context
of secret sharing by Kumar, Meka, and Sahai (FOCS 2019). These are multi-party …

Problems in the area of distributed computing have been extensively studied. In this paper,
we focus on the Distributed Thresholded Counting problem in the coordinator model. In this …