102 search results - page 3 / 21 » Perfectly Secure Multiparty Computation and the Computationa... |
EUROCRYPT
2004
Springer
13 years 10 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. We consider the question of adaptive security for two related cryptographic primitives: all-or-nothing transforms and exposureresilient functions. Both are concerned with...
APNOMS
2007
Springer
2007
Springer
On a Low Security Overhead Mechanism for Secure Multi-path Routing Protocol in Wireless Mesh Network
13 years 11 months ago
Secure multi-path routing is a critical issue in security management of WMNs due to its multi-hop nature as each node takes part in routing mechanism making it prone to routing att...
CCS
2008
ACM
13 years 7 months ago
2008
ACM
We present FairplayMP (for "Fairplay Multi-Party"), a system for secure multi-party computation. Secure computation is one of the great achievements of modern cryptograp...