{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T13:09:50Z","timestamp":1775135390200,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002835","name":"Chalmers University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002835","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the problem of privately emulating shared memory in message-passing networks. The system includes clients that store and retrieve replicated information on<jats:italic>N<\/jats:italic>servers, out of which<jats:italic>e<\/jats:italic>are<jats:italic>data-corrupting malicious<\/jats:italic>. When a client accesses a data-corrupting malicious server, the data field of that server response might be different from the value it originally stored. However, all other control variables in the server reply and protocol actions are according to the server algorithm. For the coded atomic storage algorithms by Cadambe et al., we present an enhancement that ensures no information leakage and data-corrupting malicious fault-tolerance. We also consider recovery after the occurrence of transient faults that violate the assumptions according to which the system was designed to operate. After their last occurrence, transient faults leave the system in an arbitrary state (while the program code stays intact). We present a self-stabilizing algorithm, which recovers after the occurrence of transient faults. This addition to Cadambe et al. considers asynchronous settings as long as no transient faults occur. The recovery from transient faults that bring the system counters (close) to their maximal values may include the use of a global reset procedure, which requires the system run to be controlled by a fair scheduler. After the recovery period, the safety properties are provided for asynchronous system runs that are not necessarily controlled by fair schedulers. Since the recovery period is bounded and the occurrence of transient faults is extremely rare, we call this design criteria self-stabilization in the presence of seldom fairness. Our self-stabilizing algorithm uses a bounded amount of storage during asynchronous executions (that are not necessarily controlled by fair schedulers). To the best of our knowledge, we are the first to address privacy, data-corrupting malicious behavior, and self-stabilization in the context of emulating atomic shared memory in message-passing systems.<\/jats:p>","DOI":"10.1007\/s00453-022-01023-w","type":"journal-article","created":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T08:03:01Z","timestamp":1660982581000},"page":"216-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Self-Stabilizing and Private Distributed Shared Atomic Memory in Seldomly Fair Message Passing Networks"],"prefix":"10.1007","volume":"85","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Petig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3258-3696","authenticated-orcid":false,"given":"Elad M.","family":"Schiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,20]]},"reference":[{"issue":"4","key":"1023_CR1","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.jcss.2014.11.014","volume":"81","author":"N Alon","year":"2015","unstructured":"Alon, N., Attiya, H., Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4), 692\u2013701 (2015)","journal-title":"J. Comput. Syst. Sci."},{"key":"1023_CR2","doi-asserted-by":"crossref","unstructured":"Androulaki, E., Cachin, C., Dobre, D., Vukolic, M.: Erasure-coded Byzantine storage with separate metadata. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) Principles of Distributed Systems\u201418th International Conference, OPODIS 2014, Cortina d\u2019Ampezzo, Italy, December 16\u201319, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8878, pp. 76\u201390. Springer (2014)","DOI":"10.1007\/978-3-319-14472-6_6"},{"key":"1023_CR3","doi-asserted-by":"crossref","unstructured":"Arora, A., Gouda, M.G.: Closure and convergence: a formulation of fault-tolerant computing. In: FTCS, pp. 396\u2013403. IEEE Computer Society (1992)","DOI":"10.1109\/FTCS.1992.243596"},{"key":"1023_CR4","first-page":"99","volume":"100","author":"H Attiya","year":"2010","unstructured":"Attiya, H.: Robust simulation of shared memory: 20 years after. Bull. EATCS 100, 99\u2013113 (2010)","journal-title":"Bull. EATCS"},{"issue":"1","key":"1023_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing memory robustly in message-passing systems. J. ACM (JACM) 42(1), 124\u2013142 (1995)","journal-title":"J. ACM (JACM)"},{"key":"1023_CR6","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G., Dolev, S.: Self-stabilization by local checking and global reset (extended abstract). In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) Distributed Algorithms, 8th International Workshop, WDAG \u201994, Terschelling, The Netherlands, September 29\u2013October 1, 1994, Proceedings, Lecture Notes in Computer Science, vol. 857, pp. 326\u2013339. Springer (1994)","DOI":"10.1007\/BFb0020443"},{"key":"1023_CR7","doi-asserted-by":"publisher","first-page":"170404","DOI":"10.1109\/ACCESS.2020.3024254","volume":"8","author":"Z Bao","year":"2020","unstructured":"Bao, Z., Wang, Q., Shi, W., Wang, L., Lei, H., Chen, B.: When blockchain meets SGX: an overview, challenges, and open issues. IEEE Access 8, 170404\u2013170420 (2020)","journal-title":"IEEE Access"},{"key":"1023_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th Symp. on Theory of Computing, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"1023_CR9","doi-asserted-by":"crossref","unstructured":"Blanchard, P., Dolev, S., Beauquier, J., Dela\u00ebt, S.: Practically self-stabilizing Paxos replicated state-machine. In: Noubir, G., Raynal, M. (eds.) Networked Systems\u2014Second International Conference, NETYS 2014, Marrakech, Morocco, May 15\u201317, 2014. Revised Selected Papers, Lecture Notes in Computer Science, vol. 8593, pp. 99\u2013121. Springer (2014)","DOI":"10.1007\/978-3-319-09581-3_8"},{"key":"1023_CR10","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Dolev, S., Potop-Butucaru, M., Raynal, M.: Stabilizing server-based storage in Byzantine asynchronous message-passing systems: extended abstract. In: Georgiou, C., Spirakis, P.G. (eds.) Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\u00e1n, Spain, July 21\u201323, 2015, pp. 471\u2013479. ACM (2015). http:\/\/dl.acm.org\/citation.cfm?id=2767386","DOI":"10.1145\/2767386.2767441"},{"key":"1023_CR11","doi-asserted-by":"crossref","unstructured":"Bonomi, S., Pozzo, A.D., Potop-Butucaru, M., Tixeuil, S.: Brief announcement: Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps. In: SSS, Lecture Notes in Computer Science, vol. 11201, pp. 398\u2013403. Springer (2018)","DOI":"10.1007\/978-3-030-03232-6_28"},{"issue":"1","key":"1023_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02278854","volume":"7","author":"JE Burns","year":"1993","unstructured":"Burns, J.E., Gouda, M.G., Miller, R.E.: Stabilization and pseudo-stabilization. Distrib. Comput. 7(1), 35\u201342 (1993)","journal-title":"Distrib. Comput."},{"key":"1023_CR13","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded Byzantine distributed storage. In: 2006 International Conference on Dependable Systems and Networks (DSN 2006), 25\u201328 June 2006, Philadelphia, Pennsylvania, USA, Proceedings, pp. 115\u2013124. IEEE Computer Society (2006). http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=10881"},{"key":"1023_CR14","doi-asserted-by":"crossref","unstructured":"Cadambe, V.R., Wang, Z., Lynch, N.A.: Information-theoretic lower bounds on the storage cost of shared memory emulation. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25\u201328, 2016, pp. 305\u2013313 (2016)","DOI":"10.1145\/2933057.2933118"},{"issue":"1","key":"1023_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-016-0275-x","volume":"30","author":"VR Cadambe","year":"2017","unstructured":"Cadambe, V.R., Lynch, N.A., M\u00e9dard, M., Musial, P.M.: A coded shared atomic memory algorithm for message passing architectures. Distrib. Comput. 30(1), 49\u201373 (2017)","journal-title":"Distrib. Comput."},{"key":"1023_CR16","doi-asserted-by":"crossref","unstructured":"Cadambe, V.R., Nicolaou, N.C., Konwar, K.M., Prakash, N., Lynch, N.A., M\u00e9dard, M.: ARES: adaptive, reconfigurable, erasure coded, atomic storage (2018). CoRR arXiv:1805.03727","DOI":"10.1109\/ICDCS.2019.00216"},{"issue":"11","key":"1023_CR17","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"1023_CR18","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"1023_CR19","doi-asserted-by":"crossref","unstructured":"Dolev, S., Herman, T.: Dijkstra\u2019s self-stabilizing algorithm in unsupportive environments. In: Datta, A.K., Herman, T. (eds.) Self-Stabilizing Systems, 5th International Workshop, WSS 2001, Lisbon, Portugal, October 1\u20132, 2001, Proceedings, Lecture Notes in Computer Science, vol. 2194, pp. 67\u201381. Springer (2001)","DOI":"10.1007\/3-540-45438-1_5"},{"issue":"4","key":"1023_CR20","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1109\/71.588622","volume":"8","author":"S Dolev","year":"1997","unstructured":"Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Trans. Parallel Distrib. Syst. 8(4), 424\u2013440 (1997)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"8","key":"1023_CR21","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1016\/j.jcss.2010.05.005","volume":"76","author":"S Dolev","year":"2010","unstructured":"Dolev, S., Kat, R.I., Schiller, E.M.: When consensus meets self-stabilization. J. Comput. Syst. Sci. 76(8), 884\u2013900 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"18","key":"1023_CR22","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.ipl.2011.06.010","volume":"111","author":"S Dolev","year":"2011","unstructured":"Dolev, S., Dubois, S., Potop-Butucaru, M., Tixeuil, S.: Stabilizing data-link over non-FIFO channels with optimal fault-resilience. Inf. Process. Lett. 111(18), 912\u2013920 (2011)","journal-title":"Inf. Process. Lett."},{"key":"1023_CR23","doi-asserted-by":"crossref","unstructured":"Dolev, S., Dubois, S., Potop-Butucaru, M.G., Tixeuil, S.: Crash resilient and pseudo-stabilizing atomic registers. In: Baldoni, R., Flocchini, P., Ravindran, B. (eds.) Principles of Distributed Systems, 16th International Conference, OPODIS 2012, Rome, Italy, December 18\u201320, 2012. Proceedings, Lecture Notes in Computer Science, vol. 7702, pp. 135\u2013150. Springer (2012)","DOI":"10.1007\/978-3-642-35476-2_10"},{"key":"1023_CR24","doi-asserted-by":"crossref","unstructured":"Dolev, S., Hanemann, A., Schiller, E.M., Sharma, S.: Self-stabilizing end-to-end communication in (bounded capacity, omitting, duplicating and non-FIFO) dynamic networks. In: Stabilization, Safety, and Security of Distributed Systems\u201414th Int. Sym., SSS 2012, LNCS, vol .7596, pp. 133\u2013147. Springer (2012)","DOI":"10.1007\/978-3-642-33536-5_14"},{"key":"1023_CR25","doi-asserted-by":"crossref","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Practically stabilizing virtual synchrony (2015). CoRR arXiv:1502.05183","DOI":"10.1007\/978-3-319-21741-3_17"},{"key":"1023_CR26","doi-asserted-by":"crossref","unstructured":"Dolev, S., Petig, T., Schiller, E.M.: Brief announcement: robust and private distributed shared atomic memory in message passing networks. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\u00e1n, Spain, July 21\u201323, 2015, pp. 311\u2013313 (2015)","DOI":"10.1145\/2767386.2767450"},{"key":"1023_CR27","doi-asserted-by":"crossref","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Self-stabilizing reconfiguration. In: Middleware Posters and Demos, pp. 13\u201314. ACM (2016)","DOI":"10.1145\/3007592.3007600"},{"key":"1023_CR28","doi-asserted-by":"crossref","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Self-stabilizing reconfiguration. In: NETYS, Lecture Notes in Computer Science, vol. 10299, pp. 51\u201368 (2017), the complementary technical report can be found at CoRR arXiv:1606.00195","DOI":"10.1007\/978-3-319-59647-1_5"},{"key":"1023_CR29","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jcss.2018.04.003","volume":"96","author":"S Dolev","year":"2018","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Practically-self-stabilizing virtual synchrony. J. Comput. Syst. Sci. 96, 50\u201373 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"1023_CR30","unstructured":"Dolev, S., Petig, T., Schiller, E.M.: Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks (2018). CoRR arXiv:1806.03498"},{"issue":"8","key":"1023_CR31","doi-asserted-by":"publisher","first-page":"3752","DOI":"10.1137\/090757010","volume":"39","author":"P Dutta","year":"2010","unstructured":"Dutta, P., Guerraoui, R., Levy, R.R., Vukolic, M.: Fast access to distributed atomic memory. SIAM J. Comput. 39(8), 3752\u20133783 (2010)","journal-title":"SIAM J. Comput."},{"key":"1023_CR32","doi-asserted-by":"crossref","unstructured":"Duvignau, R., Raynal, M., Schiller, E.M.: Self-stabilizing byzantine-tolerant broadcast (2022). CoRR arXiv:2201.12880","DOI":"10.1007\/978-3-031-21017-4_14"},{"key":"1023_CR33","doi-asserted-by":"crossref","unstructured":"Fan, R., Lynch, N.A.: Efficient replication of large data objects. In: Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1\u20133, 2003, Proceedings, LNCS, vol. 2848, pp. 75\u201391. Springer (2003)","DOI":"10.1007\/978-3-540-39989-6_6"},{"issue":"4","key":"1023_CR34","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(92)90195-2","volume":"43","author":"P Gemmell","year":"1992","unstructured":"Gemmell, P., Sudan, M.: Highly resilient correctors for polynomials. Inf. Process. Lett. 43(4), 169\u2013174 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"1023_CR35","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jpdc.2008.05.004","volume":"69","author":"C Georgiou","year":"2009","unstructured":"Georgiou, C., Nicolaou, N.C., Shvartsman, A.A.: Fault-tolerant semifast implementations of atomic read\/write registers. J. Parallel Distrib. Comput. 69(1), 62\u201379 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1023_CR36","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Gustafsson, R., Lindhe, A., Schiller, E.M.: Self-stabilization overhead: an experimental case study on coded atomic storage (2018). CoRR arXiv:1807.07901","DOI":"10.1007\/978-3-030-31277-0_9"},{"key":"1023_CR37","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Gustafsson, R., Lindh\u00e9, A., Schiller, E.M.: Self-stabilization overhead: a case study on coded atomic storage. In: NETYS\u201919, Lecture Notes in Computer Science, vol. 11704, pp. 131\u2013147. Springer (2019), the complemetry technical report appears in CoRR arXiv:1807.07901, 2018","DOI":"10.1007\/978-3-030-31277-0_9"},{"issue":"4","key":"1023_CR38","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00446-010-0117-1","volume":"23","author":"S Gilbert","year":"2010","unstructured":"Gilbert, S., Lynch, N.A., Shvartsman, A.A.: Rambo: a robust, reconfigurable atomic memory service for dynamic networks. Distrib. Comput. 23(4), 225\u2013272 (2010)","journal-title":"Distrib. Comput."},{"key":"1023_CR39","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Nicolaou, N., Schwarzmann, A.A.: Consistent distributed storage. In: Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2021)","DOI":"10.1007\/978-3-031-02015-5"},{"key":"1023_CR40","doi-asserted-by":"crossref","unstructured":"Hendricks, J., Ganger, G.R., Reiter, M.K.: Low-overhead Byzantine fault-tolerant storage. In: Bressoud, T.C., Kaashoek, M.F. (eds.) Proceedings of the 21st ACM Symposium on Operating Systems Principles 2007, SOSP 2007, Stevenson, Washington, USA, October 14\u201317, 2007, pp. 73\u201386. ACM (2007)","DOI":"10.1145\/1323293.1294269"},{"key":"1023_CR41","doi-asserted-by":"crossref","unstructured":"Johnen, C., Higham, L.: Fault-tolerant implementations of regular registers by safe registers with applications to networks. In: Garg, V.K., Wattenhofer, R., Kothapalli, K. (eds.) Distributed Computing and Networking, 10th International Conference, ICDCN 2009, Hyderabad, India, January 3\u20136, 2009. Proceedings, Lecture Notes in Computer Science, vol. 5408, pp. 337\u2013348. Springer (2009)","DOI":"10.1007\/978-3-540-92295-7_41"},{"key":"1023_CR42","doi-asserted-by":"crossref","unstructured":"Konwar, K.M., Prakash, N., Kantor, E., Lynch, N.A., M\u00e9dard, M., Schwarzmann, A.A.: Storage-optimized data-atomic algorithms for handling erasures and errors in distributed storage systems. In: 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23\u201327, 2016, pp. 720\u2013729. IEEE Computer Society (2016). http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=7510487","DOI":"10.1109\/IPDPS.2016.55"},{"key":"1023_CR43","unstructured":"Konwar, K.M., Prakash, N., Lynch, N.A., M\u00e9dard, M.: RADON: repairable atomic data object in networks. In: Fatourou, P., Jim\u00e9nez, E., Pedone, F. (eds.) 20th International Conference on Principles of Distributed Systems, OPODIS 2016, December 13\u201316, 2016, Madrid, Spain, LIPIcs, vol. 70, pp. 28:1\u201328:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-031-6"},{"key":"1023_CR44","doi-asserted-by":"crossref","unstructured":"Konwar, K.M., Prakash, N., Lynch, N.A., M\u00e9dard, M.: A layered architecture for erasure-coded consistent distributed storage. In: Schiller, E.M., Schwarzmann, A.A. (eds.) Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25\u201327, 2017, pp. 63\u201372. ACM (2017)","DOI":"10.1145\/3087801.3087832"},{"issue":"2","key":"1023_CR45","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Part II: algorithms. Distrib. Comput. 1(2), 86\u2013101 (1986)","journal-title":"Distrib. Comput."},{"key":"1023_CR46","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"1023_CR47","unstructured":"Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Digest of Papers: FTCS-27, The Twenty-Seventh Annual International Symposium on Fault-Tolerant Computing, Seattle, Washington, USA, June 24\u201327, 1997, pp. 272\u2013281. IEEE Computer Society (1997). http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=4855"},{"issue":"9","key":"1023_CR48","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24(9), 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"issue":"6","key":"1023_CR49","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1145\/2500874","volume":"57","author":"PM Musial","year":"2014","unstructured":"Musial, P.M., Nicolaou, N.C., Shvartsman, A.A.: Implementing distributed shared memory for dynamic networks. Commun. ACM 57(6), 88\u201398 (2014)","journal-title":"Commun. ACM"},{"issue":"2","key":"1023_CR50","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"1023_CR51","doi-asserted-by":"crossref","unstructured":"Roth, R.M.: Introduction to Coding Theory. Cambridge Press, Cambridge (2006)","DOI":"10.1017\/CBO9780511808968"},{"key":"1023_CR52","doi-asserted-by":"crossref","unstructured":"Salem, I., Schiller, E.M.: Practically-self-stabilizing vector clocks in the absence of execution fairness. In: Networked Systems\u20146th International Conference, NETYS 2018, p to appear (2018)","DOI":"10.1007\/978-3-030-05529-5_21"},{"issue":"3","key":"1023_CR53","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2644808","volume":"32","author":"A Sampson","year":"2014","unstructured":"Sampson, A., Nelson, J., Strauss, K., Ceze, L.: Approximate storage in solid-state memories. ACM Trans. Comput. Syst. 32(3), 9:1-9:23 (2014)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"11","key":"1023_CR54","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"1023_CR55","unstructured":"Skeen, D.: A quorum-based commit protocol. In: Berkeley Workshop, pp. 69\u201380 (1982)"},{"key":"1023_CR56","doi-asserted-by":"crossref","unstructured":"Spiegelman, A., Cassuto, Y., Chockler, G.V., Keidar, I.: Space bounds for reliable storage: fundamental limits of coding. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25\u201328, 2016, pp. 249\u2013258 (2016)","DOI":"10.1145\/2933057.2933104"},{"key":"1023_CR57","unstructured":"Welch, L.R., Berlekamp, E.R.: Error correction for algebraic block codes. US Patent 4,633,470. https:\/\/www.google.com\/patents\/US4633470 (1986)"},{"key":"1023_CR58","doi-asserted-by":"crossref","unstructured":"Xing, B.C., Shanahan, M., Leslie-Hurd, R.: Intel\u00ae software guard extensions (intel\u00ae SGX) software support for dynamic memory allocation inside an enclave. In: Proceedings of the Hardware and Architectural Support for Security and Privacy 2016, HASP@ICSA 2016, Seoul, Republic of Korea, June 18, 2016, pp. 11:1\u201311:9. ACM (2016)","DOI":"10.1145\/2948618.2954330"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01023-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-01023-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-01023-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T04:21:08Z","timestamp":1727842868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-01023-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":58,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1023"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-01023-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,20]]},"assertion":[{"value":"29 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that there is no actual or potential conflict of interest in relation to this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}