XOR MACS: New Methods for Message Authentication using Finite Pseudorandom Functions (1995)

by Mihir Bellare , Roch Guérin , Phillip Rogaway
Citations:122 - 19 self

Active Bibliography

unknown title – unknown authors - 2001
A Connection Between Random Variables and Latin k-cubes – Ruben Michel, Gadi Taubenfeld, Andrew Berman - 1993
Derandomization – K. Gopalakrishnan, D.R. Stinson, Monte Carlo Algorithms
On the impossibility of amplifying the independence of random variables (Extended Abstract) – Jin-yi Cai, Suresh Chari - 1994
Low-Discrepancy Sets for High-Dimensional Rectangles: A Survey – Eric Allender, Aravind Srinivas
MOD p -tests, Almost Independence and Small Probability Spaces – Claudia Bertram-kretzberg, Hanno Lefmann - 2000
Implementing Luby's Algorithm on the Cray T3E – Jürgen Gross, Markus Lohrey
CS37501-1 Randomized Algorithms Winter 2003 – Lecture January And
2 Low-Diameter Graph Decomposition is in NC – Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg - 1992
4 A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem – Afonso Ferreira and Nicolas Schabanel, Afonso Ferreira, Afonso Ferreira, Nicolas Schabanel, Nicolas Schabanel - 1999
6 On permutations with limited independence – Toshiya Itoh, Yoshinori Takei, Jun Tarui - 2000
2 Probabilistic methods in coloring and decomposition problems – Noga Alon - 1994
4 PRAM Models and Fundamental Parallel Algorithmic Techniques: Part II (Randomized Algorithms) – Paul G. Spirakis - 1998
1 Probabilistic Techniques In Structural Complexity Theory – D. Sivakumar - 1996
3 A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problem – Ryuhei Uehara - 1997
2 Uniform Inclusions in Nondeterministic Logspace – Eric Allender, Shiyu Zhou - 1998
1 Parallel Complexity of the Lexicographically First Maximal Subgraph Problems on Restricted Graphs – Ryuhei Uehara - 1997
1 On Restricted Min-Wise Independence of Permutations – Jiri Matousek, Ji R Matou Sek, Milos Stojakovic
The – Noga Alon, Yossi Matias, Mario Szegedy