Strand Spaces: Why is a Security Protocol Correct?

Fabrega, F. J.; Herzog, Jonathan; Gutman, Joshua D.

doi:10.21236/ada459060

Cited by 86 publications

(41 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CPSA is an automated tool functioning on the support of the formal method strand space model. 38,39,41 The CPSA endeavors to discover all feasible dissimilar skeletons. The skeleton narrates the set of feasible executions for a given security protocol.…”

Section: Cpsa Resultsmentioning

confidence: 99%

An enhanced bilinear pairing based authenticated key agreement protocol for multiserver environment

Sureshkumar

Amin

Anitha

2017

Int J Communication

View full text Add to dashboard Cite

Summary To circumvent using of multiple single servers, the theory of multiserver communication exists and numerous authentication protocols put forward for providing secure communication. Very recently, Amin‐Biswas proposes bilinear pairing–based multiserver scheme by describing some security pitfalls of Hsieh‐Leu protocol and claims that it is secured against related security threats. However, this paper claims that Amin‐Biswas protocol is still susceptible to off‐line identity and password guessing attack, user untraceability attack, and server masquerading attack. The cryptographic protocol should be attacks‐free for real‐time application. To achieve attacks‐free security, we put forward smart card–based multiserver authentication protocol by using the concept of bilinear pairing operation. The formal method strand space model has been used to prove the correctness of the proposed scheme. Additionally, rigorous security analysis ensures pliability of common security threats. The performance and security features of our scheme are also compared with that of the similar existing schemes. The comparison results show that our protocol achieves more security features with less complexity.

show abstract

Section: Cpsa Resultsmentioning

confidence: 99%

An enhanced bilinear pairing based authenticated key agreement protocol for multiserver environment

Sureshkumar

Amin

Anitha

2017

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Readers can refer to Fabrega et al . for more information about SSM provided by the original authors.…”

Section: Strand Space Model and Its Limitation For Counterexamplesmentioning

confidence: 99%

“…So it is important for researchers to find the counterexamples. In references , , and , researchers brought out counterexamples directly, but did not explain how to find the counterexamples.…”

Section: Strand Space Model and Its Limitation For Counterexamplesmentioning

confidence: 99%

See 1 more Smart Citation

A new method to deduce counterexamples in secure routing protocols based on strand space model

Dong

Yang

Sheng

et al. 2016

Security Comm Networks

View full text Add to dashboard Cite

Strand space model, an excellent formal analysis method, is still not effective enough when it is used to analyze ad hoc routing protocols. Counterexamples cannot be deduced directly if a protocol is proved insecure by strand space model. Based on backward reasoning and strand space model, an attack analysis method is proposed to find all possible attacks that cause nonexistent routes to be accepted. To begin with, a nonexistent route is assumed to be accepted by a routing protocol. Then, to decrease the complexity of analysis, an adversarial node abstraction process is carried out to make all the intermediate nodes in the nonexistent route turn into normal nodes. Furthermore, a combined analysis of strand space model and cross‐route attack is carried on the route reply phase of the routing protocol. Finally, all possible attacks that lead to the nonexistent route can be deduced after combined analyzing of the route request phase. Then, we take endairA—a classic secure routing protocol in ad hoc networks—as an example to verify the correctness and effectiveness of the new method. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

“…A strand [13] represents the sequence of messages sent and received by a principal executing the protocol or by the intruder. A principal sending (resp.…”

Section: Maude-npa's Execution Modelmentioning

confidence: 99%

State Space Reduction in the Maude-NRL Protocol Analyzer

Escobar

Meadows

Meseguer

2008

Computer Security - ESORICS 2008

View full text Add to dashboard Cite

Abstract. The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different equational properties. It both extends and provides a formal framework for the original NRL Protocol Analyzer, which supported equational reasoning in a more limited way. Maude-NPA supports a wide variety of algebraic properties that includes many crypto-systems of interest such as, for example, onetime pads and Diffie-Hellman. Maude-NPA, like the original NPA, looks for attacks by searching backwards from an insecure attack state, and assumes an unbounded number of sessions. Because of the unbounded number of sessions and the support for different equational theories, it is necessary to develop ways of reducing the search space and avoiding infinite search paths. As a result, we have developed a number of state space reduction techniques. In order for the techniques to prove useful, they need not only to speed up the search, but should not violate soundness so that failure to find attacks still guarantees security. In this paper we describe the state space reduction techniques we use. We also provide soundness proofs, and experimental evaluations of their effect on the performance of Maude-NPA.

show abstract

Strand Spaces: Why is a Security Protocol Correct?

Abstract: Abstract

Cited by 86 publications

References 14 publications

An enhanced bilinear pairing based authenticated key agreement protocol for multiserver environment

An enhanced bilinear pairing based authenticated key agreement protocol for multiserver environment

A new method to deduce counterexamples in secure routing protocols based on strand space model

State Space Reduction in the Maude-NRL Protocol Analyzer

Contact Info

Product

Resources

About