Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Arithmetic Circuits and Polynomial Replacement Systems - McKenzie, Vollmer, Wagner (1999) (Correct)
....are NP complete under log m . 15 Proof. The containment proofs are similar to that of Theorem 6.2, but before applying Lemma 5.7 we select nondeterministically a deterministic prs by deleting some of the rules of the originally given prs. The claim follows since MA = 9 Delta coRP [Gol99] Hardness for poly[ Delta] is proven by giving a logspace many one reduction from the sum of subset problem SOS (problem SP13 in [GJ79, p. 223] to poly[ Delta] as follows: Let m; b 1 ; b m ; c 2 N n f0g. Define the prs S by S = def Gamma fx 1 ; x n g; fx n 1 ; x n m ....
O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness, volume 17 of Algorithms and Combinatorics. Springer Verlag, Berlin Heidelberg, 1999.
GEM: a Generic Chosen-Ciphertext Secure Encryption Method - Coron, al. (2002) (4 citations) (Correct)
No context found.
Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.
GEM: a Generic Chosen-Ciphertext Secure - Encryption Method Published (Correct)
No context found.
Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.
GEM: a Generic Chosen-Ciphertext Secure Encryption Method - Coron, al. (2002) (4 citations) (Correct)
No context found.
Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.
GEM: a Generic Chosen-Ciphertext Secure Encryption Method - Coron, Joye, Paillier.. (2002) (4 citations) (Correct)
No context found.
Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.
GEM: a Generic Chosen-Ciphertext Secure Encryption Method - Coron, Handschuh, Joye, .. (2002) (4 citations) (Correct)
No context found.
Oded Goldreich. Modern cryptography, probabilistic proofs and pseudo-randomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, 1999.
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