{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T03:07:08Z","timestamp":1780456028406,"version":"3.54.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031998713","type":"print"},{"value":"9783031998720","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-99872-0_4","type":"book-chapter","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T11:08:35Z","timestamp":1755774515000},"page":"48-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Supervised Distributed Computing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0948-3961","authenticated-orcid":false,"given":"John","family":"Augustine","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5278-528X","authenticated-orcid":false,"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5110-5625","authenticated-orcid":false,"given":"Julian","family":"Werthmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Afek, Y., Giladi, G., Patt-Shamir, B.: Distributed computing with the cloud. In: Proceedings of SSS 2021, pp. 1\u201320 (2021). https:\/\/doi.org\/10.1007\/978-3-030-91081-5_1","DOI":"10.1007\/978-3-030-91081-5_1"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/S10817-013-9289-2","volume":"52","author":"E Alkassar","year":"2014","unstructured":"Alkassar, E., B\u00f6hme, S., Mehlhorn, K., Rizkallah, C.: A framework for the verification of certifying computations. J. Autom. Reason. 52(3), 241\u2013273 (2014). https:\/\/doi.org\/10.1007\/S10817-013-9289-2","journal-title":"J. Autom. Reason."},{"key":"4_CR3","unstructured":"Anderson, D.P.: https:\/\/boinc.berkeley.edu\/anderson\/, March 2025"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Augustine, J., Biju, J., Meir, S., Peleg, D., Ramachandran, S., Thiruvengadam, A.: Byzantine resilient computing with the cloud. CoRR abs\/2309.16359 (2023), https:\/\/doi.org\/10.48550\/arXiv.2309.16359","DOI":"10.48550\/arXiv.2309.16359"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Augustine, J., Scheideler, C., Werthmann, J.: Supervised distributed computing (2025), arxiv:2503.11600","DOI":"10.1007\/978-3-031-99872-0_4"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s00224-008-9099-9","volume":"45","author":"B Awerbuch","year":"2009","unstructured":"Awerbuch, B., Scheideler, C.: Towards a scalable and robust DHT. Theor. Comput. Syst. 45(2), 234\u2013260 (2009)","journal-title":"Theor. Comput. Syst."},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1\u20134 October 1991, pp. 90\u201399. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/SFCS.1991.185352,","DOI":"10.1109\/SFCS.1991.185352"},{"key":"4_CR8","unstructured":"Chiesa, A.: Succinct non-Interactive arguments. Ph.D. thesis, Massachusetts Institute of Technology (2014)"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Crescenzo, G.D., Khodjaeva, M., Kahrobaei, D., Shpilrain, V.: A survey on delegated computation. In: Diekert, V., Volkov, M.V. (eds.) Developments in Language Theory - 26th International Conference, DLT 2022, Tampa, FL, USA, 9\u201313 May 2022, Proceedings. Lecture Notes in Computer Science, vol. 13257, pp. 33\u201353. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_3,","DOI":"10.1007\/978-3-031-05578-2_3"},{"key":"4_CR10","unstructured":"Feigenbaum, J.: Overview of interactive proof systems and zero-knowledge. Contemp. Cryptology Sci. Inf. Integrity 423\u2013439 (1992)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2007.v003a001","volume":"3","author":"A Fiat","year":"2007","unstructured":"Fiat, A., Saia, J.: Censorship resistant peer-to-peer networks. Theor. Comput. 3(1), 1\u201323 (2007)","journal-title":"Theor. Comput."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803\u2013814. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_71"},{"key":"4_CR13","unstructured":"Freivalds, R.M.: Probabilistic machines can use less running time. In: Proceedings of IFIP Congress 1977, pp. 839\u2013842 (1977)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-03850-6_11","volume-title":"Principles of Distributed Systems","author":"R Friedman","year":"2013","unstructured":"Friedman, R., Kliot, G., Kogan, A.: Hybrid distributed consensus. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 145\u2013159. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03850-6_11"},{"issue":"2\u20133","key":"4_CR15","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/J.TCS.2008.08.008","volume":"408","author":"MT Goodrich","year":"2008","unstructured":"Goodrich, M.T.: Pipelined algorithms to detect cheating in long-term grid computations. Theor. Comput. Sci. 408(2\u20133), 199\u2013207 (2008). https:\/\/doi.org\/10.1016\/J.TCS.2008.08.008","journal-title":"Theor. Comput. Sci."},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-540-39989-6_23","volume-title":"Distributed Computing","author":"K Hildrum","year":"2003","unstructured":"Hildrum, K., Kubiatowicz, J.: Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 321\u2013336. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39989-6_23"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Jaiyeola, M.O., Patron, K., Saia, J., Young, M., Zhou, Q.M.: Tiny groups tackle Byzantine adversaries. In: Proceedings of IPDPS 2018, pp. 1030\u20131039 (2018)","DOI":"10.1109\/IPDPS.2018.00112"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Malkhi, D., Spiegelman, A.: Asynchronous distributed key generation for computationally-secure randomness, consensus, and threshold signatures. In: CCS 2020, pp. 1751\u20131767. ACM (2020)","DOI":"10.1145\/3372297.3423364"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jagm.1994.1030","volume":"17","author":"FT Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Ranade, A.G., Rao, S.: Randomized routing and sorting on fixed-connection networks. J. Algorithms 17(1), 157\u2013205 (1994)","journal-title":"J. Algorithms"},{"key":"4_CR20","unstructured":"Leung, J.Y. (ed.): Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall\/CRC (2004)"},{"issue":"2","key":"4_CR21","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/J.COSREV.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011). https:\/\/doi.org\/10.1016\/J.COSREV.2010.09.009","journal-title":"Comput. Sci. Rev."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-45172-3_8","volume-title":"Peer-to-Peer Systems II","author":"M Naor","year":"2003","unstructured":"Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 88\u201397. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45172-3_8"},{"key":"4_CR23","unstructured":"Nitulescu, A.: zk-snarks: a gentle introduction. Ecole Normale Superieure (2020)"},{"key":"4_CR24","doi-asserted-by":"publisher","first-page":"103024","DOI":"10.1016\/J.PARCO.2023.103024","volume":"116","author":"A Pastrana-Cruz","year":"2023","unstructured":"Pastrana-Cruz, A., Lafond, M.: A lightweight semi-centralized strategy for the massive parallelization of branching algorithms. Parallel Comput. 116, 103024 (2023). https:\/\/doi.org\/10.1016\/J.PARCO.2023.103024","journal-title":"Parallel Comput."},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","journal-title":"J. ACM"},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"AG Ranade","year":"1991","unstructured":"Ranade, A.G.: How to emulate shared memory. J. Comput. Syst. Sci. 42(3), 307\u2013326 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-45748-8_26","volume-title":"Peer-to-Peer Systems","author":"J Saia","year":"2002","unstructured":"Saia, J., Fiat, A., Gribble, S., Karlin, A.R., Saroiu, S.: Dynamically fault-tolerant content addressable networks. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 270\u2013279. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_26"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Tamassia, R.: Authenticated data structures. In: Proceedings of 11th European Symposium on Algorithms (ESA 2003), pp.\u00a02\u20135 (2003). https:\/\/doi.org\/10.1007\/978-3-540-39658-1_2","DOI":"10.1007\/978-3-540-39658-1_2"},{"key":"4_CR29","unstructured":"Tutorial, H.M.: https:\/\/hadoop.apache.org\/docs\/r1.2.1\/mapred_tutorial.html, March 2025"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, G., et al.: Reaching consensus in the byzantine empire: a comprehensive review of BFT consensus algorithms. ACM Comput. Surv. 56(5), 134:1\u2013134:41 (2024)","DOI":"10.1145\/3636553"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Zhao, C., et al.: Secure multi-party computation: theory, practice and applications. Inf. Sci. 476, 357\u2013372 (2019). https:\/\/doi.org\/10.1016\/j.ins.2018.10.024","DOI":"10.1016\/j.ins.2018.10.024"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2025: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99872-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:25:59Z","timestamp":1780406759000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99872-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"ISBN":["9783031998713","9783031998720"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99872-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"22 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}