Sciweavers

6195 search results - page 143 / 1239
» Cloud Computing Security
Sort
View
EUROPAR
2008
Springer
15 years 5 months ago
Building Secure Resources to Ensure Safe Computations in Distributed and Potentially Corrupted Environments
Abstract. Security and fault-tolerance is a big issue for intensive parallel computing in pervasive environments with hardware errors or malicious acts that may alter the result. I...
Sébastien Varrette, Jean-Louis Roch, Guilla...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 4 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 4 months ago
Bounded-concurrent secure multi-party computation with a dishonest majority
We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number ...
Rafael Pass
STOC
2007
ACM
102views Algorithms» more  STOC 2007»
16 years 4 months ago
Zero-knowledge from secure multiparty computation
A zero-knowledge proof allows a prover to convince a verifier of an assertion without revealing any further information beyond the fact that the assertion is true. Secure multipar...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
EUROCRYPT
2007
Springer
15 years 8 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo