Unconditional Byzantine Agreement with good majority-Reference-Cited by-同舟云学术

Unconditional Byzantine Agreement with good majority

Published: Issue: Volume: Page:285-295
ISSN:
Container-title:STACS 91
language:
Short-container-title:

Author:

Baum-Waidner Birgit,Pfitzmann Birgit,Waidner Michael

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0020806.pdf

Reference18 articles.

1. Michael Ben-Or, Shafi Goldwasser, Avi Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation; 20th STOC, ACM, New York 1988, 1–10.

2. G. R. Blakley: Safeguarding cryptographic keys; AFIPS Conference Proceedings Vol. 48, National Computer Conference (NCC) 1979, 313–317.

3. Andrei Z. Broder, Danny Dolev: Flipping coins in many pockets (Byzantine agreement on uniformly random values); 25th FOCS, IEEE Computer Society, 1984, 157–170.

4. Benny Chor, Shafi Goldwasser, Silvio Micali, Baruch Awerbuch: Verifiable secret sharing and achieving simultaneity in the presence of faults; 26th FOCS, IEEE Computer Society, 1985, 383–395.

5. David Chaum, Claude Crépeau, Ivan Damgård: Multiparty unconditional secure protocols; 20th STOC, ACM, New York 1988, 11–19.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Byzantine Agreement with a Rational Adversary;Automata, Languages, and Programming;2012

2. Player-Centric Byzantine Agreement;Automata, Languages and Programming;2011

3. Adaptively Secure Broadcast;Advances in Cryptology – EUROCRYPT 2010;2010

4. On Complete Primitives for Fairness;Theory of Cryptography;2010

5. Two-Threshold Broadcast and Detectable Multi-party Computation;Lecture Notes in Computer Science;2003