Enhancing efficiency of Byzantine-tolerant coordination protocols via hash functions

DOI10.1007/978-3-540-27866-5_77MaRDI QIDQ5311412zbMATH OpenOpenAlexFDO

Authors Daniela Tulone

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99409

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• Boosting the Efficiency of Byzantine-Tolerant Reliable Communication
• Efficient Byzantine Fault-Tolerance
• scientific article; zbMATH DE number 4085017
• Efficient algorithms for anonymous Byzantine agreement
• Resource-Efficient Byzantine Fault Tolerance
• Simple and efficient asynchronous Byzantine agreement with optimal resilience
• Improved extension protocols for Byzantine broadcast and agreement
• scientific article; zbMATH DE number 7774289
• Optimally efficient multi-valued byzantine agreement

Cited in

(1)

• Using an efficient hash chain and delaying function to improve an e-lottery scheme

This page was built for publication: Enhancing efficiency of Byzantine-tolerant coordination protocols via hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311412)