5476 search results - page 176 / 1096 » Resettably Secure Computation |
123
Voted
TGC
2007
Springer
15 years 10 months 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...
123
click to vote
CIS
2004
Springer
15 years 10 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...
112
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...
157
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...
137
click to vote
CCS
2001
ACM
15 years 9 months ago
2001
ACM
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...