Michael Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Indistinguishability of Random Systems - Maurer (2002) (4 citations) (Correct)
....by Corollary 1 (v) EB; A k B k ) E; A k ) B; B k ) where (B; B k ) p coll (jRj; k) The second claim follows by a trivial analysis of a collision event among k random values. ut Remark. Theorem 7, besides being more general, is also slightly stronger than that of [18] and [10] see also [9]) where an additional term k = jRj) appears on the right side. This weaker bound would in our context be obtained by proving Delta k (L; R) k =jRj and then using Delta k (R; P) k =jRj . One could also append an additional random permutation G, as follows directly from Corollary ....
M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.
Compressing Cryptographic Resources (Extended Abstract) - Gilboa, Ishai (Correct)
....in a black box manner. Applications include amortizing the communication costs of private multi party computation and proactive secret sharing of large secrets. 1 Introduction This work introduces and studies a natural generalization of the fundamental notions of pseudo randomness (cf. [28, 6, 12, 18]) to a useful and natural notion of privately correlated pseudo randomness. Alternatively, our generalized notion may be viewed as providing a secure mechanism for compressing large correlated pads used as resources in cryptographic protocols. 1.1 Motivation We consider a scenario in which a ....
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Many Hard Examples in Exact Phase Transitions with Application to .. - Xu, Li (2003) (2 citations) (Correct)
....to generate hard satisfiable instances. Besides practical importance, more interestingly, the problem of generating random hard satisfiable instances is related to some open problems in cryptography, e.g. computing a one way function, generating pseudo random numbers and private key cryptography [9, 13, 15]. 7 In fact, for constraint satisfaction and Boolean satisfiability problems, there is a natural strategy to generate instances that are guaranteed to have at least one satisfying assignment. The strategy is as follows [2] first generate a random truth assignment t, and then generate a certain ....
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Distribution Of Modular Sums And The Security Of The Server .. - Nguyen, Shparlinski (2000) (Correct)
....fi Applying Lemma 1, we obtain the desired result. ut In particular, using the Cauchy inequality we obtain fi fi fi fi : 3) 4 Statistical distance In complexity theory, it is customary to use the notion of statistical distance between two distributions (see for instance [11, 6]) Recall that the (probability) distribution D associated with a random variable X over a set S is the function mapping any n of S to D(n) Pr(X = n) The statistical distance between two distributions U and V over a finite set S is defined as: L(U ; V) 1 n2S jU(n) Gamma V(n)j : It is ....
M. Luby, Pseudorandomness and cryptographic applications, Princeton University Press, 19969.
NESSIE D13 - Security Evaluation of NESSIE First Phase - Preneel, Van Rompay.. (2001) (Correct)
....on BMGL gives a black box reduction to an attack on the underlying iterated one way function, i.e. Rijndael. The analysis allows to quantify the loss of security. The security and correctness of the overall construction has been verified several times before for the case of one way permutations [48, 52, 47, 80, 46]. 69 All proofs given in the submission were carefully checked. It seems to be di#cult to predict changes in the security properties of the BMGL generator if weaknesses of real encryption functions like Rijndael are detected. To rate the loss in security of the BMGL generator one would need to ....
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Asynchronously and Perfectly Secure - Communication Over One-Time (Correct)
No context found.
Michael Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.
Super-bits, Demi-bits, and N - Qpoly-Natural Proofs Steven (Correct)
No context found.
Michael Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press (1996).
A Note on Quadratic Residuosity and UP - Cai, Threlfall (2004) (Correct)
No context found.
M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, Princeton, New Jersey, 1996.
One-Wayness/KEM Equivalent to General Factoring - Kurosawa, Takagi (2005) (Correct)
No context found.
M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1966.
Conjectured Security of the ANSI-NIST Elliptic Curve RNG - Brown (2006) (1 citation) (Correct)
No context found.
Michael Luby, Pseudorandomness and cryptographic applications, Princeton University Press, 1996.
On Security Preserving Reductions - Revised Terminology - Goldreich (2000) (Correct)
No context found.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
PRF Domain Extension Using DAGs - Jutla (2005) (1 citation) (Correct)
No context found.
M. Luby, "Pseudorandomness and Cryptographic Applications", Princeton Computer Science Notes, Princeton Univ. Press, 1996
On Obfuscating Point Functions - Wee (2005) (1 citation) (Correct)
No context found.
Michael Luby, "Pseudorandomness and Cryptographic Applications", Princeton University Press, 1996.
Universal Hash Proofs and a Paradigm for Adaptive Chosen - Ciphertext Secure Public-Key (2001) (Correct)
No context found.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Universally Composable Time-Stamping Schemes with Audit - Buldas, Laud, Saarepera.. (2005) (Correct)
No context found.
Michael Luby. Pseudorandomness and cryptographic applications. Princeton University Press, 1996.
Parallelizable Encryption Mode with Almost Free Message Integrity - Jutla (2000) (2 citations) (Correct)
No context found.
M. Luby, "Pseudorandomness and Cryptographic Applications", Princeton Computer Science Notes, Princeton Univ. Press, 1996
Secure Mobile Gambling - Markus Jakobsson David (2001) (1 citation) (Correct)
No context found.
M. Luby. Pseudorandomness and Cryptographic Applications, Princeton University Press, page 27, 1996.
Complete Classification of Bilinear Hard-Core - Functions Thomas Holenstein (Correct)
No context found.
Michael Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, first edition, 1996. ISBN 0-691-02546-0.
Smooth Entropy and R'enyi Entropy - Christian Cachin Department (1997) (2 citations) (Correct)
No context found.
M. Luby, Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Building PRFs from PRPs - Hall, Wagner, Kelsey, Schneier (1998) (7 citations) (Correct)
No context found.
M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.
Characterization of Security Notions for Probabilistic.. - Katz, Yung (1 citation) (Correct)
No context found.
M. Luby. Pseudorandomness and cryptographic applications. Princeton University Press, Princeton, NJ, 1996.
Cryptographic Hardness Based on the Decoding of Reed-Solomon.. - Kiayias, Yung (2002) (5 citations) (Correct)
No context found.
Michael Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996. 27
Are `Strong' Primes Needed for RSA? - Rivest, Silverman (1999) (1 citation) (Correct)
No context found.
M. Luby. Pseudorandomness and Cryptographic Applications. Princeton University Press, 1996.
Provably-Secure Enhancement on 3GPP Authentication and Key.. - Zhang (2003) (Correct)
No context found.
M. Luby, Pseudorandomness and Cryptographic Applications, Princeton University Press, 1996.
Parallelizable Authentication Trees - Hall, Jutla (2002) (Correct)
No context found.
M. Luby, "Pseudorandomness and Cryptographic Applications", Princeton Computer Science Notes, Princeton Univ. Press, 1996
First 50 documents Next 50
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