• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Lecture Notes on Cryptography (2001)

Cached

  • Download as a PDF

Download Links

  • [www.cs.utsa.edu]
  • [www.cs.utsa.edu]
  • [www.cs.miami.edu]
  • [www.cs.brown.edu]
  • [www.cse.ucsd.edu]
  • [www.cse.ucsd.edu]
  • [www-cse.ucsd.edu]
  • [www.cs.ucsd.edu]
  • [www-cse.ucsd.edu]
  • [www.dim.uchile.cl]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Shafi Goldwasser , Mihir Bellare
Citations:13 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Goldwasser01lecturenotes,
    author = {Shafi Goldwasser and Mihir Bellare},
    title = {Lecture Notes on Cryptography},
    year = {2001}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

This is a set of lecture notes on cryptography compiled for 6.87s, a one week long course on cryptography taught at MIT by Shafi Goldwasser and Mihir Bellare in the summers of 1996–2001. The notes were formed by merging notes written for Shafi Goldwasser’s Cryptography and Cryptanalysis course at MIT with notes written for Mihir Bellare’s Cryptography and network security course at UCSD. In addition, Rosario Gennaro (as Teaching Assistant for the course in 1996) contributed Section 9.6, Section 11.4, Section 11.5, and Appendix D to the notes, and also compiled, from various sources, some of the problems in Appendix E. Cryptography is of course a vast subject. The thread followed by these notes is to develop and explain the notion of provable security and its usage for the design of secure protocols. Much of the material in Chapters 2, 3 and 7 is a result of scribe notes, originally taken by MIT graduate students who attended Professor Goldwasser’s Cryptography and Cryptanalysis course over the years, and later edited by Frank D’Ippolito who was a teaching assistant for the course in 1991. Frank also contributed much of the advanced number theoretic material in the Appendix. Some of the material in Chapter 3 is from the chapter on Cryptography, by R. Rivest, in the Handbook of Theoretical Computer Science. Chapters 4, 5, 6, 8 and 10, and Sections 9.5 and 7.4.6, were written by Professor Bellare for his Cryptography and network security course at UCSD.

Citations

8881 D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979
7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
2292 New directions in cryptography - Diffie, Hellmen - 1976
1130 Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993
1040 R.: A logic for authentication - Burrows, Abadi, et al. - 1989
1023 Untraceable electronic mail, return addresses, and digital pseudonyms - Chaum - 1981
1001 Probabilistic encryption - Goldwasser, Micali - 1984
892 C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
872 A.C.-C.: On the security of public key protocols - Dolev, Yao - 1983
711 A digital signature scheme secure against adaptive chosenmessage attacks - Goldwasser, Micali, et al. - 1988
706 A.: How to prove yourself: Practical solutions to identification and signature problems - Fiat, Shamir - 1986
601 A pseudorandom generator from any one-way function - H˚astad, Impagliazzo, et al. - 1999
553 Factoring Polynomials with Rational Coefficients - Lenstra, Lovàsz - 1982
544 How to construct random functions - Goldreich, Goldwasser, et al. - 1986
533 How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
410 Nonmalleable cryptography - Dolev, Dwork, et al. - 2000
407 A randomized protocol for signing contracts - Even, Goldreich, et al. - 1985
407 Differential Cryptanalysis of DES-like Cryptosystems - Biham, Shamir - 1990
404 Keying hash functions for message authentication - Bellare, Canetti, et al. - 1996
388 Entity authentication and key distribution - Bellare, Rogaway - 1994
388 Relations Among Notions of Security for Public-Key Encryption Schemes - Bellare, Desai, et al. - 1998
366 I.: Multiparty unconditionally secure protocols - Chaum, Crépeau, et al. - 1988
309 Safeguarding cryptographic keys - Blakley - 1979
296 A Concrete Security Treatment of Symmetric Encryption - Bellare, Desai, et al. - 1997
292 L.: A Hard-Core Predicate for all One-Way Functions - Goldreich, Levin - 1989
288 The exact security of digital signatures - how to sign with rsa and rabin - Bellare, Rogaway - 1996
253 A public-key cryptosystem and a signature scheme based on discrete logarithms - Gamal - 1985
241 Untraceable electronic cash - Chaum, Fiat, et al. - 1988
231 A design principle for hash functions - Damgård - 1989
231 Authentication and Authenticated Key Exchanges - Diffie, Oorschot, et al. - 1992
221 Timestamps in key distribution protocols - Denning, Sacco - 1981
200 Optimal Asymmetric Encryption - Bellare, Rogaway - 1994
199 Factoring integers with elliptic curves - Lenstra - 1987
198 Founding Cryptography on Oblivious Transfer - Kilian - 1988
198 Chosen ciphertext attacks against protocols based on the RSA encryption standard - Bleichenbacher - 1998
196 A Practical Scheme for Non-interactive Verifiable Secret Sharing - Feldman - 1987
185 Provably secure session key distribution---the three party case - Bellare, Rogaway - 1995
185 A simple unpredictable pseudo-random number generator - Blum, Shub - 1986
176 B.: Verifiable secret sharing and achieving simultaneity in the presence of faults - Chor, Goldwasser, et al. - 1985
174 Receipt-free secret-ballot elections - Benaloh, Tuinstra - 1994
163 The security of the cipher block chaining message authentication code - Bellare, Kilian, et al.
159 Unbiased bits from sources of weak randomness and probabilistic communication complexity - Chor, Goldreich - 1985
156 Robust non-interactive zero knowledge - Santis, Crescenzo, et al. - 2001
147 A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract - Goldreich, Micali, et al. - 1986
137 The security of cipher block chaining - Bellare, Kilian, et al. - 1994
133 A Proposal for a New Block Encryption Standard - Lai, Massey
127 Signature schemes based on the strong RSA assumption - Cramer, Shoup
121 Seminumerical Algorithms, volume 2 of The Art of Computer Programming - Knuth - 1997
120 C.: RSA and Rabin Functions: Certain Parts are as Hard as the Whole - Alexi, Chor, et al. - 1988
110 Robust threshold DSS signatures - Gennaro, Jarecki, et al. - 2010
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University