5484 search results - page 153 / 1097 » Almost-Everywhere Secure Computation |
118
click to vote
CIS
2004
Springer
15 years 9 months ago
2004
Springer
This paper presents a high performance service based mobile agent computation model. The scalability and reliability of this model is secured through the service clone policy and a...
111
click to vote
CANS
2008
Springer
15 years 6 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
166
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
141
click to vote
JOC
2000
15 years 3 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
153
click to vote
SOSP
2003
ACM
16 years 1 months ago
2003
ACM
We present a flexible architecture for trusted computing, called Terra, that allows applications with a wide range of security requirements to run simultaneously on commodity har...