LEA
Department of Computer Science at the Technische Universität München
Chair for Efficient Algorithms
Postal address: 80290 München; Premises: Arcisstr.21, 80333 München
deutsch

Seminar: New Applications of Cryptographic Algorithms

[Summary] [List of Topics] [List of Talks]

Summary

Cryptographic methods will play an increasingly important role for many applications. They provide the only means to protect sensitive data transmitted over unsecure networks from manipulation. This seminar introduces several new applications for cryptographic algorithms. In addition, important background knowledge is covered.

In particular, we focus on the following applications: digital signatures make it possible to sign documents which are transmitted in electronic form such that signatures cannot be forged; smartcards, i.e., plastic cards with integrated microchips, are used for safe identification; digital cash allows users to divide electronic ``bank notes'' obtained from a bank or company into arbitrarily small pieces which can be used to pay for good purchased via the internet; broadcast encryption is interesting for satellite tv providers who want to ensure that only authorized subscribers can decrypt their broadcast signals (Pay-TV, Videocrypt); finally, electronic elections may replace conventional elections in the future.

The background knowledge covered in the seminar includes one-way functions and trapdoor functions which are essential for public-key cryptography. Relevant topics in complexity theory are also addressed.


List of Topics:

  1. Basics for one-way functions and trapdoor functions
  2. Candidates for one-way functions
  3. One-way hash functions
  4. Tests for Primality
  5. Digital signatures: DSS and DSA
  6. Secret sharing
  7. Secure cryptosystems and provably fair poker games
  8. Interactive proofs that do not reveal any information
  9. Fiat-Shamir zero-knowledge test and its application in smartcards
  10. Digital cash
  11. Broadcast encryption
  12. Electronic Elections

The list of topics including references can also be obtained as a PostScript file.


List of Talks:

28.11.96: Werner Buchert
Candidates for one-way functions (Topic 2)
12.12.96: Rüdiger Pein
Tests for Primality (Topic 4)
19.12.96: Nils Frielinghaus
Digital signatures: DSS and DSA (Topic 5)
9.1.97: Tobias Knopff
Secret sharing (Topic 6)
16.1.97: Vladimir Beliavski
Secure cryptosystems and provably fair poker games (Topic 7)
23.1.97: Ilia Dub
Interactive proofs that do not reveal any information (Topic 8)
30.1.97: Michael Bauer
Fiat-Shamir zero-knowledge test and its application in smartcards (Topic 9)
6.2.96: Christian Basler
Digital cash (Topic 10)
13.2.97: Maximilian Fischer
Broadcast encryption (Topic 11)
20.2.97: Boris Sirota
One-way hash functions (Topic 3)
27.2.97: Jens Ernst
Basics for one-way functions and trapdoor functions (Topic 1)


For further information please contact: Thomas Erlebach or Volker Heun.


Thomas Erlebach, 1996-10-29