Sciweavers

5665 search results - page 81 / 1133
» Introduction to Computer Security
Sort
View
SIAMCOMP
2011
13 years 3 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
CRYPTO
2011
Springer
222views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Computer-Aided Security Proofs for the Working Cryptographer
Abstract. We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic systems from proof sketches—compact, formal representations of the essence of a...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
IACR
2011
127views more  IACR 2011»
12 years 8 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
DPD
2000
71views more  DPD 2000»
13 years 8 months ago
A Secure Agent-based Framework for Internet Trading in Mobile Computing Environments
Most of the current Internet trading frameworks, in particular their negotiation and payment phases, are intended for customers frequently connected to the Internet during an entir...
Xun Yi, Chee Kheong Siew, Xiao Feng Wang, Eiji Oka...
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 9 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...