{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:28:11Z","timestamp":1774024091206,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002347","name":"German Federal Ministry of Education and Research (BMBF)","doi-asserted-by":"publisher","award":["16KIS1004"],"award-info":[{"award-number":["16KIS1004"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010663","name":"European Research Council (ERC)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"publisher","award":["801434"],"award-info":[{"award-number":["801434"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518193","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1147-1152","source":"Crossref","is-referenced-by-count":5,"title":["Doubly-Exponential Identification via Channels: Code Constructions and Bounds"],"prefix":"10.1109","author":[{"given":"Onur","family":"G\u00fcnl\u00fc","sequence":"first","affiliation":[{"name":"University of Siegen,Chair of Communications Engineering and Security"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Kliewer","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Department of Electrical and Computer Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael F.","family":"Schaefer","sequence":"additional","affiliation":[{"name":"University of Siegen,Chair of Communications Engineering and Security"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Sidorenko","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, TU Munich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.30982"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TIFS.2020.3029885","article-title":"Multi-entity and multi-enrollment key agreement with correlated noise","volume":"16","author":"g\u00fcnl\u00fc","year":"2021","journal-title":"IEEE Trans Inf Forensics Security"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90027-1"},{"key":"ref13","author":"huffman","year":"2010","journal-title":"Fundamentals of Error-Correcting Codes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.53748"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1117\/12.644642"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.782144"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1049\/el:19830605"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.1986.1074754"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007027"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.3390\/e20050340","article-title":"Secure and reliable key agreement with physical unclonable functions","volume":"20","author":"g\u00fcnl\u00fc","year":"2018","journal-title":"Entropy"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.42172"},{"key":"ref6","author":"g\u00fcnl\u00fc","year":"2018","journal-title":"Key agreement with physical unclonable functions and biometric identifiers"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.923724"},{"key":"ref8","author":"eswaran","year":"2005","journal-title":"Identification Via Channels and Constant-Weight Codes"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.179339"},{"key":"ref2","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/e22101067"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518193.pdf?arnumber=9518193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:24Z","timestamp":1773347724000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518193\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518193","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}