On Expected Constant-Round Protocols for Byzantine Agreement
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 445-462
- https://doi.org/10.1007/11818175_27
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom GeneratorLecture Notes in Computer Science, 2005
- Resilient-optimal interactive consistency in constant timeDistributed Computing, 2003
- Cryptographic Protocols Provably Secure Against Dynamic AdversariesPublished by Springer Science and Business Media LLC ,2001
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Adaptively secure multi-party computationPublished by Association for Computing Machinery (ACM) ,1996
- The round complexity of secure protocolsPublished by Association for Computing Machinery (ACM) ,1990
- An O (log n ) expected rounds randomized byzantine generals protocolJournal of the ACM, 1987
- A Simple and Efficient Randomized Byzantine Agreement AlgorithmIEEE Transactions on Software Engineering, 1985
- Verifiable secret sharing and achieving simultaneity in the presence of faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Authenticated Algorithms for Byzantine AgreementSIAM Journal on Computing, 1983