{"citation":{"ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>.","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>.","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>"},"year":"2018","date_created":"2018-12-11T11:44:40Z","conference":{"end_date":"2018-06-22","location":"Vail, CO, USA","name":"ISIT: International Symposium on Information Theory","start_date":"2018-06-17 "},"title":"Inverted leftover hash lemma","language":[{"iso":"eng"}],"publication_status":"published","month":"08","quality_controlled":"1","publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2017/507"}],"publist_id":"7946","alternative_title":["ISIT Proceedings"],"type":"conference","scopus_import":"1","day":"16","isi":1,"volume":2018,"status":"public","_id":"108","external_id":{"isi":["000448139300368"]},"date_published":"2018-08-16T00:00:00Z","abstract":[{"text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes.","lang":"eng"}],"date_updated":"2023-09-13T08:23:18Z","doi":"10.1109/ISIT.2018.8437654","department":[{"_id":"KrPi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","intvolume":"      2018","oa":1,"author":[{"first_name":"Marciej","full_name":"Obremski, Marciej","last_name":"Obremski"},{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skorski","full_name":"Skorski, Maciej","first_name":"Maciej"}],"article_processing_charge":"No","oa_version":"Submitted Version"}