Fair Exchange in Strand Spaces

@inproceedings{Guttman2009FairEI,
  title={Fair Exchange in Strand Spaces},
  author={Joshua D. Guttman},
  booktitle={SECCO},
  year={2009}
}
  • J. Guttman
  • Published in SECCO 22 October 2009
  • Computer Science, Mathematics
Many cryptographic protocols are intended to coordinate state changes among principals. Exchange protocols coordinate delivery of new values to the participants, e.g. additions to the set of values they possess. An exchange protocol is fair if it ensures that delivery of new values is balanced: If one participant obtains a new possession via the protocol, then all other participants will, too. Fair exchange requires progress assumptions, unlike some other protocol properties. The strand space… 

Figures from this paper

Logical Protocol Analysis for Authenticated Diffie-Hellman ∗

This paper develops a logical framework for protocol analysis based on strand space ideas and shows that it identifies exact assumptions on the behavior of a certifying authority that prevent attacks on two authenticated DH protocols, the Unified Model and Menezes-Qu-Vanstone.

Shapes: Surveying Crypto Protocol Runs

  • J. Guttman
  • Computer Science, Mathematics
    Formal Models and Techniques for Analyzing Security Protocols
  • 2011
A search that finds the shapes, starting from a protocol and a skeleton A, is described, driven by the challenge-response patterns formalized in the strand space authentication tests.

Shapes : Surveying Crypto Protocol Runs 1

A search that finds the shapes, starting from a protocol and a skeleton A, is described, driven by the challenge-response patterns formalized in the strand space authentication tests.

A Verification Framework for Stateful Security Protocols

A protocol specification framework is proposed, which facilitates explicit modeling of states and state transformations, and an algorithm for verifying security properties of protocols with unbounded state-evolving, by tracking state transformation and checking the validity of the state- Evolving traces is developed.

Formal Analysis of Protocols Based on TPM State Registers

A Horn-clause-based framework for analysing security protocols that use Platform configuration registers (PCRs), which are registers for maintaining state inside the Trusted Platform Module (TPM), which proves the soundness of this extraction process.

Formal Modeling and Analysis of Fairness Characterization of E-Commerce Protocols

This paper forms a new notion of fairness verification based on the strand space model and proposes a method for fairness verification, which can potentially determine whether evidences have been forged in transactions.

Stateful Security Protocol Verification

This paper proposes a protocol specification framework, which explicitly represents protocol execution states and state transformations, and develops an algorithm for verifying security properties by utilizing the key ingredients of the first-order reasoning for reachability analysis, while tracking state transformation and checking the validity of newly generated states.

StatVerif: Verification of Stateful Processes

The ProVerif compiler is extended to a compiler for StatVerif: it takes processes written in the extended process language, and produces Horn clauses, and it is proved the correctness of the Stat Verif compiler.

Institutional Knowledge at Singapore Management University Institutional Knowledge at Singapore Management University A verification framework for stateful security protocols A verification framework for stateful security protocols

An algorithm for verifying security properties of protocols with unbounded state-evolving, by tracking state transformation and checking the va-lidity of the state- Evolving traces is developed.

References

SHOWING 1-10 OF 27 REFERENCES

Optimistic fair exchange of digital signatures

We present a new protocol that allows two players to exchange digital signatures over the Internet in a fair way, so that either each player gets the other's signature, or neither player does. The

A meta-notation for protocol analysis

This paper uses a multiset rewriting formalism, based on linear logic, to state the basic assumptions of this model, and defines a class of theories that correspond to finite-length protocols, with a bounded initialization phase but allowing unboundedly many instances of each protocol role.

Authentication tests and the structure of bundles

Generic non-repudiation protocols supporting transparent off-line TTP

It is argued that it is really meaningful in practice to exploit generic fair non-repudiation protocols with transparent off-line trusted third party (TTP) to overcome some limitations and shortcomings in previous schemes.

Optimal efficiency of optimistic contract signing

Tight lower bounds on the message and round complexity of optimistic contract signing on synchronous and asynchronous networks are proved, and new and efficient protocols based on digital signatures which achieve provably optimal efficiency are presented.

Contract signing, optimism, and advantage

How To Exchange Secrets with Oblivious Transfer

  • M. Rabin
  • Mathematics, Computer Science
    IACR Cryptol. ePrint Arch.
  • 2005
As this paper puts forward the notion of “Oblivious Transfers” and is a well-known and frequently cited paper, I felt I should typeset the manuscript, and here is the result. While typesetting, I

Cryptographic Protocol Composition via the Authentication Tests

  • J. Guttman
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2008
A model-theoretic technique, using homomorphisms among models to prove results about a syntactically defined set of formulas, appears to be novel for protocol analysis.

Searching for Shapes in Cryptographic Protocols

A method for enumerating all essentially different executions possible for a cryptographic protocol, called the shapes of the protocol, and cpsa, the Cryptographic Protocol Shape Analyzer, implements the method.

A Certified Email Protocol Using Key Chains

  • J. CederquistM. DashtiS. Mauw
  • Computer Science
    21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
  • 2007
An asynchronous optimistic certified email protocol, with stateless recipients, that relies on key chains to considerably reduce the storage requirements of the trusted third party and outperforms the existing schemes that achieve strong fairness.