1087 search results - page 71 / 218 » Distributed Oblivious Transfer |
125
click to vote
JOC
2008
15 years 2 months ago
2008
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
137
click to vote
CCS
2011
ACM
14 years 2 months ago
2011
ACM
We extend Goldberg’s multi-server information-theoretic private information retrieval (PIR) with a suite of protocols for privacypreserving e-commerce. Our first protocol adds ...
124
click to vote
HPDC
2005
IEEE
15 years 8 months ago
2005
IEEE
We present an algorithm for scheduling distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing da...
113
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
The overhead of copying data through the central processor by a message passing protocol limits data transfer bandwidth. If the network interface directly transfers the user'...
125
click to vote
CCS
2009
ACM
16 years 3 months ago
2009
ACM
In this paper, we re-visit the problem of unconditionally secure message transmission (USMT) from a sender S to a receiver R, who are part of a distributed synchronous network, mo...