172 search results - page 5 / 35 » Black-Box Constructions of Protocols for Secure Computation |
CRYPTO
2001
Springer
15 years 4 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...
103
click to vote
JCIT
2010
14 years 6 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
103
click to vote
EUROCRYPT
2008
Springer
15 years 1 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
101
click to vote
SCN
2010
Springer
14 years 10 months ago
2010
Springer
We consider a collection of related multiparty computation protocols that provide core operations for secure integer and fixed-point computation. The higher-level protocols offer...
104
click to vote
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
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...