Sciweavers

Share
2 search results - page 1 / 1
» Information Theoretically Secure Multi Party Set Intersectio...
Sort
View
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
9 years 3 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
9 years 2 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
books