{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:00Z","timestamp":1773377040956,"version":"3.50.1"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195478","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Secret Sharing in the Rank Metric"],"prefix":"10.1109","author":[{"given":"Johan Vester","family":"Dinesen","sequence":"first","affiliation":[{"name":"Aalto University,Department of Mathematics and Systems Analysis,Finland"}]},{"given":"Eimear","family":"Byrne","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, University College Dublin,Ireland"}]},{"given":"Ragnar","family":"Freij-Hollanti","sequence":"additional","affiliation":[{"name":"Aalto University,Department of Mathematics and Systems Analysis,Finland"}]},{"given":"Camilla","family":"Hollanti","sequence":"additional","affiliation":[{"name":"Aalto University,Department of Mathematics and Systems Analysis,Finland"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref3","article-title":"Minimal Codewords and Secret Sharing","volume-title":"Proceedings of the 6th joint Swedish-Russian international workshop on information theory","author":"Massey"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/0112059"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_15"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70293-3_15"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.75248"},{"key":"ref10","first-page":"1","article-title":"Theory of codes with maximum rank distance (translation)","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Problems of Information Transmission"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090212"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173631"},{"key":"ref15","volume-title":"ROLLO - Rank-Ouroboros, LAKE & LOCKER","author":"Gaborit","year":"2020"},{"key":"ref16","volume-title":"Rank Quasi Cyclic (RQC)","author":"Gaborit","year":"2020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.IR.8309"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-023-01265-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2022.3225080"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-98365-9_1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01544-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-019-00889-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00798-9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0576-0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20901-7_2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_17"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2009.11.006"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.2067"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2823326"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492461"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2777490"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2791994"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/16m1102562"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2022.3142375"},{"key":"ref35","volume-title":"Secret Sharing for Secure and Private Information Retrieval: A Construction Using Algebraic Geometry Codes","author":"Makkonen","year":"2024"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_14"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756"},{"key":"ref38","volume-title":"Lattices and Ordered Algebraic Structures, ser. Universitext","author":"Blyth","year":"2005"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-022-01129-y"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2023.105799"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2021.12.001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1561\/0100000119"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9858-8"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-020-00811-1"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3390\/e21100948"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2570238"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852315"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2928483"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195478.pdf?arnumber=11195478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:15Z","timestamp":1773347415000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195478\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195478","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}