(*************************************************************
 *                                                           *
 *  Cryptographic protocol verifier                          *
 *                                                           *
 *  Bruno Blanchet, Vincent Cheval, and Marc Sylvestre       *
 *                                                           *
 *  Copyright (C) INRIA, CNRS 2000-2020                      *
 *                                                           *
 *************************************************************)

(*

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details (in file LICENSE).

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

*)
(* Needham Shroeder shared key protocol *)

param verboseRules = yes.

pred c/1 elimVar, decompData.

fun encrypt/2.
fun decr/1.

query c:secretA[].

(* The analyzer finds automatically:
nounif c:x.
nounif c:encrypt(x,k[]).

These nounif are necessary:
c:encrypt(n,k[]) -> c:encrypt(decr(n),k[])
c:encrypt(v3,k[]) -> c:decr(v3)
=> loop
*)

reduc

c:k & c:encrypt(m,k) -> c:m;
c:encrypt(n, k[]) -> c:encrypt(decr(n), k[]);
c:encrypt(k[], Ks2).

