5476 search results - page 92 / 1096 » Resettably Secure Computation |
113
Voted
SP
2010
IEEE
15 years 7 months ago
2010
IEEE
Trusting a computer for a security-sensitive task (such as checking email or banking online) requires the user to know something about the computer’s state. We examine research ...
140
click to vote
TROB
2002
2002
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
15 years 3 months ago
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
157
click to vote
CRYPTO
2007
Springer
15 years 10 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
124
click to vote
PKC
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
150
click to vote
CCS
2010
ACM
15 years 7 months ago
2010
ACM
Cloud computing has emerged as a multi-tenant resource sharing platform, which allows different service providers to deliver software as services in an economical way. However, fo...