Sciweavers

91 search results - page 11 / 19
» Multiparty Communication Complexity of Disjointness
Sort
View
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
13 years 8 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 1 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Communication and Round Efficient Information Checking Protocol
In this paper, we present a very important primitive called Information Checking Protocol (ICP) which plays an important role in constructing statistical Verifiable Secret Sharing...
Arpita Patra, C. Pandu Rangan
CC
2007
Springer
108views System Software» more  CC 2007»
13 years 7 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
ICDAR
2009
IEEE
14 years 2 months ago
A Collaborative Interface for Multimodal Ink and Audio Documents
With the increased availability of pen-based devices, it becomes interesting to conduct and to archive multi-party communication sessions that involve audio and digital ink on a s...
Amit Regmi, Stephen M. Watt