TCC Test-of-Time Award

A modular analysis of the Fujisaki-Okamoto transformation by Dennis Hofheinz, Kathrin Hövelmanns, and Eike Kiltz. For modular designs of secure Key-Encapsulation Mechanisms with tight bounds in both classical and quantum settings, enabling the KEM constructions used in the NIST PQC standard.

Notions of Reducibility between Cryptographic Primitives by Omer Reingold, Luca Trevisan, and Salil P. Vadhan. For providing rigorous and systematic taxonomy of reductions in cryptography, in particular coining fully black-box reductions and motivating their use in barrier results. This award was given posthumously to Luca Trevisan. The TCC Test of Time award ceremony included a tribute to Luca from Salil. The Youtube video is also linked from the image.

Perfectly secure oblivious RAM without random oracles by Ivan Damgård, Sigurd Meldgaard, and Jesper Buus Nielsen. This paper was published in TCC 2011. The award is given for the first perfectly secure unconditional Oblivious RAM scheme and for setting the stage for future Oblivious RAM and PRAM schemes. See the YouTube video (also linked from the image).

Keyword Search and Oblivious Pseudorandom Functions by Michael J. Freedman, Yuval Ishai, Benny Pinkas, and Omer Reingold. This paper was published in TCC 2005. The award is given for introducing and formalizing the notion of Oblivious Pseudorandom Functions, and identifying connections to other primitives such as keyword search, inspiring a vast amount of theoretical and practical work.

Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency by Paul Valiant. This paper was published in TCC 2008. The award is given for demonstrating the power of recursive composition of proofs of knowledge and enabling the development of efficiently verifiable proofs of correctness for complex computations.

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices by Chris Peikert (University of Michigan) and Alon Rosen (IDC Herzlia). This paper was published in TCC 2006. The award is given for advancing the use of hard algebraic lattice problems in cryptography, paving the way for major theoretical and practical advances

Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology by Ueli Maurer (ETH), Renato Renner (ETH), and Clemens Holenstein. This paper was published in TCC 2004. The award is given for introducing the security notion of "indifferentiability", that had a significant impact on both the theory of cryptography and the design of practical cryptosystems.

Calibrating Noise to Sensitivity in Private Data Analysis by Cynthia Dwork (Microsoft Research), Frank McSherry, Kobbi Nissim (Ben-Gurion University), and Adam Smith (Penn State). This paper was published in TCC 2006. The award is given for introducing the definition of differential privacy, and providing a solid mathematical foundation for a vast body of subsequent work on private data analysis.