5476 search results - page 75 / 1096 » Resettably Secure Computation |
153
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
142
Voted
DEON
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. In this paper we present a logical model of trust in which trust is conceived as an expectation of the truster about some properties of the trustee. A general typology of...
113
Voted
PERVASIVE
2006
Springer
15 years 3 months ago
2006
Springer
The rich interaction capabilities of public terminals can make them more convenient to use than small personal devices, such as smart phones. However, the use of public terminals t...
143
Voted
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
136
Voted
SAINT
2005
IEEE
15 years 9 months ago
2005
IEEE
Pervasive user mobility, wireless connectivity and the widespread diffusion of portable devices raise new challenges for ubiquitous service provisioning. An emerging architecture ...