Maude-NPA

State space reduction in the Maude-NRL protocol analyzer. 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, one-time 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. In order for the techniques to prove useful, they need not only to speed up the search, but should not violate completeness, so that failure to find attacks still guarantees security. In this paper we describe some state space reduction techniques that we have implemented in Maude-NPA. We also provide completeness proofs, and experimental evaluations of their effect on the performance of Maude-NPA.


References in zbMATH (referenced in 19 articles , 1 standard article )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele: A formalisation of nominal $\alpha$-equivalence with A and AC function symbols (2017)
  2. Baelde, David; Delaune, Stéphanie; Hirschi, Lucca: A reduced semantics for deciding trace equivalence (2017)
  3. Chadha, Rohit; Cheval, Vincent; Ciob^acă, Ştefan; Kremer, Steve: Automated verification of equivalence properties of cryptographic protocols (2016)
  4. Aguirre, Luis; Martí-Oliet, Narciso; Palomino, Miguel; Pita, Isabel: Sentence-normalized conditional narrowing modulo in rewriting logic and Maude (2015)
  5. Clavel, Manuel; Durán, Francisco; Eker, Steven; Escobar, Santiago; Lincoln, Patrick; Martí-Oliet, Narciso; Talcott, Carolyn: Two decades of Maude (2015)
  6. Escobar, Santiago; Meadows, Catherine; Meseguer, José; Santiago, Sonia: Symbolic protocol analysis with disequality constraints modulo equational theories (2015)
  7. Klein, Dominik: Key-secrecy of PACE with OTS/CafeOBJ (2015) ioport
  8. Martí-Oliet, Narciso; Ölveczky, Peter Csaba; Talcott, Carolyn: José Meseguer: scientist and friend extraordinaire (2015)
  9. Escobar, Santiago; Meadows, Catherine; Meseguer, José; Santiago, Sonia: State space reduction in the Maude-NRL protocol analyzer (2014)
  10. Liu, Zhiqiang; Lynch, Christopher: Efficient general AGH-unification (2014)
  11. Hendrix, Joe; Meseguer, José: Order-sorted equational unification revisited (2012)
  12. Meseguer, José: Twenty years of rewriting logic (2012)
  13. Escobar, Santiago; Meadows, Catherine; Meseguer, José: State space reduction in the maude-NRL protocol analyzer (2011) ioport
  14. Liu, Zhiqiang; Lynch, Christopher: Efficient general unification for XOR with homomorphism (2011)
  15. Boichut, Yohan; Héam, Pierre-Cyrille; Kouchnarenko, Olga: Tree automata for detecting attacks on protocols with algebraic cryptographic primitives (2009)
  16. Escobar, Santiago; Meadows, Catherine; Meseguer, José: Maude-NPA: cryptographic protocol analysis modulo equational properties (2009)
  17. Escobar, Santiago; Meseguer, José; Sasse, Ralf: Variant narrowing and equational unification (2009)
  18. Santiago, S.; Talcott, C.; Escobar, S.; Meadows, C.; Meseguer, J.: A graphical user interface for maude-NPA (2009) ioport
  19. Escobar, Santiago; Meadows, Catherine; Meseguer, José: State space reduction in the Maude-NRL protocol analyzer (2008) ioport