×

Found 62 Documents (Results 1–62)

Transparent batchable time-lock puzzles and applications to Byzantine consensus. (English) Zbl 07770268

Boldyreva, Alexandra (ed.) et al., Public-key cryptography – PKC 2023. 26th IACR international conference on practice and theory of public-key cryptography, Atlanta, GA, USA, May 7–10, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13940, 554-584 (2023).
MSC:  68P25 68N20 94A60
Full Text: DOI

Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries. (English) Zbl 07726566

Isobe, Takanori (ed.) et al., Progress in cryptology – INDOCRYPT 2022. 23rd international conference on cryptology in India, Kolkata, India, December 11–14, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13774, 223-248 (2023).
MSC:  68P25 68M25 94A60
Full Text: DOI

Brief announcement: Be prepared when network goes bad: an asynchronous view-change protocol. (English) Zbl 07824195

Korhonen, Janne H. (ed.), Proceedings of the 40th ACM symposium on principles of distributed computing, PODC ’21, virtual event, Italy, July 26–30, 2021. New York, NY: Association for Computing Machinery (ACM). 187-190 (2021).
MSC:  68M14 68W15

Location functions for self-stabilizing Byzantine tolerant swarms. (English) Zbl 1521.68219

Johnen, Colette (ed.) et al., Stabilization, safety, and security of distributed systems. 23rd international symposium, SSS 2021, virtual event, November 17–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13046, 229-242 (2021).
MSC:  68T40 68M14 68M15
Full Text: DOI

Brief announcement: Optimally-resilient unconditionally-secure asynchronous multi-party computation revisited. (English) Zbl 1540.68028

Attiya, Hagit (ed.), 34th international symposium on distributed computing, DISC 2020, virtual conference, October 12–16, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 179, Article 44, 3 p. (2020).
Full Text: DOI

Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots. (English) Zbl 1475.68395

Pinotti, Cristina M. (ed.) et al., Algorithms for sensor systems. 16th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2020, Pisa, Italy, September 9–10, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12503, 154-169 (2020).
MSC:  68T40 68R10 68W15

Fast Byzantine gathering with visibility in graphs. (English) Zbl 1475.68394

Pinotti, Cristina M. (ed.) et al., Algorithms for sensor systems. 16th international symposium on algorithms and experiments for wireless sensor networks, ALGOSENSORS 2020, Pisa, Italy, September 9–10, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12503, 140-153 (2020).
MSC:  68T40 68R10 68W15

Verification of randomized consensus algorithms under round-rigid adversaries. (English) Zbl 07649941

Fokkink, Wan (ed.) et al., 30th international conference on concurrency theory, CONCUR 2019, Amsterdam, the Netherlands, August 27–30, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 140, Article 33, 15 p. (2019).
MSC:  68Q85
Full Text: DOI

Brief announcement: Coded state machine – scaling state machine execution under Byzantine faults. (English) Zbl 1543.68051

Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 150-152 (2019).

A lower bound for adaptively-secure collective coin-flipping protocols. (English) Zbl 1508.68123

Schmid, Ulrich (ed.) et al., 32nd international symposium on distributed computing, DISC 2018, New Orleans, Louisiana, USA, October 15–19, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 121, Article 34, 16 p. (2018).
Full Text: DOI

Synthesis of distributed algorithms with parameterized threshold guards. (English) Zbl 1487.68252

Aspnes, James (ed.) et al., 21st international conference on principles of distributed systems, OPODIS 2017, Lisboa, Portugal, December 18–20, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 95, Article 32, 20 p. (2018).
Full Text: DOI

Self-stabilising Byzantine clock synchronisation is almost as easy as consensus. (English) Zbl 1515.68070

Richa, Andréa W. (ed.), 31st international symposium on distributed computing, DISC 2017, Vienna, Austria, October 16–20, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 91, Article 32, 15 p. (2017).
MSC:  68M14 68M15
Full Text: DOI

A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms. (English) Zbl 1380.68278

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 719-734 (2017).
MSC:  68Q60 68W15

Search on a line by Byzantine robots. (English) Zbl 1398.68651

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 27, 12 p. (2016).

Brahms, Byzantine resilient random membership sampling. (English) Zbl 1301.68250

Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 145-154 (2008).
Full Text: DOI

Tolerating corrupted communication. (English) Zbl 1283.68079

Proceedings of the 26th annual ACM symposium on principles of distributed computing, PODC ’07, Portland, OR, USA, August 12–15, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-616-5). 244-253 (2007).

Random oracles in constantipole, practical asynchronous Byzantine agreement using cryptography (extended abstract). (English) Zbl 1314.68074

Proceedings of the 19th annual ACM symposium on principles of distributed computing, PODC ’00, Portland, OR, USA, July 16–19, 2000. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-183-6). 123-132 (2000).
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software