Sciweavers

588 search results - page 1 / 118
» Reducibility and Completeness in Private Computations
Sort
View
SIAMCOMP
2000
66views more  SIAMCOMP 2000»
13 years 4 months ago
Reducibility and Completeness in Private Computations
Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafai...
CRYPTO
2000
Springer
157views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
Private information retrieval (PIR) enables a user to retrieve a data item from a database, replicated among one or more servers, while hiding the identity of the retrieved item. ...
Amos Beimel, Yuval Ishai, Tal Malkin
JOC
2006
71views more  JOC 2006»
13 years 4 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
SIGCOMM
2012
ACM
11 years 7 months ago
DeTail: reducing the flow completion time tail in datacenter networks
Web applications have now become so sophisticated that rendering a typical page may require hundreds of intra-datacenter flows. At the same time, web sites must meet strict page ...
David Zats, Tathagata Das, Prashanth Mohan, Dhruba...