<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2001-12-12 07:00:25Cryptographic hash functions Artificial intelligence Information retrieval Computational complexity theory Universal hashing Hash function Leftover hash lemma Cramer–Shoup cryptosystem Tabulation hashing Hashing Cryptography Search algorithms |
| 1 Stronger Attacks on Causality-Based Key Agreement Benno Salwey and Stefan Wolf Faculty of Informatics, Universit`a della Svizzera Italiana, Via G. Buffi 13, 6900 Lugano, SwitzerlandDocID: 1qLT7 - View Document |
| CS369N: Beyond Worst-Case Analysis Lecture #6: Pseudorandom Data and Universal Hashing∗ Tim Roughgarden† April 14,DocID: 1pP4w - View Document |
| Leftover Hash Lemma, Revisited Boaz Barak ∗ Yevgeniy Dodis†DocID: 1lPJY - View Document |
| Leftover Hash Lemma, Revisited Boaz Barak ∗ Yevgeniy Dodis†DocID: 1lbQW - View Document |
| Efficiency Improvements in Constructing Pseudorandom Generators from One-way Functions∗ Iftach Haitner† and Omer Reingold‡ and Salil Vadhan§ May 24, 2012 AbstractDocID: 13VLr - View Document |