{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T06:43:23Z","timestamp":1743489803996,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648925"},{"type":"electronic","value":"9783540684626"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055734","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T21:12:36Z","timestamp":1154034756000},"page":"267-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[]},{"given":"Omer","family":"Reingold","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"19_CR1","unstructured":"M. Bellare, R. Canetti and H. Krawczyk, Keying hash functions for message authentication, Proc. Advances in Cryptology \u2014 CRYPTO '96, LNCS, Springer, vol. 1109, 1996, pp. 1\u201315."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, E. Jokipii and P. Rogaway, A Concrete Security Treatment of Symmetric Encryption, Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 394\u2013403.","DOI":"10.1109\/SFCS.1997.646128"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Kilian and P. Rogaway, The security of cipher block chaining, Advances in Cryptology \u2014 CRYPTO '94, Lecture Notes in Computer Science, vol. 839, Springer-Verlag, 1994, pp. 341\u2013358.","DOI":"10.1007\/3-540-48658-5_32"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare and S. Goldwasser, New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs Proc. Advances in Cryptology \u2014 CRYPTO '89, LNCS, Springer, 1990, pp. 194\u2013211.","DOI":"10.1007\/0-387-34805-0_19"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"A. Blum, M. Furst, M. Kearns and R.J. Lipton, Cryptographic primitives based on hard learning problems, in: D.R. Stinson, ed., Advances in Cryptology \u2014 CRYPTO '93, LNCS, vol. 773, Springer, 1994, pp. 278\u2013291.","DOI":"10.1007\/3-540-48329-2_24"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali, How to generate cryptographically strong sequence of pseudo-random bits, SIAM J. Comput., vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM J. Comput."},{"key":"19_CR7","unstructured":"G. Brassard, Modern cryptology, LNCS, vol. 325, Springer, 1988."},{"key":"19_CR8","unstructured":"R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor and B. Pinkas, Multicast security: A taxonomy and efficient authentication, manuscript."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, Proc. 23rd Ann. ACM Symp. on Theory of Computing, 1991, pp. 542\u2013552. Full version available at: http:\/\/www.wisdom.weizmarm.ac.il\/~naor.","DOI":"10.1145\/103418.103474"},{"key":"19_CR10","first-page":"104","volume":"263","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, Two remarks concerning the Goldwasser-Micali-Rivest signature scheme, Advances in Cryptology \u2014 CRYPTO'86, LNCS, vol. 263, 1987, pp. 104\u2013110.","journal-title":"LNCS"},{"key":"19_CR11","unstructured":"O. Goldreich, Foundations of Cryptography (Fragments of a Book) 1995. Electronic publication in the Electronic Colloquium on Computational Complexity: http:\/\/www.eccc.uni-trier.de\/eccc\/info\/ECCC-Books\/eccc-books.html."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali, How to construct random functions, J. of the ACM., vol. 33, 1986, pp. 792\u2013807.","journal-title":"J. of the ACM."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser and S. Micali, On the cryptographic applications of random functions, Advances in Cryptology \u2014 CRYPTO '84, LNCS, vol. 196, Springer, 1985, pp. 276\u2013288.","DOI":"10.1007\/3-540-39568-7_22"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. Levin, A hard-core predicate for all one-way functions, in: Proc. 21st Ann. ACM Symp. on Theory of Computing, 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"S. Halevi and H. Krawczyk, MMH: message authentication in software in the Gbit\/second rates, Proc. Fast Software Encryption, Lecture Notes in Computer Science, Springer-Verlag, 1997.","DOI":"10.1007\/BFb0052345"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"J. Hastad, R. Impagliazzo, L. A. Levin and M. Luby, Construction of a pseudo-random generator from any one-way function, To appear in SIAM J. Comput. Preliminary versions by Impagliazzo et. al. in 21st STOC, 1989 and Hastad in 22nd STOC, 1990.","DOI":"10.1145\/73007.73009"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Luby, One-way functions are essential for complexity based cryptography, Proc. 30th FOCS, 1989, pp. 230\u2013235.","DOI":"10.1109\/SFCS.1989.63483"},{"key":"19_CR18","unstructured":"M. Luby, Pseudo-randomness and applications, Princeton University Press, 1996."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff, How to construct pseudorandom permutations and pseudorandom functions, SIAM J. Comput., vol. 17, 1988, pp. 373\u2013386.","journal-title":"SIAM J. Comput."},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions, Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 170\u2013181.","DOI":"10.1109\/SFCS.1995.492474"},{"key":"19_CR21","unstructured":"M. Naor and O. Reingold, On the construction of pseudo-random permutations: Luby-Rackoff revisited, To appear in: J. of Cryptology. Preliminary version in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997. pp. 189\u2013199."},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold, Number-Theoretic constructions of efficient pseudo-random functions, Proc. 38th FOCS, 1997, pp. 458\u2013467.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"19_CR23","first-page":"19","volume":"1070","author":"B. Preneel","year":"1996","unstructured":"B. Preneel and P. C. van Oorschot, On the security of two MAC algorithms, Advances in Cryptology \u2014 EUROCRYPT '96, LNCS, vol. 1070, 1996, pp. 19\u201332.","journal-title":"LNCS"},{"key":"19_CR24","unstructured":"R. L. Rivest, Chaffing and winnowing: confidentiality without encryption, MIT Lab for Computer Science, http:\/\/theory.lcs.mit.edu\/~rivest\/chaffing.txt, March 18, 1998. To appear in: RSA CryptoBytes, Summer 1998."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"P. Rogaway, Bucket hashing and its application to fast message authentication, Advances in Cryptology \u2014 CRYPTO '95, Lecture Notes in Computer Science, vol. 963, Springer-Verlag, 1995, pp. 74\u201385.","DOI":"10.1007\/3-540-44750-4_3"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir, On the generation of cryptographically strong pseudo-random number sequences, ACM Trans. Comput. Sys., vol 1, 1983, pp. 38\u201344.","journal-title":"ACM Trans. Comput. Sys."},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and L. Carter, New hash functions and their use in authentication and set equality, J. of Computer and System Sciences, vol. 22, 1981, pp. 265\u2013279.","journal-title":"J. of Computer and System Sciences"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:51:28Z","timestamp":1736481088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055734"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0055734","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"28 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}