國立虎尾科技大學 |

Stabilization, Safety, and Security of Distributed Systems = 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Stabilization, Safety, and Security of Distributed Systems/ edited by Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernandez Anta.
其他題名:	24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings /
其他作者:	Fernandez Anta, Antonio.
面頁冊數:	X, 372 p. 79 illus., 55 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer Communication Networks. -
電子資源:	https://doi.org/10.1007/978-3-031-21017-4
ISBN:	9783031210174

Stabilization, Safety, and Security of Distributed Systems = 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings /
Stabilization, Safety, and Security of Distributed Systems24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings /[electronic resource] :edited by Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernandez Anta. - 1st ed. 2022. - X, 372 p. 79 illus., 55 illus. in color.online resource. - Lecture Notes in Computer Science,137511611-3349 ;. - Lecture Notes in Computer Science,9324.

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.

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.

ISBN: 9783031210174

Standard No.: 10.1007/978-3-031-21017-4doiSubjects--Topical Terms:

669310
Computer Communication Networks.

LC Class. No.: TK5105.5-5105.9

Dewey Class. No.: 004.6

Stabilization, Safety, and Security of Distributed Systems = 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings /
LDR:04259nam a22004095i 4500 001 1085300
003 DE-He213
005 20221108182347.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031210174 $9 978-3-031-21017-4
024 7 $a 10.1007/978-3-031-21017-4 $2 doi
035 $a 978-3-031-21017-4
050 4 $a TK5105.5-5105.9
072 7 $a UKN $2 bicssc
072 7 $a COM075000 $2 bisacsh
072 7 $a UKN $2 thema
082 0 4 $a 004.6 $2 23
245 1 0 $a Stabilization, Safety, and Security of Distributed Systems $h [electronic resource] : $b 24th International Symposium, SSS 2022, Clermont-Ferrand, France, November 15–17, 2022, Proceedings / $c edited by Stéphane Devismes, Franck Petit, Karine Altisen, Giuseppe Antonio Di Luna, Antonio Fernandez Anta.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a X, 372 p. 79 illus., 55 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Lecture Notes in Computer Science, $x 1611-3349 ; $v 13751
505 0 $a 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.
520 $a 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.
650 1 4 $a Computer Communication Networks. $3 669310
650 0 $a Computer networks . $3 1365720
700 1 $a Fernandez Anta, Antonio. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 815140
700 1 $a Di Luna, Giuseppe Antonio. $e editor. $1 https://orcid.org/0000-0002-7150-0972 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1391743
700 1 $a Altisen, Karine. $e editor. $1 https://orcid.org/0000-0001-8344-1853 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1391742
700 1 $a Petit, Franck. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 792477
700 1 $a Devismes, Stéphane. $e editor. $1 https://orcid.org/0000-0002-8032-9732 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1326174
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031210167
776 0 8 $i Printed edition: $z 9783031210181
830 0 $a Lecture Notes in Computer Science, $x 0302-9743 ; $v 9324 $3 1258960
856 4 0 $u https://doi.org/10.1007/978-3-031-21017-4
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)