Matthias Fitzi, Ueli Maurer  Home/Search
Context Related
| helios.cti.gr/disc/postsc...14990136.ps sor.inria.fr/mirrors/disc...14990136.ps inf.ethz.ch/pub/publicati...FitMau98.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: helios.cti.gr/disc/program (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Matthias Fitzi and Ueli Maurer Department of Computer Science Swiss Federal Institute of Technology (ETH), Zurich CH-8092 Zurich, Switzerland, ffitzi,maurerg@inf.ethz.ch Abstract. This paper presents protocols for Byzantine agreement, i.e. for reliable broadcast, among a set of n players, some of which may be controlled by an adversary. It is well-known that Byzantine agreement is possible if and only if the number of cheaters is less than n=3. In this paper we consider a general adversary... (Update)
Context of citations to this paper: More
.... (Byzantine agreement) they provide the first nonthreshold broadcast protocol, as required for example in [CDM98] where later solutions [FM98] are more efficient) Applying the results to verifiable secret sharing, they provide a nonthreshold verifiable secret sharing scheme as...
.... we do not assume that such a channel is given for free as part of the model, however it can efficiently be simulated using the protocol of [18] that is secure against any given Q 3 adversary structure. Let M be an MSP computing a Q 2 (or Q 3 ) function f . We will assume for...
Cited by: More
Multiparty Computations - Information-Theoretically Secure.. - Dziembowski (2001) (Correct)
Secure Multi-Party Computation Made Simple - Ueli Maurer Department (Correct)
Linear VSS and Distributed Commitments Based on Secret Sharing .. - Fehr, Maurer (2002) (Correct)
Active bibliography (related documents): More All
0.3: Security and Composition of Multi-party Cryptographic Protocols - Canetti (1999) (Correct)
0.2: From Partial Consistency to Global Broadcast - Fitzi, Maurer (Correct)
0.2: Distributed Consensus Revisited - Neiger (1993) (Correct)
Similar documents based on text: More All
0.6: Detectable Byzantine Agreement Secure Against Faulty.. - Fitzi, Gottesman.. (2002) (Correct)
0.6: Minimal Complete Primitives for Secure Multi-Party.. - Fitzi, Garay, Maurer.. (2001) (Correct)
0.6: Extended Validity and Consistency in Byzantine Agreement - Fitzi, Hirt, Holenstein, .. (2002) (Correct)
Related documents from co-citation: More All
5: Complete characterization of adversaries tolerable in secure multi-party computa.. - Hirt, Maurer - 1997
5: Secret Sharing Scheme Realizing General Access Structure (context) - Ito, Saito et al. - 1987
5: Verifiable secret sharing and multiparty protocols with honest majority (context) - Rabin, Ben-Or - 1989
BibTeX entry: (Update)
M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In Distributed Computing --- DISC '98, volume 1499 of Lecture Notes in Computer Science, Sept. 1998. http://citeseer.ist.psu.edu/fitzi98efficient.html More
@inproceedings{ fitzi98efficient,
author = "Matthias Fitzi and Ueli M. Maurer",
title = "Efficient Byzantine Agreement Secure Against General Adversaries",
booktitle = "International Symposium on Distributed Computing",
pages = "134-148",
year = "1998",
url = "citeseer.ist.psu.edu/fitzi98efficient.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
141 Byzantine quorum systems - Malkhi, Reiter - 1997
73 A lower bound on the time to assure interactive consistency - Fischer, Lynch - 1982
45 Optimal algorithms for Byzantine agreement (context) - Feldman, Micali - 1988
39 Complete characterization of adversaries tolerable in secure.. - Hirt, Maurer - 1997
26 Towards optimal distributed consensus (context) - Berman, Garay et al. - 1989
18 Shifting gears: Changing algorithms on the fly to expedite B.. (context) - Bar-Noy, Dolev et al. - 1987
14 An efficient algorithm for Byzantine agreement without authe.. - Dolev, Fischer et al. - 1982
12 Fully polynomial Byzantine agreement in t + 1 rounds (context) - Garay, Moses - 1993
3 Span programs and general secure multi-party computation - Cramer, Damgard et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://helios.cti.gr/disc/program.htm): More
The Bancomat Problem: An Example of Resource Allocation in a .. - Sussman, Marzullo (1998) (Correct)
Long-lived, Fast, Waitfree Renaming with Optimal.. - Eberly, Higham.. (Correct)
Approximate Agreement with Mixed Mode Faults: Algorithm and.. - Plunkett, Fekete (1998) (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