Sciweavers

106 search results - page 9 / 22
» Optimistic Fair Secure Computation
Sort
View
OTM
2007
Springer
14 years 3 months ago
Managing Pervasive Environment Privacy Using the "fair trade" Metaphor
Abstract. This article presents a proposal for managing privacy in pervasive environments. These environments are capable of sensing personal information anywhere and at anytime. T...
Abraham Esquivel, Pablo A. Haya, Manuel Garc&iacut...
PODC
2004
ACM
14 years 3 months ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...
PODC
2010
ACM
14 years 1 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
FOSSACS
2006
Springer
14 years 1 months ago
Guessing Attacks and the Computational Soundness of Static Equivalence
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
Martín Abadi, Mathieu Baudet, Bogdan Warins...
SOSP
2005
ACM
14 years 6 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...