469 search results - page 48 / 94 » On Adversary Models and Compositional Security |
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
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...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
When users run a group key exchange (GKE) protocol, they usually extract the key from some auxiliary (ephemeral) secret information generated during the execution. Strong corrupti...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
CRYPTO
2001
Springer
14 years 7 days ago
2001
Springer
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...