CSE 364 -- Crypto: Primitives and Protocols --- Fall
2007
| Instructor: |
Aggelos Kiayias
|
| E-mail: |
'my first name' at cse.uconn.edu |
| Web: |
http://www.cse.uconn.edu/~akiayias/cse364fa07/ |
| Class: |
Lecture. Tuesday 6pm-9. ITE 119. |
| Teaching Assistants: |
Serdar Pehlivanoglu and
Hong-Sheng Zhou (Office hours: TBA)
|
Modern cryptography and security is an amazingly beautiful mixture
of some of the most sophisticated areas of Computer Science, Mathematics
and Engineering.
Computational Complexity, Probability and Statistics,
Number Theory, Computer Systems Design and many other areas are
all orchestrated in a common direction: the attainment of secure
communication and other secure functionalities
over various domains and objectives.
The focus of this class is the thorough treatment of modern
cryptographic primitives and protocols
as well as the discussion
of various aspects of computer security and how cryptography
can be used to secure computer systems.
The class has as pre-requisites the following:
- "mathematical maturity", typically attained by completing
the standard sequence of math courses in the undergraduate and graduate level.
If you are not sure how mature you are, contact me.
- A class in computational-complexity/design and analysis of algorithms/
theoretical computer science. Being comfortable (even happy)
with time-complexity,
computational hardness, asymptotic notation etc. is expected.
-
The class will not require any implementation or programming project.
Nevertheless it is expected that the students are sufficiently exposed
to programming, software engineering and operating systems
so that they understand the
major issues as well as the
subtleties and nuances of computer systems design.
There will be no assigned text for the class.
Various readings may be
assigned from various sources as needed.
Lecture notes from the class will be made available
on the web.
The selection of topics that will be covered in the semester includes:
- Provable security.
- Math overview: probability.
- Computational complexity.
- Algebra and number theory.
- Key-exchange protocols.
- Public-key encryption : ElGamal, RSA and others.
- Digital signatures : Schnorr, RSA, DSA and others.
- Modeling adversaries against encryption: CPA, CCA and other attack models.
- Modeling adversaries against signatures: Chosen message attacks, strong
unforgeability.
- Structuring proofs of security as sequences of games.
- Pseudorandom number generation.
- Proofs of knowledge.
- The Fiat-Shamir transform.
- The random oracle model.
- Digital signatures with special properties: blind and group signatures.
- The universal composition framework.
- Traitor tracing and broadcast encryption.
- Electronic voting.
- Electronic cash.
- Digital rights management.
Grading: the final grade will be based on four homeworks (20%),
a closed-book midterm (40%) and a take-home final-exam (40%).
More information about tests and homeworks will be available
in the web-site of the class
http://www.cse.uconn.edu/~akiayias/cse364fa07/