Author of the publication

Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages.

, , and . PODC, page 2-9. ACM, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Time-Free Authenticated Byzantine Consensus., and . NCA, page 140-146. IEEE Computer Society, (2010)A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges., , , and . J. Digit. Inf. Manag., 17 (4): 227 (2019)Cluster Head Recovery Algorithm for Wireless Sensor Networks., , and . CoDIT, page 1905-1910. IEEE, (2019)Limiting the Spread of Fake News on Social Networks by Users as Witnesses., , , and . ISCC, page 663-668. IEEE, (2023)A Hybrid Protocol to Solve Authenticated Byzantine Consensus., , , and . Fundam. Informaticae, 173 (1): 73-89 (2020)FDRA: Fault Detection and Recovery Algorithm for Wireless Sensor Networks., , and . MobiWIS, volume 10995 of Lecture Notes in Computer Science, page 72-85. Springer, (2018)Locating the Diffusion Source in Networks by Critical Observers., , , and . ISCC, page 543-548. IEEE, (2023)Byzantine Consensus with Few Synchronous Links., , and . OPODIS, volume 4878 of Lecture Notes in Computer Science, page 76-89. Springer, (2007)Modular randomized byzantine k-set agreement in asynchronous message-passing systems., , and . ICDCN, page 5:1-5:10. ACM, (2016)Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages., , and . PODC, page 2-9. ACM, (2014)