Sciweavers

404 search results - page 13 / 81
» Robust Multiparty Computation with Linear Communication Comp...
Sort
View
ASIACRYPT
2010
Springer
13 years 5 months ago
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Private Set Intersection (PSI) protocols allow one party ("client") to compute an intersection of its input set with that of another party ("server"), such tha...
Emiliano De Cristofaro, Jihye Kim, Gene Tsudik
LCN
2006
IEEE
14 years 1 months ago
Landscape-3D; A Robust Localization Scheme for Sensor Networks over Complex 3D Terrains
— Despite the fact that sensor networks could often be deployed over three-dimensional (3D) terrains, most approaches on sensor localizations are designed and evaluated consideri...
Liqiang Zhang, Xiaobo Zhou, Qiang Cheng
TWC
2008
121views more  TWC 2008»
13 years 7 months ago
Optimal Downlink OFDMA Resource Allocation with Linear Complexity to Maximize Ergodic Rates
OFDMA resource allocation assigns subcarriers and power, and possibly data rates, to each user. Previous research efforts to optimize OFDMA resource allocation with respect to comm...
Ian C. Wong, Brian L. Evans
STOC
2004
ACM
152views Algorithms» more  STOC 2004»
14 years 7 months ago
Exponential separation of quantum and classical one-way communication complexity
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
ECCC
2011
202views ECommerce» more  ECCC 2011»
13 years 2 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain