Computational indistinguishability logic

Authors:
Gilles Barthe;Marion Daubignard;Bruce Kapron;Yassine Lakhnech
Affiliations:
IMDEA Software, Madrid, Spain;University of Grenoble, Grenoble, France;University of Victoria, victoria, Canada;University of Grenoble, Grenoble, France
Venue:
Proceedings of the 17th ACM conference on Computer and communications security
Year:
2010

Citing 33
Cited 9

A calculus for cryptographic protocols

Information and Computation
On the Exact Security of Full Domain Hash

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Probabilistic Polynomial-Time Process Calculus and Security Protocol Analysis

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A composable cryptographic library with nested operations

Proceedings of the 10th ACM conference on Computer and communications security
A Computationally Sound Mechanized Prover for Security Protocols

SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Logics for reasoning about cryptographic constructions

Journal of Computer and System Sciences - Special issue on FOCS 2003
Computationally Sound Compositional Logic for Key Exchange Protocols

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata

CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
On the computational soundness of cryptographically masked flows

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Analyzing Security Protocols Using Time-Bounded Task-PIOAs

Discrete Event Dynamic Systems
Computationally sound mechanized proofs for basic and public-key Kerberos

Proceedings of the 2008 ACM symposium on Information, computer and communications security
Towards Producing Formally Checkable Security Proofs, Automatically

CSF '08 Proceedings of the 2008 21st IEEE Computer Security Foundations Symposium
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Computational soundness of observational equivalence

Proceedings of the 15th ACM conference on Computer and communications security
Towards automated proofs for asymmetric encryption schemes in the random oracle model

Proceedings of the 15th ACM conference on Computer and communications security
Formal certification of code-based cryptographic proofs

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Formal Language for Cryptographic Pseudocode

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
From qualitative to quantitative proofs of security properties using first-order conditional logic

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Random Systems: Theory and Applications

Information Theoretic Security
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Why provable security matters?

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Indistinguishability amplification

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Computationally sound typing for non-interference: the case of deterministic encryption

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
A framework for game-based security proofs

ICICS'07 Proceedings of the 9th international conference on Information and communications security
On the equality of probabilistic terms

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A probabilistic hoare-style logic for game-based cryptographic proofs

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Adaptive security of symbolic encryption

TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Automated security proofs with sequences of games

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
The security of triple encryption and a framework for code-based game-playing proofs

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Games and the impossibility of realizable ideal functionality

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Beyond provable security verifiable IND-CCA security of OAEP

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Computer-aided security proofs for the working cryptographer

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Logical formalisation and analysis of the mifare classic card in PVS

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Certified security proofs of cryptographic protocols in the computational model: an application to intrusion resilience

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Automated verification of block cipher modes of operation, an improved method

FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
A computational indistinguishability logic for the bounded storage model

FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Security protocol verification: symbolic and computational models

POST'12 Proceedings of the First international conference on Principles of Security and Trust
Verified security of redundancy-free encryption from Rabin and RSA

Proceedings of the 2012 ACM conference on Computer and communications security
Computational soundness of coinductive symbolic security under active attacks

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.01

Visualization

Abstract

Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in provable security, such as simulations and reductions. CIL is sound for the standard model, but also supports reasoning in the random oracle and other idealized models. We illustrate the benefits of CIL by formally proving the security of the probabilistic signature scheme (PSS).