Sciweavers

5484 search results - page 24 / 1097
» Almost-Everywhere Secure Computation
Sort
View
EUROCRYPT
2007
Springer
15 years 3 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
PODC
2010
ACM
15 years 3 months ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer
SIGCOMM
2012
ACM
13 years 2 months ago
Dismantling intrusion prevention systems
This paper introduces a serious security problem that people believe has been fixed, but which is still very much existing and evolving, namely evasions. We describe how protocols...
Olli-Pekka Niemi, Antti Levomäki, Jukka Manne...
CRYPTO
2012
Springer
247views Cryptology» more  CRYPTO 2012»
13 years 2 months ago
Black-Box Constructions of Composable Protocols without Set-Up
Abstract. We present the first black-box construction of a secure multiparty computation protocol that satisfies a meaningful notion of concurrent security in the plain model (wi...
Huijia Lin, Rafael Pass
PDCAT
2007
Springer
15 years 6 months ago
Incorporating Security Requirements into Communication Protocols in Multi-agent Software Systems
A communication protocol is a fundamental component of a multi-agent system. The security requirements for a communication protocol should be articulated during the early stages o...
Yuxiu Luo, Giannakis Antoniou, Leon Sterling