src/HOL/Auth/Yahalom.ML
author paulson
Fri, 13 Sep 1996 13:16:57 +0200
changeset 1995 c80e58e78d9c
parent 1985 84cf16192e03
child 2001 974167c1d2c4
permissions -rw-r--r--
Addition of Yahalom protocol
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
     1
(*  Title:      HOL/Auth/Yahalom
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     2
    ID:         $Id$
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     3
    Author:     Lawrence C Paulson, Cambridge University Computer Laboratory
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     4
    Copyright   1996  University of Cambridge
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     5
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     6
Inductive relation "otway" for the Yahalom protocol.
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     7
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     8
From page 257 of
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
     9
  Burrows, Abadi and Needham.  A Logic of Authentication.
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    10
  Proc. Royal Soc. 426 (1989)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    11
*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    12
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    13
open Yahalom;
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    14
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    15
proof_timing:=true;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    16
HOL_quantifiers := false;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    17
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    18
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    19
(** Weak liveness: there are traces that reach the end **)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    20
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    21
goal thy 
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    22
 "!!A B. [| A ~= B; A ~= Server; B ~= Server |]   \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    23
\        ==> EX X NB K. EX evs: yahalom.          \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    24
\               Says A B {|X, Crypt (Nonce NB) K|} : set_of_list evs";
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    25
by (REPEAT (resolve_tac [exI,bexI] 1));
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    26
br (yahalom.Nil RS yahalom.YM1 RS yahalom.YM2 RS yahalom.YM3 RS yahalom.YM4) 2;
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    27
by (ALLGOALS (simp_tac (!simpset setsolver safe_solver)));
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    28
by (ALLGOALS Fast_tac);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    29
qed "weak_liveness";
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    30
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    31
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    32
(**** Inductive proofs about yahalom ****)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    33
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    34
(*The Enemy can see more than anybody else, except for their initial state*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    35
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    36
 "!!evs. evs : yahalom ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    37
\     sees A evs <= initState A Un sees Enemy evs";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    38
be yahalom.induct 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    39
by (ALLGOALS (fast_tac (!claset addDs [sees_Says_subset_insert RS subsetD] 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    40
			        addss (!simpset))));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    41
qed "sees_agent_subset_sees_Enemy";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    42
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    43
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    44
(*Nobody sends themselves messages*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    45
goal thy "!!evs. evs : yahalom ==> ALL A X. Says A A X ~: set_of_list evs";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    46
be yahalom.induct 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    47
by (Auto_tac());
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    48
qed_spec_mp "not_Says_to_self";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    49
Addsimps [not_Says_to_self];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    50
AddSEs   [not_Says_to_self RSN (2, rev_notE)];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    51
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    52
goal thy "!!evs. evs : yahalom ==> Notes A X ~: set_of_list evs";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    53
be yahalom.induct 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    54
by (Auto_tac());
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    55
qed "not_Notes";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    56
Addsimps [not_Notes];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    57
AddSEs   [not_Notes RSN (2, rev_notE)];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    58
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    59
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    60
(** For reasoning about the encrypted portion of messages **)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    61
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    62
(*Lets us treat YM4 using a similar argument as for the Fake case.*)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    63
goal thy "!!evs. Says S A {|Crypt Y (shrK A), X|} : set_of_list evs ==> \
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    64
\                X : analz (sees Enemy evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    65
by (fast_tac (!claset addSDs [Says_imp_sees_Enemy RS analz.Inj]) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    66
qed "YM4_analz_sees_Enemy";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    67
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    68
goal thy "!!evs. Says S A {|Crypt {|B, K, NA, NB|} (shrK A), X|} \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    69
\                  : set_of_list evs ==> \
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    70
\                K : parts (sees Enemy evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    71
by (fast_tac (!claset addSEs partsEs
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    72
	              addSDs [Says_imp_sees_Enemy RS parts.Inj]) 1);
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    73
qed "YM4_parts_sees_Enemy";
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    74
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    75
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    76
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    77
(*** Shared keys are not betrayed ***)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    78
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    79
(*Enemy never sees another agent's shared key! (unless it is leaked at start)*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    80
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    81
 "!!evs. [| evs : yahalom;  A ~: bad |] ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    82
\        Key (shrK A) ~: parts (sees Enemy evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    83
be yahalom.induct 1;
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    84
bd (YM4_analz_sees_Enemy RS synth.Inj) 6;
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    85
by (ALLGOALS Asm_simp_tac);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    86
by (stac insert_commute 3);
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    87
by (Auto_tac());
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    88
(*Fake and YM4 are similar*)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    89
by (ALLGOALS (best_tac (!claset addSDs [impOfSubs analz_subset_parts,
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
    90
					impOfSubs Fake_parts_insert])));
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    91
qed "Enemy_not_see_shrK";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    92
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    93
bind_thm ("Enemy_not_analz_shrK",
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    94
	  [analz_subset_parts, Enemy_not_see_shrK] MRS contra_subsetD);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    95
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    96
Addsimps [Enemy_not_see_shrK, Enemy_not_analz_shrK];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    97
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    98
(*We go to some trouble to preserve R in the 3rd and 4th subgoals
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
    99
  As usual fast_tac cannot be used because it uses the equalities too soon*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   100
val major::prems = 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   101
goal thy  "[| Key (shrK A) : parts (sees Enemy evs);       \
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   102
\             evs : yahalom;                               \
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   103
\             A:bad ==> R                                  \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   104
\           |] ==> R";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   105
br ccontr 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   106
br ([major, Enemy_not_see_shrK] MRS rev_notE) 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   107
by (swap_res_tac prems 2);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   108
by (ALLGOALS (fast_tac (!claset addIs prems)));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   109
qed "Enemy_see_shrK_E";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   110
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   111
bind_thm ("Enemy_analz_shrK_E", 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   112
	  analz_subset_parts RS subsetD RS Enemy_see_shrK_E);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   113
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   114
AddSEs [Enemy_see_shrK_E, Enemy_analz_shrK_E];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   115
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   116
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   117
(*** Future keys can't be seen or used! ***)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   118
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   119
(*Nobody can have SEEN keys that will be generated in the future.
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   120
  This has to be proved anew for each protocol description,
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   121
  but should go by similar reasoning every time.  Hardest case is the
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   122
  standard Fake rule.  
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   123
      The length comparison, and Union over C, are essential for the 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   124
  induction! *)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   125
goal thy "!!evs. evs : yahalom ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   126
\                length evs <= length evs' --> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   127
\                          Key (newK evs') ~: (UN C. parts (sees C evs))";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   128
be yahalom.induct 1;
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   129
bd (YM4_analz_sees_Enemy RS synth.Inj) 6;
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   130
by (REPEAT_FIRST (best_tac (!claset addDs [impOfSubs analz_subset_parts,
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   131
					   impOfSubs parts_insert_subset_Un,
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   132
					   Suc_leD]
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   133
			            addss (!simpset))));
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   134
val lemma = result();
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   135
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   136
(*Variant needed for the main theorem below*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   137
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   138
 "!!evs. [| evs : yahalom;  length evs <= length evs' |] ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   139
\        Key (newK evs') ~: parts (sees C evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   140
by (fast_tac (!claset addDs [lemma]) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   141
qed "new_keys_not_seen";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   142
Addsimps [new_keys_not_seen];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   143
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   144
(*Another variant: old messages must contain old keys!*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   145
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   146
 "!!evs. [| Says A B X : set_of_list evs;  \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   147
\           Key (newK evt) : parts {X};    \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   148
\           evs : yahalom                 \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   149
\        |] ==> length evt < length evs";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   150
br ccontr 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   151
by (fast_tac (!claset addSDs [new_keys_not_seen, Says_imp_sees_Enemy]
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   152
	              addIs [impOfSubs parts_mono, leI]) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   153
qed "Says_imp_old_keys";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   154
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   155
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   156
(*Nobody can have USED keys that will be generated in the future.
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   157
  ...very like new_keys_not_seen*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   158
goal thy "!!evs. evs : yahalom ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   159
\                length evs <= length evs' --> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   160
\                newK evs' ~: keysFor (UN C. parts (sees C evs))";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   161
be yahalom.induct 1;
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   162
by (forward_tac [YM4_parts_sees_Enemy] 6);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   163
bd (YM4_analz_sees_Enemy RS synth.Inj) 6;
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   164
by (ALLGOALS Asm_full_simp_tac);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   165
(*YM1, YM2 and YM3*)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   166
by (EVERY (map (fast_tac (!claset addDs [Suc_leD] addss (!simpset))) [4,3,2]));
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   167
(*Fake and YM4: these messages send unknown (X) components*)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   168
by (stac insert_commute 2);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   169
by (Simp_tac 2);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   170
(*YM4: the only way K could have been used is if it had been seen,
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   171
  contradicting new_keys_not_seen*)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   172
by (ALLGOALS
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   173
     (best_tac
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   174
      (!claset addDs [impOfSubs (analz_subset_parts RS keysFor_mono),
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   175
		      impOfSubs (parts_insert_subset_Un RS keysFor_mono),
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   176
		      Suc_leD]
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   177
	       addDs [impOfSubs analz_subset_parts]
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   178
	       addEs [new_keys_not_seen RSN(2,rev_notE)]
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   179
	       addss (!simpset))));
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   180
val lemma = result();
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   181
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   182
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   183
 "!!evs. [| evs : yahalom;  length evs <= length evs' |] ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   184
\        newK evs' ~: keysFor (parts (sees C evs))";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   185
by (fast_tac (!claset addSDs [lemma] addss (!simpset)) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   186
qed "new_keys_not_used";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   187
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   188
bind_thm ("new_keys_not_analzd",
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   189
	  [analz_subset_parts RS keysFor_mono,
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   190
	   new_keys_not_used] MRS contra_subsetD);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   191
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   192
Addsimps [new_keys_not_used, new_keys_not_analzd];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   193
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   194
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   195
(** Lemmas concerning the form of items passed in messages **)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   196
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   197
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   198
(****
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   199
 The following is to prove theorems of the form
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   200
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   201
          Key K : analz (insert (Key (newK evt)) (sees Enemy evs)) ==>
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   202
          Key K : analz (sees Enemy evs)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   203
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   204
 A more general formula must be proved inductively.
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   205
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   206
****)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   207
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   208
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   209
(*NOT useful in this form, but it says that session keys are not used
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   210
  to encrypt messages containing other keys, in the actual protocol.
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   211
  We require that agents should behave like this subsequently also.*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   212
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   213
 "!!evs. evs : yahalom ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   214
\        (Crypt X (newK evt)) : parts (sees Enemy evs) & \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   215
\        Key K : parts {X} --> Key K : parts (sees Enemy evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   216
be yahalom.induct 1;
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   217
bd (YM4_analz_sees_Enemy RS synth.Inj) 6;
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   218
by (ALLGOALS (asm_simp_tac (!simpset addsimps pushes)));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   219
(*Deals with Faked messages*)
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   220
by (EVERY 
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   221
    (map (best_tac (!claset addSEs partsEs
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   222
			    addDs [impOfSubs analz_subset_parts,
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   223
				   impOfSubs parts_insert_subset_Un]
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   224
			    addss (!simpset)))
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   225
     [3,2]));
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   226
(*Base case*)
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   227
by (Auto_tac());
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   228
result();
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   229
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   230
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   231
(** Specialized rewriting for this proof **)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   232
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   233
Delsimps [image_insert];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   234
Addsimps [image_insert RS sym];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   235
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   236
Delsimps [image_Un];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   237
Addsimps [image_Un RS sym];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   238
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   239
goal thy "insert (Key (newK x)) (sees A evs) = \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   240
\         Key `` (newK``{x}) Un (sees A evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   241
by (Fast_tac 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   242
val insert_Key_singleton = result();
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   243
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   244
goal thy "insert (Key (f x)) (Key``(f``E) Un C) = \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   245
\         Key `` (f `` (insert x E)) Un C";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   246
by (Fast_tac 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   247
val insert_Key_image = result();
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   248
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   249
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   250
(*This lets us avoid analyzing the new message -- unless we have to!*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   251
(*NEEDED??*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   252
goal thy "synth (analz (sees Enemy evs)) <=   \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   253
\         synth (analz (sees Enemy (Says A B X # evs)))";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   254
by (Simp_tac 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   255
br (subset_insertI RS analz_mono RS synth_mono) 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   256
qed "synth_analz_thin";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   257
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   258
AddIs [impOfSubs synth_analz_thin];
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   259
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   260
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   261
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   262
(** Session keys are not used to encrypt other session keys **)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   263
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   264
(*Lemma for the trivial direction of the if-and-only-if*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   265
goal thy  
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   266
 "!!evs. (Key K : analz (Key``nE Un sEe)) --> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   267
\         (K : nE | Key K : analz sEe)  ==>     \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   268
\        (Key K : analz (Key``nE Un sEe)) = (K : nE | Key K : analz sEe)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   269
by (fast_tac (!claset addSEs [impOfSubs analz_mono]) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   270
val lemma = result();
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   271
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   272
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   273
goal thy  
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   274
 "!!evs. evs : yahalom ==> \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   275
\  ALL K E. (Key K : analz (Key``(newK``E) Un (sees Enemy evs))) = \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   276
\           (K : newK``E | Key K : analz (sees Enemy evs))";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   277
be yahalom.induct 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   278
bd YM4_analz_sees_Enemy 6;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   279
by (REPEAT_FIRST (resolve_tac [allI, lemma]));
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   280
by (ALLGOALS 
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   281
    (asm_simp_tac 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   282
     (!simpset addsimps ([insert_Key_singleton, insert_Key_image, pushKey_newK]
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   283
			 @ pushes)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   284
               setloop split_tac [expand_if])));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   285
(*YM4*) 
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   286
by (enemy_analz_tac 4);
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   287
(*YM3*)
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   288
by (Fast_tac 3);
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   289
(*Fake case*)
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   290
by (enemy_analz_tac 2);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   291
(*Base case*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   292
by (fast_tac (!claset addIs [image_eqI] addss (!simpset)) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   293
qed_spec_mp "analz_image_newK";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   294
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   295
goal thy
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   296
 "!!evs. evs : yahalom ==>                               \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   297
\        Key K : analz (insert (Key (newK evt)) (sees Enemy evs)) = \
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   298
\        (K = newK evt | Key K : analz (sees Enemy evs))";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   299
by (asm_simp_tac (HOL_ss addsimps [pushKey_newK, analz_image_newK, 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   300
				   insert_Key_singleton]) 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   301
by (Fast_tac 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   302
qed "analz_insert_Key_newK";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   303
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   304
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   305
(*Describes the form *and age* of K when the following message is sent*)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   306
goal thy 
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   307
 "!!evs. [| Says Server A                                           \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   308
\            {|Crypt {|Agent B, K, NA, NB|} (shrK A),               \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   309
\              Crypt {|Agent A, K|} (shrK B)|} : set_of_list evs;   \
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   310
\           evs : yahalom |]                                        \
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   311
\        ==> (EX evt:yahalom. K = Key(newK evt) &                   \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   312
\                           length evt < length evs)";
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   313
be rev_mp 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   314
be yahalom.induct 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   315
by (ALLGOALS (fast_tac (!claset addIs [less_SucI] addss (!simpset))));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   316
qed "Says_Server_message_form";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   317
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   318
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   319
(*Crucial secrecy property: Enemy does not see the keys sent in msg YM3
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   320
  As with Otway-Rees, proof does not need uniqueness of session keys.*)
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   321
goal thy 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   322
 "!!evs. [| Says Server A \
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   323
\            {|Crypt {|Agent B, K, NA, NB|} (shrK A),                   \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   324
\              Crypt {|Agent A, K|} (shrK B)|} : set_of_list evs;       \
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   325
\           A ~: bad;  B ~: bad;  evs : yahalom |] ==>                  \
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   326
\     K ~: analz (sees Enemy evs)";
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   327
be rev_mp 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   328
be yahalom.induct 1;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   329
bd YM4_analz_sees_Enemy 6;
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   330
by (ALLGOALS Asm_simp_tac);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   331
(*Next 3 steps infer that K has the form "Key (newK evs'" ... *)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   332
by (REPEAT_FIRST (resolve_tac [conjI, impI]));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   333
by (TRYALL (forward_tac [Says_Server_message_form] THEN' assume_tac));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   334
by (REPEAT_FIRST (eresolve_tac [bexE, exE, conjE] ORELSE' hyp_subst_tac));
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   335
by (ALLGOALS
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   336
    (asm_full_simp_tac 
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   337
     (!simpset addsimps ([analz_subset_parts RS contra_subsetD,
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   338
			  analz_insert_Key_newK] @ pushes)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   339
               setloop split_tac [expand_if])));
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   340
(*YM4*)
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   341
by (enemy_analz_tac 3);
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   342
(*YM3*)
1995
c80e58e78d9c Addition of Yahalom protocol
paulson
parents: 1985
diff changeset
   343
by (fast_tac (!claset addSEs [less_irrefl]) 2);
1985
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   344
(*Fake*) (** LEVEL 10 **)
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   345
by (enemy_analz_tac 1);
84cf16192e03 Tidied many proofs, using AddIffs to let equivalences take
paulson
parents:
diff changeset
   346
qed "Enemy_not_see_encrypted_key";