{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:03:20Z","timestamp":1749528200588,"version":"3.41.0"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902024","type":"print"},{"value":"9783031902031","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-90203-1_30","type":"book-chapter","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:48:49Z","timestamp":1749484129000},"page":"293-297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Byzantine-Tolerant Privacy-Preserving Atomic Register"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Kowalski","sequence":"first","affiliation":[]},{"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[]},{"given":"Matthieu","family":"Perrin","sequence":"additional","affiliation":[]},{"given":"Sinchan","family":"Sengupta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,10]]},"reference":[{"issue":"1","key":"30_CR1","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":"30_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Or, A.: Sharing memory with semi-byzantine clients and faulty storage servers. In: 22nd International Symposium on Reliable Distributed Systems, 2003. Proceedings, pp. 371\u2013378. IEEE (2003)","DOI":"10.1109\/RELDIS.2003.1238090"},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2535929","volume":"9","author":"A Bessani","year":"2013","unstructured":"Bessani, A., Correia, M., Quaresma, B., Andr\u00e9, F., Sousa, P.: Depsky: dependable and secure storage in a cloud-of-clouds. ACM Trans. Storage (TOS) 9(4), 1\u201333 (2013)","journal-title":"ACM Trans. Storage (TOS)"},{"issue":"4","key":"30_CR4","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM (JACM) 32(4), 824\u2013840 (1985)","journal-title":"J. ACM (JACM)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2016.03.012","volume":"93","author":"D Imbs","year":"2016","unstructured":"Imbs, D., Rajsbaum, S., Raynal, M., Stainer, J.: Read\/write shared memory abstraction on top of asynchronous byzantine message-passing systems. J. Parallel Distrib. Comput. 93, 1\u20139 (2016)","journal-title":"J. Parallel Distrib. Comput."},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/s00224-016-9699-8","volume":"60","author":"A Most\u00e9faoui","year":"2017","unstructured":"Most\u00e9faoui, A., Petrolia, M., Raynal, M., Jard, C.: Atomic read\/write memory in signature-free byzantine asynchronous message-passing systems. Theory Comput. Syst. 60, 677\u2013694 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"11","key":"30_CR8","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"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson, D.R.: An explication of secret sharing schemes. Des. Codes Crypt. 2(4), 357\u2013390 (1992)","journal-title":"Des. Codes Crypt."},{"key":"30_CR10","unstructured":"Kowalski, V., Most\u00e9faoui, A., Perrin, M., Sengupta, S.: Privacy preserving register construction (extended version). https:\/\/hal.science\/hal-04587198. Accessed 25 May 2024"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90203-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T15:48:50Z","timestamp":1749484130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90203-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902024","9783031902031"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90203-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"10 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}