Martin Hirt, Ueli Maurer  Home/Search
Context Related
| inf.ethz.ch/pub/publicat...toladv.ps.gz inf.ethz.ch/personal/hir...toladv.ps.gz cert.dfn.de/pub/docs/crypt/...toladv.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: cryptosoft.com/html/secpub (more) From: fermivista.math...ftp.cert.dfn.de (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We prove the necessary and sufficient conditions for the existence of secure multi-party protocols in terms of ... (Update)
Cited by: More
On Zigzag Functions and Related Objects in New Metric An.. - Ventzislav Nikov And (Correct)
Replication Predicates for Dependent-Failure Algorithms - Flavio Junqueira And (Correct)
Representing Small Identically Self-Dual Matroids By - Self-Dual Codes Carles (2005) (Correct)
Active bibliography (related documents): More All
1.0: Player Simulation and General Adversary Structures in Perfect.. - Hirt, Maurer (2000) (Correct)
0.5: Trading Correctness for Privacy in Unconditional.. - Fitzi, Hirt, Maurer (1998) (Correct)
0.5: Trading Correctness for Privacy in Unconditional.. - Fitzi, Hirt, Maurer (1998) (Correct)
Similar documents based on text: More All
0.4: General Adversaries in Unconditional Multi-Party Computation - Fitzi, Hirt, Maurer (1999) (Correct)
0.4: Efficient Byzantine Agreement Secure Against General.. - Fitzi, Maurer (1998) (Correct)
0.4: Efficient Multiparty Computations Secure Against.. - Cramer.. (1999) (Correct)
Related documents from co-citation: More All
24: Multiparty unconditionally secure protocols (context) - Chaum, Crepau et al. - 1988
18: Verifiable secret sharing and multiparty protocols with honest majority (context) - Rabin, Ben-Or - 1989
17: Completeness Theorems for noncryptographic fault-tolerant distributed computatio.. (context) - Ben-Or, Goldwasser et al. - 1988
BibTeX entry: (Update)
M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. In Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), pages 25--34, Aug. 1997. http://citeseer.ist.psu.edu/hirt97complete.html More
@inproceedings{ hirt97complete,
author = "Martin Hirt and Ueli M. Maurer",
title = "Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract)",
booktitle = "Symposium on Principles of Distributed Computing",
pages = "25-34",
year = "1997",
url = "citeseer.ist.psu.edu/hirt97complete.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Shostak et al. - 1982
287 Multiparty unconditionally secure protocols (context) - Chaum, Cr'epeau et al. - 1988
256 Reaching agreement in the presence of faults (context) - Pease, Shostak et al. - 1980
219 Completeness theorems for non-cryptographic fault-tolerant d.. (context) - Ben-Or, Goldwasser et al. - 1988
167 Protocols for secure computations (context) - Yao - 1982
127 Verifiable secret sharing and multiparty protocols with hone.. (context) - Rabin, Ben-Or - 1989
120 Secure computation (context) - Micali, Rogaway - 1991
98 How to play any mental game --- a completeness theorem for p.. (context) - Goldreich, Micali et al. - 1987
80 Studies in Secure Multiparty Computation and Applications - Canetti - 1995
78 Foundations of secure interactive computing (context) - Beaver - 1991
72 How to share a function securely (context) - Santis, Desmedt et al. - 1994
70 The design and implementation of a secure auction service - Franklin, Reiter - 1996
69 Adaptively secure multi-party computation - Canetti, Feige et al. - 1996
66 A zero-one law for Boolean privacy - Chor, Kushilevitz - 1989
56 Communication complexity of secure computation - Franklin, Yung - 1992
54 Privacy and communication complexity - Kushilevitz - 1989
54 Multi-authority secret-ballot elections with linear work - Cramer, Franklin et al. - 1996
53 A minimal model for secure computation - Feige, Kilian et al. - 1994
52 Multiparty computations ensuring privacy of each party's inp.. (context) - Chaum, Damg et al. - 1987
45 Optimal algorithms for Byzantine agreement (context) - Feldman, Micali - 1988
34 Cryptographic computation: Secure fault-tolerant protocols a.. (context) - Galil, Haber et al. - 1987
29 Incoercible multiparty computation - Canetti, Gennaro - 1996
22 Robust sharing of secrets when the dealer is honest or cheat.. (context) - Rabin - 1994
20 Complexity and Security of Distributed Protocols - Franklin - 1993
18 Committed oblivious transfer and private multi-party computa.. (context) - Cr'epeau, Graaf et al. - 1995
12 Theory and Practice of Verifiable Secret Sharing - Gennaro - 1996
10 The varieties of secure distributed computation (context) - Franklin, Yung - 1991
7 The spymasters double-agent problem (context) - Chaum - 1989
2 Erweiterte Zugriffstrukturen in Multi-PartyComputation (context) - Fitzi - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (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