Show The Graduate Center Menu
 
 

Modern Cryptography

Instructor's Biography


Nelly Fazio is an Assistant Professor in the Computer Science Departments at the City

College and the Graduate Center of CUNY. Her elds of interest include Cryptography

and Information Security, with a focus on foundations (public-key and non-commutative

cryptography) and applications (content protection, access control, and security in military

scenarios). Her research is funded in part by the National Science Foundation, by the U.S.

Army Research Laboratory and the U.K. Ministry of Defence, and by several CUNY research

grants.

Dr. Fazio's awards include a 2013 NSF CAREER award, an NYU Sandra Bleistein Prize

for "notable achievement by a woman in Applied Mathematics or Computer Science", an

EU Marie Curie Fellowship, and an honorable mention for the NYU Janet Fabri Prize for

an "outstanding dissertation in Computer Science".

Dr. Fazio received her Ph.D. from New York University, under the supervision of Prof.

Yevgeniy Dodis. Her doctoral training also included research visits at Stanford University, at

the Ecole Normale Superieure in Paris, France, and at Aarhus Universitet, Denmark. Before

joining CUNY, Dr. Fazio was a postdoctoral fellow in the Content Protection group at IBM

Almaden Research Center and a visiting researcher in the Cryptography Research group at

IBM T.J. Watson Research center.

 

Course Rationale


Cryptographic techniques are an essential ingredient in the security mechanisms that pro-

tect the privacy of e-commerce transactions and the secrecy of cloud storage. This course

introduces the fundamental notions underlying the design and evaluation of cryptographic

primitives that are the core of the security protocols that enable our modern way of life.

 

Course Description


This introductory, graduate-level course covers the theoretical foundations of modern cryp-

tography. Emphasis will be placed on precise denitions, rigorous proof techniques, and anal-

ysis of the relations among the various cryptographic primitives (such as one-way functions,

pseudo-random generators, pseudo-random permutations, and trapdoor permutations).

List of topics includes: computational security, cryptographic hash functions, private-key

encryption, message authentication codes, public-key encryption, digital signatures, commit-

ment schemes.
 

Pre-Requisites
 

No prior knowledge of cryptography is required. However, general ease with algorithms and

elementary probability theory, and maturity with mathematical proofs will be assumed.

 

Learning Objectives


Discuss how cryptography helps to achieve common security goals (data secrecy, mes-

sage integrity, non-repudiation) and tasks (authentication).

Explain the notions of symmetric encryption, hash functions, and message authentica-

tion, and sketch their formal security denitions.

Describe the specics of some of the prominent techniques for encryption, hashing, and

message authentication (e.g., DES, AES, SHA-1, HMAC).

Explain the notions of public-key encryption and digital signatures, and sketch their

formal security denitions.

Describe and implement the specics of some of the prominent techniques for public-

key cryptosystems and digital signature schemes (e.g., Rabin, RSA, ElGamal, DSA,

Schnorr, OAEP, PSS/PSS-R).

Illustrate the dierence between symmetric and public-key cryptography.

Evaluate cryptographic primitives and their implementations for correctness, eciency,

and security.

 

Course Textbook


Introduction to Modern Cryptography by Jonathan Katz and Yehuda Lindell. Chapman & Hall/CRC Press, 2007.


Course Topics


1.Introduction

 Classical vs. modern cryptography. Information-theoretic security: Shannon's

 denition of perfect secrecy. Vernam's one-time pad. Limitation of the informa-

tion theoretic approach.

2.Computational Hardness and One-Wayness

-One-way functions. One-way permutations. Trapdoor permutations. Concrete

examples: integer multiplication and modular exponentiation.

-Hardcore predicates. Goldreich-Levin construction.

-Pseudo-random generators. Blum-Micali construction. Ecient instantiation:

-Blum-Blum-Shub construction.

-Pseudo-random functions. Goldreich-Goldwasser-Micali construction.

-Pseudo-random permutations. Luby-Racko construction.

-ε-universal, universal one-way, and collision resistant hash functions. Merkle-

Damgaard construction.

-The hash-the-MAC paradigm.

3. Computationally Secure Symmetric Cryptography

 -Denition of secure symmetric encryption: IND, CPA, CCA.

 -Block-ciphers and mode of operations.

 -Message authentication codes.

 -Hash-then-authenticate paradigm.

4. Managing Shared Keys

 -The key distribution problem

 -Die-Hellman Key Exchange

5.Computationally Secure Asymmetric Cryptography

 -Denition of secure asymmetric encryption: IND, CPA, CCA.

 -Ecient constructions (ElGamal, RSA and Rabin's schemes) and padding schemes

(OAEP+).

 -Blum-Goldwasser construction. Goldwasser-Micali construction.

6.Digital Signatures

 -Denition of secure digital signatures.

 -Lamport's one-time signature scheme.

 -The hash-then-sign paradigm.

 -Rabin and RSA signature schemes. Padding Schemes (PSS, PSSR).

 -Schnorr signature scheme.

 -Signature schemes for multiple messages: chain-based and tree-based construc-

tions.

7. A taste of more advanced topics (identication schemes, commitment schemes, secret

sharing).

 

Assessment

Grade will be based on:

  • Class participation: 10%
  • Assignments: 40%
  • Term project (presentation and report): 50%