Computationally Sound Compositional Logic for Key Exchange Protocols

Authors:
Anupam Datta;Ante Derek;John C. Mitchell;Bogdan Warinschi
Affiliations:
Stanford University, USA;Stanford University, USA;Stanford University, USA;Loria, INRIA-Lorraine, France
Venue:
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Year:
2006

Citing 0
Cited 29

Protocol Composition Logic (PCL)

Electronic Notes in Theoretical Computer Science (ENTCS)
On the protocol composition logic PCL

Proceedings of the 2008 ACM symposium on Information, computer and communications security
Computationally sound mechanized proofs for basic and public-key Kerberos

Proceedings of the 2008 ACM symposium on Information, 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
Computational soundness for key exchange protocols with symmetric encryption

Proceedings of the 16th ACM conference on Computer and communications security
Tackling adaptive corruptions in multicast encryption protocols

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Analysis of EAP-GPSK authentication protocol

ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Formal proofs of cryptographic security of Diffie-Hellman-based protocols

TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Computational indistinguishability logic

Proceedings of the 17th ACM conference on Computer and communications security
Computationally sound analysis of protocols using bilinear pairings

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Inductive trace properties for computational security

Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Automating computational proofs for public-key-based key exchange

ProvSec'10 Proceedings of the 4th international conference on Provable security
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems

Journal of Automated Reasoning
Automated Proofs for Asymmetric Encryption

Journal of Automated Reasoning
Composition theorems without pre-established session identifiers

Proceedings of the 18th ACM conference on Computer and communications security
Composability of bellare-rogaway key exchange protocols

Proceedings of the 18th ACM conference on Computer and communications security
A user interface for a game-based protocol verification tool

FAST'09 Proceedings of the 6th international conference on Formal Aspects in Security and Trust
Verified Cryptographic Implementations for TLS

ACM Transactions on Information and System Security (TISSEC) - Special Issue on Computer and Communications Security
Automated proofs for asymmetric encryption

Concurrency, Compositionality, and Correctness
Key exchange with anonymous authentication using DAA-SIGMA protocol

INTRUST'10 Proceedings of the Second international conference on Trusted Systems
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
Security goals and protocol transformations

TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
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
Inductive proofs of computational secrecy

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
Computational soundness of coinductive symbolic security under active attacks

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Computationally complete symbolic attacker and key exchange

Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Tractable inference systems: an extension with a deducibility predicate

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Establishing and preserving protocol security goals

Journal of Computer Security - Foundational Aspects of Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies observational determinism, a generalisation of non-interference for multi-threaded programs. Standard notions of non-interference only consider input and output of programs, but to ensure the security of multithreaded programs, one ...