Sciweavers

Share
56 search results - page 1 / 12
» On the practical importance of communication complexity for ...
Sort
View
SAC
2009
ACM
9 years 3 months ago
On the practical importance of communication complexity for secure multi-party computation protocols
Many advancements in the area of Secure Multi-Party Computation (SMC) protocols use improvements in communication complexity as a justification. We conducted an experimental stud...
Florian Kerschbaum, Daniel Dahlmeier, Axel Schr&ou...
PKC
2016
Springer
71views Cryptology» more  PKC 2016»
3 years 4 months ago
Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
Adaptively secure Multi-Party Computation (MPC) is an essential and fundamental notion in cryptography. In this work, we construct Universally Composable (UC) MPC protocols that ar...
Ivan Damgård, Antigoni Polychroniadou, Vanis...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
9 years 2 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
9 years 13 days ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
9 years 2 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
books