Bibliography - A Classical Introduction to Cryptography: Applications for Communications Security - page 314

[70] N. Freed, N. Borenstein. Multipurpose Internet Mail Extensions (MIME) Part One: Format
of Internet Message Bodies. Internet Standard. RFC 2045, 1996.
[71] E. Fujisaki, T. Okamoto, D. Pointcheval, J. Stern. RSA-OAEP is Secure under the RSA
Assumption. In Advances in Cryptology CRYPTO'01 , Santa Barbara, CA, Lecture Notes
in Computer Science 2139. Springer-Verlag, NY, 2001, pp. 260-274.
[72] M.R. Garey, D.S. Johnson. Computers and Intractability— A Guide to the Theory of NP-
Completeness . Freeman, NY, 1979.
[73] S. Garfinkel. PGP—Pretty Good Privacy . O'Reilly, Cambridge, 1995.
[74] H. Gilbert. Cryptanalyse Statistique des Algorithmes de Chiffrement et Securite des
Schemas d'Authentification .These de Doctorat de l'Universite de Paris 11, 1997.
[75] H. Gilbert, G. Chasse. A Statistical Attack of the FEAL-8 Cryptosystem. In Advances
in Cryptology CRYPTO'90 , Santa Barbara, CA, Lecture Notes in Computer Science 537.
Springer-Verlag, NY, 1991, pp. 22-33.
[76] O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness . Algo-
rithms and Combinatorics vol. 17. Springer-Verlag, NY, 1999.
[77] S. Goldwasser, S. Micali. Probabilistic Encryption. Journal of Computer and System Sci-
ences , vol. 28, pp. 270-299, 1984.
[78] S. Goldwasser, S. Micali, C. Rackoff. The Knowledge Complexity of Interactive Proof
Systems. SIAM Journal on Computing , vol. 18, pp. 186-208, 1989.
[79] S. Goldwasser, S. Micali, R.L. Rivest. A “Paradoxical” Solution to the Signature Problem.
In Advances in Cryptology CRYPTO'84 , Santa Barbara, CA, Lecture Notes in Computer
Science 196. Springer-Verlag, NY, 1985, p. 467.
[80] S. Goldwasser, S. Micali, R.L. Rivest. A Digital Signature Scheme Secure against Adap-
tive Chosen-Message Attacks. SIAM Journal on Computing , vol. 17, pp. 281-308,
1988.
[81] F. Grieu. A Chosen Messages Attack on the ISO/IEC 9796-1 Signature Scheme. In
Advances in Cryptology CRYPTO'00 , Santa Barbara, CA, Lecture Notes in Computer
Science 1880. Springer-Verlag, NY, 2000, pp. 70-80.
[82] L. Guillou, J.-J. Quisquater. A “Paradoxical” Identity-Based Signature Scheme Result-
ing from Zero-Knowledge. In Advances in Cryptology CRYPTO'88 , Santa Barbara,
CA, Lecture Notes in Computer Science 403. Springer-Verlag, NY, 1990, pp. 216-
231.
[83] S.C. Kleene. Representation of Events in Nerve Nets. In Automata Studies , C.E. Shannon
and M. McCarthy (Eds.), Annals of Mathematical Studies, vol. 34. Princeton University
Press, Princeton, 1956, pp. 3-41.