Sciweavers

621 search results - page 18 / 125
» Efficient Secure Multi-party Computation
Sort
View
EUROPAR
2008
Springer
13 years 11 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...
ESORICS
2008
Springer
13 years 11 months ago
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
Dan Bogdanov, Sven Laur, Jan Willemson
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 10 months ago
A Novel Scheme for Secured Data Transfer Over Computer Networks
: This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a `jigsaw puzzle&#...
Rangarajan Vasudevan, Ajith Abraham, Sugata Sanyal
TIT
2008
147views more  TIT 2008»
13 years 9 months ago
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special cla...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...
EUROCRYPT
1997
Springer
14 years 1 months ago
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers