Moni Naor, Omer Reingold  Home/Search
Context Related
| wisdom.weizmann.ac.il/~naor...mac.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cryptosoft.com/html/secpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper studies the relationship between unpredictable functions (which formalize the concept of a MAC) and pseudo-random functions. We show an efficient transformation of the former to the latter using a unique application of the Goldreich-Levin hard-core bit (taking the inner-product with a random vector r): While in most applications of the GL-bit the random vector r may be public, in our setting this is not the case. The transformation is only secure when r is secret and treated as part... (Update)
Context of citations to this paper: More
...h N; a;g is unpredictable in some weak sense. Assuming the intractability of factoring Blum integers, Naor and Reingold have shown [19, 20] that h N; a;g is unpredictable against an adaptive sample and a random challenge. That is, for a random x 2 f0; 1g n , no polynomial...
...if, for any forgery y, where # is a negligible quantity. Throughout this paper, negligibility is used in the traditional sense [2, 19]. In addition to protection against EF goal, two other goals have been defined that have direct applicability to message integrity,...
Cited by: More
From Known-Plaintext to Chosen-Ciphertext Security - Maurer, Sjödin (2006) (Correct)
Key Derivation and Randomness Extraction - Chevassut, Fouque, Gaudry.. (2005) (Correct)
Pseudo-Random Functions and Factoring - Naor, Reingold, Rosen (2000) (Correct)
Similar documents (at the sentence level):
70.8%: From Unpredictability to Indistinguishability: A Simple.. - Naor, Reingold (1998) (Correct)
Active bibliography (related documents): More All
0.7: Number-Theoretic Constructions of Efficient Pseudo-Random.. - Naor, Reingold (1997) (Correct)
0.5: Synthesizers and Their Application to the Parallel.. - Naor, Reingold (1995) (Correct)
0.4: On the Construction of Pseudo-Random Permutations.. - Moni Naor, Omer Reingold (1997) (Correct)
Similar documents based on text: More All
0.3: Efficient Construction of (Distributed) Verifiable Random Functions - Dodis (2002) (Correct)
0.1: Pseudo-Random Synthesizers, Functions and Permutations - Reingold (1998) (Correct)
0.1: On Pseudorandomness with respect to Deterministic Observers - Goldreich, Wigderson (2000) (Correct)
Related documents from co-citation: More All
12: How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1984
10: How to construct pseudorandom permutations from pseudorandom functions (context) - Luby, Rackoff - 1988
9: Keying hash functions for message authentication - Bellare, Canetti et al. - 1996
BibTeX entry: (Update)
M. Naor, O. Reingold, "From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs", to appear, Advances in Cryptology -- Crypto '98. http://citeseer.ist.psu.edu/94005.html More
@article{ naor98from,
author = "Moni Naor and Omer Reingold",
title = "From Unpredictability to Indistinguishability: {A} Simple Construction of Pseudo-Random Functions from {MACs}",
journal = "Lecture Notes in Computer Science",
volume = "1462",
pages = "267--??",
year = "1998",
url = "citeseer.ist.psu.edu/94005.html" }
Citations (may not include all citations):419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
334 How to generate cryptographically strong sequence of pseudo-.. (context) - Blum, Micali - 1984
191 New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
189 Keying hash functions for message authentication - Bellare, Canetti et al. - 1996
159 A Concrete Security Treatment of Symmetric Encryption (context) - Bellare, Desai et al. - 1997
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
95 The security of cipher block chaining - Bellare, Kilian et al. - 1994
77 the construction of pseudo-random permutations: Luby-Rackoff.. - Naor, Reingold - 1997
55 Number-Theoretic constructions of efficient pseudo-random fu.. - Naor, Reingold - 1997
54 Checking the correctness of memories - Blum, Evans et al. - 1994
45 the generation of cryptographically strong pseudo-random num.. (context) - Shamir - 1983
43 Bucket hashing and its application to fast message authentic.. - Rogaway - 1995
39 Advances in Cryptology - CRYPTO (context) - Chor, Fiat et al. - 1994
32 on Foundations of Computer Science (context) - Yao, applications et al. - 1982
32 Synthesizers and their application to the parallel construct.. - Naor, Reingold - 1995
31 Cryptographic primitives based on hard learning problems - Blum, Furst et al. - 1994
28 the cryptographic applications of random functions (context) - Goldreich, Goldwasser et al. - 1985
26 Two remarks concerning the Goldwasser-Micali-Rivest signatur.. - Goldreich - 1987
25 Pseudo-randomness and applications (context) - Luby - 1996
23 How to construct pseudorandom permutations and pseudorandom .. (context) - Luby, Rackoff - 1988
18 Advances in Cryptology - CRYPTO (context) - Bellare, Goldwasser et al. - 1990
16 Electronic publication: http://www (context) - Goldreich, Cryptography et al. - 1995
7 Modern cryptology (context) - Brassard - 1988
6 MMH: message authentication in software in the Gbit/second r.. (context) - Halevi, Krawczyk - 1997
5 Towards a theory of software protection (context) - Goldreich - 1987
3 Advances in Cryptology - EUROCRYPT (context) - Preneel, van Oorschot et al. - 1996
1 submission to this conference (context) - Multicast, taxonomy et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995) (Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991) (Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC