{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:18Z","timestamp":1750309458416,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T00:00:00Z","timestamp":1735948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,4]]},"DOI":"10.1145\/3700838.3700867","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"201-210","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Byzantine-Tolerant Privacy-Preserving Atomic Register"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-5689-1079","authenticated-orcid":false,"given":"Vincent","family":"Kowalski","sequence":"first","affiliation":[{"name":"Nantes Universit\u00e9, Nantes, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7208-4635","authenticated-orcid":false,"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Rennes, Rennes, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8019-0830","authenticated-orcid":false,"given":"Matthieu","family":"Perrin","sequence":"additional","affiliation":[{"name":"Nantes Universite, Nantes, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5322-0156","authenticated-orcid":false,"given":"Sinchan","family":"Sengupta","sequence":"additional","affiliation":[{"name":"Nantes Universite, Nantes, France"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Hagit Attiya Amotz Bar-Noy and Danny Dolev. 1995. Sharing memory robustly in message-passing systems. Journal of the ACM (JACM) 42 1 (1995) 124\u2013142.","key":"e_1_3_3_2_2_2","DOI":"10.1145\/200836.200869"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_3_2","DOI":"10.1109\/RELDIS.2003.1238090"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_4_2","DOI":"10.1145\/3319535.3354207"},{"doi-asserted-by":"crossref","unstructured":"Alysson Bessani Miguel Correia Bruno Quaresma Fernando Andr\u00e9 and Paulo Sousa. 2013. DepSky: dependable and secure storage in a cloud-of-clouds. Acm transactions on storage (tos) 9 4 (2013) 1\u201333.","key":"e_1_3_3_2_5_2","DOI":"10.1145\/2535929"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_6_2","DOI":"10.1145\/1653662.1653686"},{"doi-asserted-by":"crossref","unstructured":"Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Information and Computation 75 2 (1987) 130\u2013143.","key":"e_1_3_3_2_7_2","DOI":"10.1016\/0890-5401(87)90054-X"},{"doi-asserted-by":"crossref","unstructured":"Gabriel Bracha and Sam Toueg. 1985. Asynchronous consensus and broadcast protocols. Journal of the ACM (JACM) 32 4 (1985) 824\u2013840.","key":"e_1_3_3_2_8_2","DOI":"10.1145\/4221.214134"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_9_2","DOI":"10.1145\/586110.586124"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_10_2","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_3_2_11_2","first-page":"383","volume-title":"Annual Symposium on Foundations of Computer Science (Proceedings)","author":"Choc Benny","year":"1985","unstructured":"Benny Choc, Shafi Goldwasser, Silvio Micali, and Baruch Awerbuch. 1985. VERIFIABLE SECRET SHARING AND ACHIEVING SIMULTANEITY IN THE PRESENCE OF FAULTS.. In Annual Symposium on Foundations of Computer Science (Proceedings). 383\u2013395."},{"unstructured":"Shir Cohen and Idit Keidar. 2021. Tame the wild with byzantine linearizability: Reliable broadcast snapshots and asset transfer. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2102.10597 (2021).","key":"e_1_3_3_2_12_2"},{"doi-asserted-by":"crossref","unstructured":"Danny Dolev and R\u00fcdiger Reischuk. 1985. Bounds on information exchange for Byzantine agreement. Journal of the ACM (JACM) 32 1 (1985) 191\u2013204.","key":"e_1_3_3_2_13_2","DOI":"10.1145\/2455.214112"},{"doi-asserted-by":"crossref","unstructured":"Cynthia Dwork and Yoram Moses. 1990. Knowledge and common knowledge in a Byzantine environment: crash failures. Information and Computation 88 2 (1990) 156\u2013186.","key":"e_1_3_3_2_14_2","DOI":"10.1016\/0890-5401(90)90014-9"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_15_2","DOI":"10.1007\/978-3-319-09620-9_5"},{"doi-asserted-by":"crossref","unstructured":"Damien Imbs Sergio Rajsbaum Michel Raynal and Julien Stainer. 2016. Read\/write shared memory abstraction on top of asynchronous byzantine message-passing systems. J. Parallel and Distrib. Comput. 93 (2016) 1\u20139.","key":"e_1_3_3_2_16_2","DOI":"10.1016\/j.jpdc.2016.03.012"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_17_2","DOI":"10.1007\/978-3-642-17373-8_11"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_18_2","DOI":"10.1145\/3335772.3335936"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_19_2","DOI":"10.1145\/3319535.3363203"},{"doi-asserted-by":"crossref","unstructured":"Achour Most\u00e9faoui Matoula Petrolia Michel Raynal and Claude Jard. 2017. Atomic read\/write memory in signature-free byzantine asynchronous message-passing systems. Theory of Computing Systems 60 (2017) 677\u2013694.","key":"e_1_3_3_2_20_2","DOI":"10.1007\/s00224-016-9699-8"},{"unstructured":"Kartik Nayak Ling Ren Elaine Shi Nitin\u00a0H Vaidya and Zhuolun Xiang. 2020. Improved extension protocols for byzantine broadcast and agreement. arXiv preprint arXiv:https:\/\/arXiv.org\/abs\/2002.11321 (2020).","key":"e_1_3_3_2_21_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_2_22_2","DOI":"10.1007\/978-3-540-30564-4_22"},{"doi-asserted-by":"crossref","unstructured":"Mehrdad Nojoumian and Douglas\u00a0R Stinson. 2013. On dealer-free dynamic threshold schemes. Adv. Math. Commun. 7 1 (2013) 39\u201356.","key":"e_1_3_3_2_23_2","DOI":"10.3934\/amc.2013.7.39"},{"doi-asserted-by":"crossref","unstructured":"Marshall Pease Robert Shostak and Leslie Lamport. 1980. Reaching agreement in the presence of faults. Journal of the ACM (JACM) 27 2 (1980) 228\u2013234.","key":"e_1_3_3_2_24_2","DOI":"10.1145\/322186.322188"},{"key":"e_1_3_3_2_25_2","first-page":"129","volume-title":"Annual international cryptology conference","author":"Pedersen Torben\u00a0Pryds","year":"1991","unstructured":"Torben\u00a0Pryds Pedersen. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In Annual international cryptology conference. Springer, 129\u2013140."},{"doi-asserted-by":"crossref","unstructured":"Adi Shamir. 1979. How to share a secret. Commun. ACM 22 11 (1979) 612\u2013613.","key":"e_1_3_3_2_26_2","DOI":"10.1145\/359168.359176"},{"doi-asserted-by":"crossref","unstructured":"Douglas\u00a0R. Stinson. 1992. An explication of secret sharing schemes. Designs Codes and Cryptography 2 4 (1992) 357\u2013390.","key":"e_1_3_3_2_27_2","DOI":"10.1007\/BF00125203"}],"event":{"acronym":"ICDCN 2025","name":"ICDCN 2025: 26th International Conference on Distributed Computing and Networking","location":"Hyderabad India"},"container-title":["Proceedings of the 26th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700867","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:22Z","timestamp":1750295422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":26,"alternative-id":["10.1145\/3700838.3700867","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3700867","relation":{},"subject":[],"published":{"date-parts":[[2025,1,4]]},"assertion":[{"value":"2025-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}