The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs

By Mihir Bellare, Phillip Rogaway. International Conference on the Theory and Application of Cryptographic Techniques, 2006

863 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/400251fab502adf5a8ecdf6e5ba7d522bfe5cf1a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

In Computer Vision and Pattern Recognition

Citations in the corpus

A Modular Analysis of the Fujisaki-Okamoto Transformation (2017, positive): “Following [38, 8], we use code-based games.”
Robust computational secret sharing and a unified account of classical secret-sharing goals (2007, methodology): “We employ code-based game-playing in our proofs, as explored in [4].”
Computer-Aided Security Proofs for the Working Cryptographer (2011, methodology): “This can be seen as a semantic variant of the Fundamental Lemma of Game-Playing; the logic allows to dispense with the code instrumentation needed to apply the syntactic counterpart of the lemma.”
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm (2000, background): “The following is the Fundamental Lemma of game-playing of [6].”
Introduction to Modern Cryptography, Second Edition (2014, neutral): “27 (the “switching lemma”) can be found in [24].”
Cryptϵ: Crypto-Assisted Differential Privacy on Untrusted Servers (2019, background): “Last, the security (privacy) proofs for just stand-alone cryptographic and DP mechanisms can be notoriously tricky [19, 75].”
Formal certification of code-based cryptographic proofs (2009, methodology): “Whereas Bellare and Rogaway [9] already o bserved that code-based proofs could be more easily amenable to machine-checking, Halevi [21] argued that formal verificat ion techniques should be used to improve trust in cryptographic proo fs, and set up a programme for building a tool that could be used ”
Message-Locked Encryption and Secure Deduplication (2013, methodology): “For our security definitions and proofs we use the code-based game playing framework of [11], though adopting some of the syntax and semantics of [42].”
Foundations of garbled circuits (2012, background): “Our definitions and proofs are expressed via code-based games [12] so we recall here the language and specify the particular conventions we use.”
Probabilistic relational reasoning for differential privacy (2012, methodology): “Thanks to a recent development, the construction of game-playing proofs [6] in CertiCrypt can be achieved efficiently using EasyCrypt [4], a front-end that generates automatically probabilistic RHL derivations using SMT solvers and a verification condition generator.”
New Proofs for NMAC and HMAC: Security without Collision Resistance (2006, background): “Since G3, G4 differ only in statements that follow the setting of bad, (19) follows from the Fundamental Lemma of Game Playing [11].”
Order-Preserving Symmetric Encryption (2009, background): “1 As shown in [8], lazy sampling of “exotic” functions with many constraints can be tricky.”