Sciweavers

112 search results - page 15 / 23
» Rounds in Communication Complexity Revisited
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
INFOCOM
2008
IEEE
14 years 2 months ago
Algorithms for Low-Latency Remote File Synchronization
The remote file synchronization problem is how to update an outdated version of a file located on one machine to the current version located on another machine with a minimal am...
Hao Yan, Utku Irmak, Torsten Suel
PODC
2011
ACM
12 years 10 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
CCS
2004
ACM
14 years 1 months ago
Private inference control
Access control can be used to ensure that database queries pertaining to sensitive information are not answered. This is not enough to prevent users from learning sensitive inform...
David P. Woodruff, Jessica Staddon
32
Voted
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 2 months ago
Optimal Scheduling Policy Determination for High Speed Downlink Packet Access
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadar...