Eike Kiltz. A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits. In Rusins Freivalds, editor, Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings. Volume 2138 of Lecture Notes in Computer Science, pages 388-391, Springer, 2001. [doi]
@inproceedings{Kiltz01,
title = {A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits},
author = {Eike Kiltz},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2138/21380388.htm},
tags = {security},
researchr = {https://researchr.org/publication/Kiltz01},
cites = {0},
citedby = {0},
pages = {388-391},
booktitle = {Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings},
editor = {Rusins Freivalds},
volume = {2138},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42487-3},
}