Security of Cryptographic Functions and Efficient Implementations

Status

This project started in October 2004 and ended in August 2007.

Researchers

Prof. Dr. Ueli Maurer, Cryptography & Information Security Group, ETH
Johan Sjödin, Cryptography & Information Security Group, ETH

Motivation

The goal of this project is to base the security of practical cryptographic schemes on weakened assumptions (which are hence more likely to hold). This is a general research goal in cryptography. We plan to study known and define new security properties of cryptographic functions like one-way functions, hash functions, pseudo-random generators, pseudo-random functions (PRF), pseudo-random permutations, and message authentication codes (MACs).

Publications

U. Maurer and J. Sjödin.
Single-Key AIL-MACs from any FIL-MAC.
In ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, volume 3580, pages 472-484, July 2005.

U. Maurer and J. Sjödin.
Domain expansion of MACs: Alternative uses of the FIL-MAC.
In Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, volume 3796, pages 168-185, December 2005.

U. Maurer, Y. A. Oswald, K. Pietrzak and J. Sjödin.
Luby-Rackoff ciphers with weak round functions.
In Advances in Cryptology – EUROCRYPT 2006, Lecture Notes in Computer Science, Springer-Verlag, volume 4004, pages 391-408, May 2006.

U. Maurer and J. Sjödin.
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security.
In Advances in Cryptology — EUROCRYPT 2007 , Lecture Notes in Computer Science, Springer-Verlag, volume 4515, pages 498-516, May 2007.

K. Pietrzak and J. Sjödin.
Range Extension for Weak PRFs; The Good, the Bad, and the Ugly.
In Advances in Cryptology — EUROCRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, volume 4515, pages 517-533, May 2007.

K. Pietrzak and J. Sjödin.
Weak Pseudorandom Functions in Minicrypt.
In ICALP 2008, Lecture Notes in Computer Science, Springer-Verlag, volume 5126, pages 423-436, Jul 2008.