Byzantine Agreement Using Partial Authentication

DOI10.1007/978-3-642-24100-0_38zbMath1350.68033OpenAlexW75522826MaRDI QIDQ3095344

Pranav Kumar Vasishta, Prasant Gopal, Piyush Bansal, Anuj Gupta, Kannan Srinathan

Publication date: 28 October 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_38

zbMATH Keywords

authenticationByzantine agreementgeneral networksreliable communication

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Distributed algorithms (68W15)

Related Items (2)

Unnamed Item ⋮ Byzantine Agreement Using Partial Authentication

Cites Work

• Unnamed Item
• Player simulation and general adversary structures in perfect multiparty computation
• Authenticated Algorithms for Byzantine Agreement
• Byzantine Agreement Using Partial Authentication
• Authenticated Byzantine Generals in Dual Failure Model
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again
• Perfectly secure message transmission
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

This page was built for publication: Byzantine Agreement Using Partial Authentication