Devismes / Petit / Altisen | Stabilization, Safety, and Security of Distributed Systems | E-Book | sack.de
E-Book

E-Book, Englisch, 372 Seiten

Reihe: Lecture Notes in Computer Science

Devismes / Petit / Altisen Stabilization, Safety, and Security of Distributed Systems

24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings
1. Auflage 2022
ISBN: 978-3-031-21017-4
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark

24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings

E-Book, Englisch, 372 Seiten

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-031-21017-4
Verlag: Springer International Publishing
Format: PDF
Kopierschutz: 1 - PDF Watermark



This book constitutes the proceedings of 24th International Symposium, SSS 2022, which took place in Clermont-Ferrand, France, in November 2022.

The 17 regular papers together with 4 invited papers and 7 brief announcements,  included in this volume were carefully reviewed and selected from 58 submissions. The SSS 2022 focus on systems built such that they are able to provide on their own guarantees on their structure, performance, and/or security in the face of an adverse environment. The Symposium presents three tracks reflecting major trends related to the conference: (i) Self-stabilizing Systems: Theory and Practice, (ii) Concurrent and Distributed Computing: Foundations, Faulttolerance, and Security, and (iii) Dynamic, Mobile, and Nature-Inspired Computing.

Devismes / Petit / Altisen Stabilization, Safety, and Security of Distributed Systems jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust Applications.- The Limits of Helping in Non-Volatile Memory Data Structures Treasure Hunt in Graph using Pebbles.- Blockchain in Dynamic Networks.- Improving the Efficiency of Report and Trace Ring Signatures.- Flexible Scheduling of Transactional Memory on Trees.- Invited Paper: Simple, strict, proper, happy: A study of reachability in temporal graphs.- Brief Announcement: Dynamic graph models for the Bitcoin P2P network: simulation analysis for expansion and flooding time.- Brief Announcement: Self Masking for Hardening Inversions.- Perpetual Torus Exploration by Myopic Luminous Robots.- Optimal Algorithms for Synchronous Byzantine k-Set Agreement.- Reaching Consensus in the Presence of Contention-Related Crash Failures.- Self-stabilizing Byzantine Fault-tolerant Repeated Reliable Broadcast.- Capacity Planning for Dependable Services.- Lower bound for constant-size local certification.- Collaborative Dispersion by Silent Robots.- Time Optimal Gathering of Myopic Robots on an Infinite Triangular Grid.- Brief Announcement: Lattice Linear Algorithms.- Brief Announcement: Distributed Reconfiguration of Spanning Trees.- Brief Announcement: Mutually-visible Uniform Circle Formation by Asynchronous Mobile Robots on Grid Plane.- Brief Announcement: Self-stabilizing Total-order Broadcast.- Brief Announcement: Secure And Efficient Participant Authentication — Application to Mobile E-voting.- Card-Based ZKP Protocol for Nurimisaki.- Invited Paper: One Bit Agent Memory is Enough for Snap-stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles Consensus on Demand.- Better Incentives for Proof-of-Work.- Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation.- Invited Paper: Cross-Chain State Machine Replication.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.