65 search results - page 2 / 13 » Two-Output Secure Computation with Malicious Adversaries |
CONEXT
2008
ACM
13 years 7 months ago
2008
ACM
Until recently, the design of packet dropping adversary identification protocols that are robust to both benign packet loss and malicious behavior has proven to be surprisingly el...
USS
2010
2010
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
13 years 3 months ago
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
CRYPTO
2008
Springer
13 years 7 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
CRYPTO
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
EUROCRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...