{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T11:58:41Z","timestamp":1768910321999,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T00:00:00Z","timestamp":1659312000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001381","name":"Singapore National Research Foundation through National Research Foundation Research Fellowship","doi-asserted-by":"publisher","award":["NRF-NRFF2013-13"],"award-info":[{"award-number":["NRF-NRFF2013-13"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Ministry of Education, Singapore, through the Research Centres of Excellence Programme by the Tier-3 Grant \u201cRandom numbers from quantum processes\u201d","award":["MOE2012-T3-1-009"],"award-info":[{"award-number":["MOE2012-T3-1-009"]}]},{"name":"Foundations of Quantum-Safe Cryptography","award":["MOE2019-T2-1-145"],"award-info":[{"award-number":["MOE2019-T2-1-145"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1109\/tit.2022.3167404","type":"journal-article","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T19:39:05Z","timestamp":1649965145000},"page":"5475-5495","source":"Crossref","is-referenced-by-count":2,"title":["Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors"],"prefix":"10.1109","volume":"68","author":[{"given":"Divesh","family":"Aggarwal","sequence":"first","affiliation":[{"name":"Centre for Quantum Technologies, National University of Singapore, Singapore"}]},{"given":"Maciej","family":"Obremski","sequence":"additional","affiliation":[{"name":"Centre for Quantum Technologies, National University of Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9870-0501","authenticated-orcid":false,"given":"Joao","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Department of Computing, Imperial College London, London, U.K."}]},{"given":"Mark","family":"Simkin","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Aarhus University, Aarhus, Denmark"}]},{"given":"Luisa","family":"Siniscalchi","sequence":"additional","affiliation":[{"name":"Concordium Blockchain Research Center, Aarhus University, Aarhus, Denmark"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0217014"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536496"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052244"},{"key":"ref5","first-page":"28:1","article-title":"Non-malleable extractors and non-malleable codes: Partially optimal constructions","volume-title":"Proc. 34th Comput. Complex. Conf. (CCC)","volume":"137","author":"Li"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9219-z"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897547"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3178432"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384339"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055486"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0217015"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060593"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1142\/S1793042105000108"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579319000238"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2019.189.3.1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.26"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055423"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055429"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_14"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_27"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2200290"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_13"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64834-3_26"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56784-2_14"},{"key":"ref27","article-title":"Extractors: Low entropy requirements colliding with non-malleability","author":"Chung","year":"2021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892063"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_35"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_22"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.61"},{"key":"ref32","first-page":"3:1","article-title":"A new approach for constructing low-error, two-source extractors","volume-title":"Proc. 33rd Comput. Complex. Conf. (CCC)","volume":"102","author":"Ben-Aroya"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_19"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_15"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_19"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_21"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_26"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/120868414"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1734213.1734214"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132612"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.27"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/080733954"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_16"},{"key":"ref44","first-page":"106","article-title":"Low-error two-source extractors for polynomial min-entropy","volume-title":"Proc. Electron. Colloq. Comput. Complex. (ECCC)","volume":"23","author":"Ben-Aroya"},{"key":"ref45","article-title":"Leaky pseudo-entropy functions","volume-title":"Innovations in Computer Science","author":"Braverman","year":"2011"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9829223\/09757153.pdf?arnumber=9757153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:17:14Z","timestamp":1705958234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9757153\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8]]},"references-count":45,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3167404","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8]]}}}