{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T19:09:17Z","timestamp":1764184157342,"version":"3.46.0"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"European Union [DNA Data Applications (DiDAX)]","award":["101115134"],"award-info":[{"award-number":["101115134"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tit.2025.3622889","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T17:40:03Z","timestamp":1760722803000},"page":"9534-9547","source":"Crossref","is-referenced-by-count":1,"title":["Anonymous Shamir\u2019s Secret-Sharing via Reed\u2013Solomon Codes Against Permutations, Insertions, and Deletions"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0966-3818","authenticated-orcid":false,"given":"Roni","family":"Con","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technion–Israel Institute of Technology, Haifa, Israel"}]}],"member":"263","reference":[{"key":"ref1","first-page":"5431","article-title":"$Abuse\u2013resistant$ location tracking: Balancing privacy and safety in the offline finding ecosystem","volume-title":"Proc. 33rd USENIX Secur. Symp. (USENIX Secur.)","author":"Eldridge"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-01884-7_12"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3056317"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3403488"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44993-5_6"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2023.3237711"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2024.3387848"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3398587"},{"key":"ref15","first-page":"60:1","article-title":"Reed-solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets","volume-title":"Proc. 52nd Int. Colloq. Automata, Lang., Program. (ICALP)","volume":"334","author":"Con","year":"2025"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195607"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3468265"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/21M142798X"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1142\/4838"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2789292"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85886-7_31"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0401024"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02451114"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)89208-6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00236-0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024198519111"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2020.105965"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557110"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_18"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120017341"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11268978\/11206406.pdf?arnumber=11206406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T19:03:40Z","timestamp":1764183820000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11206406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":36,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3622889","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}