-
1
-
-
84990678058
-
Simple Construction of Almost k-wise Independent Random Variables
-
Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple Construction of Almost k-wise Independent Random Variables. Random Struct. Algorithms 3(3), 289-304 (1992)
-
(1992)
Random Struct. Algorithms
, vol.3
, Issue.3
, pp. 289-304
-
-
Alon, N.1
Goldreich, O.2
Hastad, J.3
Peralta, R.4
-
2
-
-
84957098482
-
Constructing VIL-MACs from FIL-MACs: Message Authentication underWeakened Assumptions
-
Wiener, M, ed, CRYPTO 1999, Springer, Heidelberg
-
An, J.H., Bellare, M.: Constructing VIL-MACs from FIL-MACs: Message Authentication underWeakened Assumptions. In:Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 252-269. Springer, Heidelberg (1999)
-
(1999)
LNCS
, vol.1666
, pp. 252-269
-
-
An, J.H.1
Bellare, M.2
-
3
-
-
33749544409
-
New Proofs for NMAC and HMAC: Security without Collision-Resistance
-
Dwork, C, ed, CRYPTO 2006, Springer, Heidelberg
-
Bellare, M.: New Proofs for NMAC and HMAC: Security without Collision-Resistance. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 602-619. Springer, Heidelberg (2006)
-
(2006)
LNCS
, vol.4117
, pp. 602-619
-
-
Bellare, M.1
-
4
-
-
84983089516
-
The Security of Cipher Block Chaining
-
Desmedt, Y.G, ed, CRYPTO 1994, Springer, Heidelberg
-
Bellare, M., Kilian, J., Rogaway, P.: The Security of Cipher Block Chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 341-358. Springer, Heidelberg (1994)
-
(1994)
LNCS
, vol.839
, pp. 341-358
-
-
Bellare, M.1
Kilian, J.2
Rogaway, P.3
-
5
-
-
0030416137
-
Pseudorandom Functions Re-visited: The Cascade Construction and Its Concrete Security
-
Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom Functions Re-visited: The Cascade Construction and Its Concrete Security. In: FOCS 1996, pp. 514-523 (1996)
-
(1996)
FOCS 1996
, pp. 514-523
-
-
Bellare, M.1
Canetti, R.2
Krawczyk, H.3
-
6
-
-
35048891868
-
Keying Hash Functions for Message Authentication
-
Koblitz, N, ed, CRYPTO 1996, Springer, Heidelberg
-
Bellare, M., Canetti, R., Krawczyk, H.: Keying Hash Functions for Message Authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1-15. Springer, Heidelberg (1996)
-
(1996)
LNCS
, vol.1109
, pp. 1-15
-
-
Bellare, M.1
Canetti, R.2
Krawczyk, H.3
-
7
-
-
44449166046
-
A New Mode of Operation for Block Ciphers and Length-Preserving MACs
-
Smart, N.P, ed, EUROCRYPT 2008, Springer, Heidelberg
-
Dodis, Y., Pietrzak, K., Puniya, P.: A New Mode of Operation for Block Ciphers and Length-Preserving MACs. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 198-219. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.4965
, pp. 198-219
-
-
Dodis, Y.1
Pietrzak, K.2
Puniya, P.3
-
8
-
-
38049138727
-
Feistel Networks Made Public, and Applications
-
Naor, M, ed, EUROCRYPT 2007, Springer, Heidelberg
-
Dodis, Y., Puniya, P.: Feistel Networks Made Public, and Applications. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 534-554. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4515
, pp. 534-554
-
-
Dodis, Y.1
Puniya, P.2
-
10
-
-
0024868772
-
A hard-core predicate for all one-way functions
-
Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: STOC 1989, pp. 25-32 (1989)
-
(1989)
STOC 1989
, pp. 25-32
-
-
Goldreich, O.1
Levin, L.2
-
11
-
-
0023984964
-
How to construct pseudo-random permutations from pseudorandom functions
-
Luby, M., Rackoff, C.: How to construct pseudo-random permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373-386 (1988)
-
(1988)
SIAM J. Comput
, vol.17
, Issue.2
, pp. 373-386
-
-
Luby, M.1
Rackoff, C.2
-
12
-
-
0027641832
-
Small-Bias Probability Spaces: Efficient Constructions and Applications
-
Naor, J., Naor, M.: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4), 838-856 (1993)
-
(1993)
SIAM J. Comput
, vol.22
, Issue.4
, pp. 838-856
-
-
Naor, J.1
Naor, M.2
-
13
-
-
84957617971
-
From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs
-
Krawczyk, H, ed, CRYPTO 1998, Springer, Heidelberg
-
Naor, M., Reingold, O.: From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 267-282. Springer, Heidelberg (1998)
-
(1998)
LNCS
, vol.1462
, pp. 267-282
-
-
Naor, M.1
Reingold, O.2
-
14
-
-
0004775324
-
CBC MAC for Real-Time Data Sources
-
Petrank, E., Rackoff, C.: CBC MAC for Real-Time Data Sources. J. Cryptology 13(3), 315-338 (2000)
-
(2000)
J. Cryptology
, vol.13
, Issue.3
, pp. 315-338
-
-
Petrank, E.1
Rackoff, C.2
-
15
-
-
51549120471
-
MDx-MAC and Building Fast MACs from Hash Functions
-
Coppersmith, D, ed, CRYPTO 1995, Springer, Heidelberg
-
Preneel, B., van Oorschot, P.C.: MDx-MAC and Building Fast MACs from Hash Functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 1-14. Springer, Heidelberg (1995)
-
(1995)
LNCS
, vol.963
, pp. 1-14
-
-
Preneel, B.1
van Oorschot, P.C.2
-
16
-
-
51849087663
-
How to Build a Permutation-Based Hash Function
-
Wagner, D, ed, CRYPTO 2008, Springer, Heidelberg
-
Rogaway, P., Steinberger, J.: How to Build a Permutation-Based Hash Function. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 433-450. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5157
, pp. 433-450
-
-
Rogaway, P.1
Steinberger, J.2
-
17
-
-
49049096334
-
Building a Collision-Resistant Compression Function from Non-Compressing Primitives
-
Aceto, L, Damgård, I, Goldberg, L.A, Halldórsson, M.M, Ingólfsdóttir, A, Walukiewicz, I, eds, ICALP 2008, Part II, Springer, Heidelberg
-
Shrimpton, T., Stam, M.: Building a Collision-Resistant Compression Function from Non-Compressing Primitives. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 643-654. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5126
, pp. 643-654
-
-
Shrimpton, T.1
Stam, M.2
-
18
-
-
84957690790
-
Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?
-
Nyberg, K, ed, EUROCRYPT 1998, Springer, Heidelberg
-
Simon, D.R.: Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334-345. Springer, Heidelberg (1998)
-
(1998)
LNCS
, vol.1403
, pp. 334-345
-
-
Simon, D.R.1
-
19
-
-
24944591357
-
How to break MD5 and Other Hash Functions
-
Cramer, R, ed, EUROCRYPT 2005, Springer, Heidelberg
-
Wang, X., Yu, H.: How to break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19-35. Springer, Heidelberg (2005)
-
(2005)
LNCS
, vol.3494
, pp. 19-35
-
-
Wang, X.1
Yu, H.2
-
20
-
-
70350298097
-
-
Private communication
-
Zuckerman, D.: Private communication
-
-
-
Zuckerman, D.1
|