111 search results - page 9 / 23 » Errors in Computational Complexity Proofs for Protocols |
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
PDCAT
2007
Springer
14 years 2 months ago
2007
Springer
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
STOC
1995
ACM
14 years 3 days ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
CRYPTO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
MOBIHOC
2004
ACM
14 years 8 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...