6861 search results - page 303 / 1373 » Security for Ubiquitous Computing |
144
click to vote
TGC
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
145
click to vote
CIS
2004
Springer
15 years 11 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...
133
click to vote
CANS
2008
Springer
15 years 8 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...
196
click to vote
FOCS
2010
IEEE
15 years 4 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...
173
click to vote
JOC
2000
15 years 6 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...