Computationally Sound Analysis of a Probabilistic Contract Signing Protocol

No abstract is available for this paper.

• Publication year

  2009

• Venue

  European Symposium on Research in Computer Security

• Publication date

  2009-09-21

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-04444-1_35
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computationally secure two-round authenticated message exchange

  2010cited by this paper
• A Timely and Balanced Optimistic Contract-Signing Protocol

  2008cited by this paper
• Computer Security - ESORICS 2007, 12th European Symposium On Research In Computer Security, Dresden, Germany, September 24-26, 2007, Proceedings

  2007cited by this paper
• A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols

  2007cited by this paper
• Infinite State AMC-Model Checking for Cryptographic Protocols

  2007cited by this paper
• Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm

  2007cited by this paper
• Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols

  2006cited by this paper
• What agents can achieve under incomplete information

  2006cited by this paper
• FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings

  2006cited by this paper
• Computationally Sound Symbolic Secrecy in the Presence of Hash Functions

  2006cited by this paper
• A Dolev-Yao-Based Definition of Abuse-Free Protocols

  2006cited by this paper
• Explicit Randomness is not Necessary when Modeling Probabilistic Encryption

  2006cited by this paper
• Compositional analysis of contract signing protocols

  2005cited by this paper
• Computationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation

  2005cited by this paper
• Deciding Properties of Contract-Signing Protocols

  2005cited by this paper
• Contract signing, optimism, and advantage

  2003cited by this paper
• Game analysis of abuse-free contract signing

  2002cited by this paper
• Inductive methods and contract-signing protocols

  2001cited by this paper
• Advances in Cryptology — CRYPTO’ 93

  2001cited by this paper
• A game-based verification of non-repudiation and fair exchange protocols

  2001cited by this paper
• Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*

  2000cited by this paper
• On the Impossibility of Fair Exchange without a Trusted Third Party

  1999cited by this paper
• Abuse-Free Optimistic Contract Signing

  1999cited by this paper
• Advances in Cryptology — CRYPTO’ 99

  1999cited by this paper
• Asynchronous protocols for optimistic fair exchange

  1998cited by this paper
• Alternating-time temporal logic

  1997cited by this paper
• Entity Authentication and Key Distribution

  1993cited by this paper
• A fair protocol for signing contracts

  1990influential reference
• On the security of public key protocols

  1981cited by this paper
• Solving sequential conditions by finite-state strategies

  1969cited by this paper

• Pairwise Independent Key Generation Algorithm: A Survey

  2016cites this paper
• Verifying cryptographic security implementations in C using automated model extraction

  2015cites this paper
• A Review on Various Contract Signing Protocol

  2014cites this paper
• Two Factor Authentication Based Contract Signing Protocol

  2014cites this paper
• Game-theory and Logic for Non-repudiation Protocols and Attack Analysis

  2013cites this paper
• Deciding Epistemic and Strategic Properties of Cryptographic Protocols

  2012cites this paper
• Automatic verification of competitive stochastic systems

  2012cites this paper
• A Formal Definition of Online Abuse-Freeness

  2010cites this paper
• On Probabilistic Alternating Simulations

  2010cites this paper
• Verifying Implementations of Security Protocols in C Probation report

  2008cites this paper
• The tractability of model checking for LTL: The good, the bad, and the ugly fragments

  2008cites this paper