{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:16Z","timestamp":1773377836071,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849490","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"2144-2148","source":"Crossref","is-referenced-by-count":0,"title":["Privacy Amplification, Lossy Compression, and their Duality to Channel Coding"],"prefix":"10.1109","author":[{"given":"Joseph M.","family":"Renes","sequence":"first","affiliation":[{"name":"ETH, Institute for Theoretical Physics, Zürich"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49725-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865386"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2754921"},{"key":"ref14","first-page":"1317","article-title":"Iterative Quantization Using Codes On Graphs","author":"martinian","year":"2003","journal-title":"41st Annual Allerton Conference on Communication Control and Computing (Allerton)"},{"key":"ref15","article-title":"Channel coding: non-asymptotic fundamental limits","author":"polyanskiy","year":"2010","journal-title":"PhD"},{"key":"ref16","first-page":"2629","article-title":"E?-resolvability","volume":"63","author":"liu","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2530084"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309140"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351812"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/11593447_11","article-title":"Simple and Tight Bounds for Information Reconciliation and Privacy Amplification","author":"renner","year":"2005","journal-title":"Advances in Cryptology - ASIACRYPT 2005 Lecture Notes in Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620720"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2278971"},{"key":"ref8","article-title":"Wiretap Channels: Nonasymptotic Fundamental Limits","author":"yang","year":"2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620547"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73009"},{"key":"ref9","article-title":"Strong converse theorems in quantum information theory","volume":"33","author":"nagaoka","year":"2001","journal-title":"Proceedings of the ERATO Conference on Quantum Information Science (EQIS)"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0217014","article-title":"Privacy Amplification by Public Discussion","volume":"17","author":"bennett","year":"1988","journal-title":"SIAM Journal on Computing"},{"key":"ref20","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.2010.0445"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2186786"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2434842"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040961"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276628"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2218792"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849490.pdf?arnumber=8849490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:18Z","timestamp":1773347718000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849490\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849490","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}