Ueli Maurer Department of Computer Science ETH Zurich CH-8092 Zurich,...  Home/Search
Context Related
| inf.ethz.ch/pub/crypto/p...Maurer02b.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: crypto.ethz.ch/~ma...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A simple approach to secure multi-party computation is presented. (Update)
Context of citations to this paper: More
...by considering an adversary who may corrupt some subset of the players. One can distinguish between passive and active corruption, see [8, 14] for recent results. Passive corruption means that the adversary obtains the complete information held by the corrupted players, but the...
...information about it (the sets in is not tight. Furthermore, it would lead to more general necessary conditions on (#, for secure MPC [23, 35], in contrast to the Q and Q conditions considered here. consistent with s A and s and those consistent with s A and s # . Therefore, s...
Cited by: More
Secure Multi-Party Computation with Security Modules - Benenson, Gärtner, Kesdogan (2004) (Correct)
Secure Multi-party Computation for selecting a solution according .. - Silaghi (2004) (Correct)
Secure Multi-Player Protocols: Fundamentals, Generality, and.. - Fehr (2003) (Correct)
Active bibliography (related documents): More All
0.5: Efficient Multiparty Computations Secure Against.. - Cramer.. (1999) (Correct)
0.4: General Secure Multi-Party Computation from any Linear .. - Cramer.. (1999) (Correct)
0.4: Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (Correct)
Similar documents based on text: More All
0.3: Unconditional Security Against Memory-Bounded Adversaries - Cachin, Maurer (1997) (Correct)
0.3: Cryptography 2000 ± 10 - Maurer (Correct)
0.3: Span Programs and General Secure Multi-Party Computation - Cramer, Damgård, Maurer (1997) (Correct)
Related documents from co-citation: More All
5: Completeness Theorems for NonCryptographic Fault-Tolerant Distributed Computatio.. (context) - BenOr, Goldwasser et al. - 1988
4: General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme - Cramer, Damgard et al. - 1999
3: How to Share a Secret (context) - Shamir - 1979
BibTeX entry: (Update)
U. Maurer, Secure Multi-Party Computation Made Simple, 3rd Conference on Security in Communication Networks, September 12-13, http://citeseer.ist.psu.edu/624951.html More
@misc{ maurer-secure,
author = "U. Maurer",
title = "Secure Multi-Party Computation Made Simple",
text = "U. Maurer, Secure Multi-Party Computation Made Simple, 3rd Conference on
Security in Communication Networks, September 12-13,",
url = "citeseer.ist.psu.edu/624951.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
287 Multi-party unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988
179 Security and composition of multi-party cryptographic protoc.. - Canetti - 2000
177 Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al. - 1988
127 Verifiable secret-sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989
98 How to play any mental game --- a completeness theorem for p.. (context) - Goldreich, Micali et al. - 1987
91 Secret-sharing scheme realizing general access structure (context) - Ito, Saito et al. - 1987
90 Secure multi-party protocols and zero-knowledge proof system.. (context) - Beaver - 1991
45 General secure multi-party computation from any linear secre.. - Cramer, Damgard et al. - 2000
40 Player simulation and general adversary structures in perfec.. - Hirt, Maurer - 2000
39 Complete characterization of adversaries tolerable in secure.. - Hirt, Maurer - 1997
28 An optimal probabilistic protocol for synchronous Byzantine .. (context) - Feldman, Micali - 1997
26 Towards optimal distributed consensus (context) - Berman, Garay et al. - 1989
19 Secure Reactive Systems - Pfitzmann, Schunter et al. - 2000
16 rd IEEE Symposium on the Foundations of Computer Science (context) - Yao, secure et al. - 1982
11 Robustness for free in unconditional multi-party computation - Hirt, Maurer - 2001
8 Efficient multi-party computations with dishonest minority (context) - Cramer, Damgard et al. - 1999
6 Efficient Byzantine agreement secure against general adversa.. - Fitzi, Maurer - 1998
6 General adversaries in unconditional multi-party computation - Fitzi, Hirt et al. - 1999
4 Quorum-based multi-party computations (context) - Beaver, Wool - 1998
2 Secure computation: The information theoretic case (context) - Micali, Rogaway - 1991
1 Linear VSS and Distributed Commitment Schemes Based on Secre.. (context) - Fehr, Maurer - 2002
1 Trading correctness for secrecy in unconditional multi-party.. (context) - Fitzi, Hirt et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.crypto.ethz.ch/~maurer/publications.html): More
Cryptography 2000 ± 10 - Maurer (Correct)
Perfect Cryptographic Security from Partially Independent Channels - Maurer (1991) (Correct)
Robustness for Free in Unconditional Multi-Party Computation - Hirt, Maurer (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC