{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:16:43Z","timestamp":1753600603882,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437654","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"1834-1838","source":"Crossref","is-referenced-by-count":2,"title":["Inverted Leftover Hash Lemma"],"prefix":"10.1109","author":[{"given":"Maciej","family":"Obremski","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Skorski","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"12","article-title":"Pseudo-random Generation from one-way functions (Extended Abstracts)","author":"impagliazzo","year":"1989","journal-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1989.63486"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.76"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847746"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2370036.2145841"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305237"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480197329508"},{"key":"ref17","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 11th International Conference on the Theory and Application of Cryptology and Information Security"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701386216"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808762"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref3","first-page":"331","article-title":"On Families of Hash Functions via Geometric Codes and Concatenation","author":"bierbrauer","year":"1993","journal-title":"Advances in Cryptology - CRYPTO ‘93 13th Annual International Cryptology Conference"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","article-title":"Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data","author":"dodis","year":"2004","journal-title":"Advances in Cryptology - EUROCRYPT 2004 International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/060651380"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/BFb0052345","article-title":"MMH: Software Message Authentication in the Gbit\/Second Rates","author":"halevi","year":"1997","journal-title":"Fast Software Encryption - 4th International Workshop FSE'97"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110950"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48405-1_14","article-title":"UMAC: Fast and Secure Message Authentication","author":"black","year":"1999","journal-title":"Advances in Cryptology - CRYPTO ‘99 19th Annual International Cryptology Conference"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.476316"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-540-85174-5_9","article-title":"Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms","author":"handschuh","year":"2008","journal-title":"Advances in Cryptology - CRYPTO 2008 28th Annual International Cryptology Conference"},{"key":"ref20","article-title":"On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes","volume":"2","author":"stinson","year":"1995","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2462774"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780633"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437654.pdf?arnumber=8437654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T03:47:54Z","timestamp":1598240874000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437654\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437654","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}