IACR Test-of-Time Awards

The IACR Test-of-Time Award is given annually for each one of the three IACR General Conferences (Eurocrypt, Crypto, and Asiacrypt). An award will be given at a conference for a paper which has had a lasting impact on the field and was published 15 years prior. More information about the Test-of-Time award can be found in the policy guidelines document and the nominations page.

The individual conferences CHES, TCC, and PKC each have their own Test-of-Time award for papers published at these conferences. These follow slightly different policies.

Award Recipients

Preimage Attacks on 3, 4, and 5-Pass HAVAL, by Kazumaro Aoki and Yu Sasaki
For providing new attack frameworks in symmetric-key cryptanalysis by formally introducing the Meet-in-the-Middle Preimage Attacks against hash functions, which was later generalized into key-recovery attacks against block ciphers, and collision attacks against hash functions.

A Framework for Efficient and Composable Oblivious Transfer, by Chris Peikert, Vinod Vaikuntanathan and Brent Waters
For the creation of a simple framework for achieving efficient UC composable protocols that can be realized under a variety of concrete assumptions, introducing a powerful notion of dual-mode encryption and allowing for the first time to create bandwidth efficient Regev encryption.

Efficient Non-interactive Proof Systems for Bilinear Groups, by Jens Groth and Amit Sahai
For providing efficient Groth-Sahai proofs that have given rise to many applications including succinct non-interactive arguments.

On the Indifferentiability of the Sponge Construction, by Guido Bertoni, Joan Daemen, Michael Peeters and Gilles Van Assche
For introducing the Sponge construction that is deployed in world-wide standards such as SHA-3 and ASCON.

Faster Addition and Doubling on Elliptic Curves, by Daniel J. Bernstein and Tanja Lange
For introducing efficient elliptic curve addition formulae in the context of Edwards forms of elliptic curves.

Deterministic and Efficiently Searchable Encryption, by Mihir Bellare, Alexandra Boldyreva and Adam O'Neill
For placing searchable encryption on a rigorous footing, leading to a huge interest in this field in applications.

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries, by Yehuda Lindell and Benny Pinkas
For providing the first implementable protocol for actively secure variants of Yao's protocol, and thus paving the way to more practical constructions.

A provable-security treatment of the key-wrap problem, by Phillip Rogaway and Thomas Shrimpton
For placing the important real world primitive of key-wrapping on a solid theoretic foundation.

New proofs for NMAC and HMAC: Security without collision-resistance, by Mihir Bellare
For proving that the security of the widely deployed HMAC construction does not depend on the collision resistance of the underlying hash function.

Simulation-sound NIZK proofs for a practical language and constant size group signatures, by Jens Groth
For constructing asymptotically optimal NIZK proofs and group signatures without using random oracles, and paving the way to practical constructions.

Fuzzy Identity-Based Encryption , by Amit Sahai and Brent Waters
For laying the foundations of attribute-based encryption and other advanced notions of encryption.

Finding collisions in the full SHA-1 , by Xiaoyun Wang, Yiqun Lisa Yin and Hongbo Yu
For a breakthrough in the cryptanalysis of hash functions.

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log, by Pascal Paillier and Damien Vergnaud
For developing a new meta-reduction approach in the security proof of cryptosystems

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , by Yevgeniy Dodis, Leonid Reyzin, Adam D. Smith
For introducing new techniques for entropy extraction from noisy data.
The full version of this Eurocrypt 2004 paper was later published in the SIAM Journal on Computing, 38 (1), 97-139, 2008 , together with Rafail Ostrovsky as an additional author. The authors gratefully acknowledge his contribution to their joint work.

Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions , by Antoine Joux
For the development of an important attack on a widely-used class of collision resistant hash functions.

How Far Can We Go Beyond Linear Cryptanalysis? , by Thomas Baignères, Pascal Junod, Serge Vaudenay
For introducing new techniques in linear cryptanalysis of block ciphers.

Nominations and Contact Information

Nomination information can be found here. The chair of the Award Committee can be reached by email at .