1674 search results - page 208 / 335 » On the Optimality of the ARQ-DDF Protocol |
169
click to vote
EUROCRYPT
2004
Springer
15 years 11 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
176
click to vote
CLUSTER
2002
IEEE
15 years 11 months ago
2002
IEEE
Computational Grids are large scale computing system composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. T...
179
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
166
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Parallel programs that modify shared data in a cachecoherent multiprocessor with a write-invalidate coherence protocol create ownership overhead in the form of ownership acquisiti...
161
click to vote
KIVS
1999
Springer
15 years 10 months ago
1999
Springer
Abstract Charging schemes are needed to protect an integrated services network from arbitrary resource reservations and to create a funding mechanism to extend network capacity at ...