A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties

Escobar, Santiago; Meadows, Catherine; Meseguer, José

doi:10.1016/j.tcs.2006.08.035

Cited by 95 publications

(96 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact the noted tools OFMC and ProVerif can handle algebraic properties and with Maude-NPA there is even a protocol verifier based on the algebraic specification framework Maude [21]. However, a declarative formalization of zero-knowledge proofs does not fall into the fragments of algebraic reasoning that can be handled well (such as convergent rewrite theories), and therefore require a quite technical encoding [7].…”

Section: Discussionmentioning

confidence: 99%

A Formal Model of Identity Mixer

Camenisch

Mödersheim²,

Sommer

2010

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

Abstract. Identity Mixer is an anonymous credential system developed at IBM that allows users for instance to prove that they are over 18 years old without revealing their name or birthdate. This privacy-friendly technology is realized using zero-knowledge proofs. We describe a formal model of Identity Mixer that is well-suited for automated protocol verification tools in the spirit of black-box cryptography models.

show abstract

Section: Discussionmentioning

confidence: 99%

A Formal Model of Identity Mixer

Camenisch

Mödersheim²,

Sommer

2010

Formal Methods for Industrial Critical Systems

View full text Add to dashboard Cite

show abstract

“…The Maude-NPA tool [6] supports protocols specified as linear role-scripts, properties specified as symbolic states, and equational theories with a finite variant decomposition modulo AC, ACI, or C. It is unclear if our case studies that use global state, loops, and temporal formulas can be specified in Maude-NPA. With respect to their support of equational theories, Maude-NPA and Tamarin are incomparable.…”

Section: Related Toolsmentioning

confidence: 99%

The TAMARIN Prover for the Symbolic Analysis of Security Protocols

Meier

Schmidt

Cremers

et al. 2013

Lecture Notes in Computer Science

427

335

View full text Add to dashboard Cite

show abstract

“…In the Maude-NPA [15,16], a state in the protocol execution is a term t of sort state, t ∈ T Σ P /E P (X) state . A state is a multiset built by an associative and commutative union operator & .…”

Section: Background On Term Rewritingmentioning

confidence: 99%

Protocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA

Sasse

Escobar

Meadows

et al. 2011

Security and Trust Management

Self Cite

View full text Add to dashboard Cite

Abstract. There is a growing interest in formal methods and tools to analyze cryptographic protocols modulo algebraic properties of their underlying cryptographic functions. It is well-known that an intruder who uses algebraic equivalences of such functions can mount attacks that would be impossible if the cryptographic functions did not satisfy such equivalences. In practice, however, protocols use a collection of wellknown functions, whose algebraic properties can naturally be grouped together as a union of theories E1∪. . .∪En. Reasoning symbolically modulo the algebraic properties E1 ∪ . . . ∪ En requires performing (E1 ∪ . . . ∪ En)-unification. However, even if a unification algorithm for each individual Ei is available, this requires combining the existing algorithms by methods that are highly non-deterministic and have high computational cost. In this work we present an alternative method to obtain unification algorithms for combined theories based on variant narrowing. Although variant narrowing is less efficient at the level of a single theory Ei, it does not use any costly combination method. Furthermore, it does not require that each Ei has a dedicated unification algorithm in a tool implementation. We illustrate the use of this method in the Maude-NPA tool by means of a well-known protocol requiring the combination of three distinct equational theories.

show abstract

A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties

Cited by 95 publications

References 24 publications

A Formal Model of Identity Mixer

A Formal Model of Identity Mixer

The TAMARIN Prover for the Symbolic Analysis of Security Protocols

Protocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA

Contact Info

Product

Resources

About