Sciweavers

29908 search results - page 71 / 5982
» On the complexity of communication complexity
Sort
View
EUROCRYPT
1999
Springer
14 years 2 months ago
Computationally Private Information Retrieval with Polylogarithmic Communication
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
Christian Cachin, Silvio Micali, Markus Stadler
DAC
2006
ACM
14 years 4 months ago
Design in reliability for communication designs
Silicon design implementation has become increasingly complex with the deep submicron technologies such as 90nm and below. It is common to see multiple processor cores, several ty...
Uday Reddy Bandi, Murty Dasaka, Pavan K. Kumar
CIE
2008
Springer
14 years 4 days ago
Succinct NP Proofs from an Extractability Assumption
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
Giovanni Di Crescenzo, Helger Lipmaa
ACISP
2004
Springer
14 years 3 months ago
Single Database Private Information Retrieval with Logarithmic Communication
In this paper, we study the problem of single database private information retrieval, and present schemes with only logarithmic server-side communication complexity. Previously th...
Yan-Cheng Chang