src/HOL/Auth/TLS.thy
2003-07-24 paulson 2003-07-24 Tidying and replacement of some axioms by specifications
2003-05-05 paulson 2003-05-05 improved presentation of HOL/Auth theories
2003-04-25 paulson 2003-04-25 Changes required by the certified email protocol Public-key model now provides separate signature/encryption keys and also long-term symmetric keys.
2002-08-17 paulson 2002-08-17 tidying of Isar scripts
2001-10-03 wenzelm 2001-10-03 tuned parentheses in relational expressions;
2001-05-08 paulson 2001-05-08 conversion of Auth/TLS to Isar script
2001-03-29 paulson 2001-03-29 misc tidying; changing the predicate isSymKey to the set symKeys
2001-02-27 paulson 2001-02-27 Some X-symbols for <notin>, <noteq>, <forall>, <exists> Streamlining of Yahalom proofs Removal of redundant proofs
1999-02-16 paulson 1999-02-16 tidying in conjuntion with the TISSEC paper; replaced (unit option) by a new datatype (role)
1998-10-16 paulson 1998-10-16 changed tags from 0, 1 to None, Some() to avoid special treatment of 0
1998-09-08 paulson 1998-09-08 Got rid of not_Says_to_self and most uses of ~= in definitions and theorems
1998-08-21 paulson 1998-08-21 Tidying
1998-06-24 paulson 1998-06-24 Trivial change to be more like paper
1997-12-16 paulson 1997-12-16 Simplified SpyKeys and ClientKeyExch as suggested by James Margetson
1997-11-11 paulson 1997-11-11 Fixed spelling error
1997-10-01 paulson 1997-10-01 Fixed ServerResume to check for ServerHello instead of making a new NB
1997-10-01 paulson 1997-10-01 Exchanged the M and SID fields of the FINISHED messages to simplify proofs
1997-09-30 paulson 1997-09-30 Client, Server certificates now sent using the separate Certificate rule, simplifying ServerHello and ClientKeyExch. Resumption no longer needs its own version of ServerHello. Proofs run nearly three minutes faster.
1997-09-29 paulson 1997-09-29 Renamed XA, XB to PA, PB and removed the certificate from Client Verify
1997-09-25 paulson 1997-09-25 Deleted obsolete axioms inj_serverK and isSym_serverK
1997-09-24 paulson 1997-09-24 sessionK now indexed by nat instead of bool. Weaker Oops conditions on final guarantees
1997-09-22 paulson 1997-09-22 Simplified SpyKeys to use sessionK instead of clientK and serverK Proved and used analz_insert_key, shortening scripts
1997-09-19 paulson 1997-09-19 First working version with Oops event for session keys
1997-09-19 paulson 1997-09-19 Full version of TLS including session resumption, but no Oops
1997-09-18 paulson 1997-09-18 Global change: lost->bad and sees Spy->spies First change just gives a more sensible name. Second change eliminates the agent parameter of "sees" to simplify definitions and theorems
1997-09-17 paulson 1997-09-17 Now with the sessionK constant and new events ClientAccepts and ServerAccepts
1997-09-16 paulson 1997-09-16 Addition of SessionIDs to the Hello and Finished messages
1997-09-16 paulson 1997-09-16 TLS now with a distinction between premaster secret and master secret
1997-07-14 paulson 1997-07-14 Changing "lost" from a parameter of protocol definitions to a constant. Advantages: no "lost" argument everywhere; fewer Vars in subgoals; less need for specially instantiated rules Disadvantage: can no longer prove "Agent_not_see_encrypted_key", but this theorem was never used, and its original proof was also broken the introduction of the "Notes" constructor.
1997-07-11 paulson 1997-07-11 Now uses the Notes constructor to distinguish the Client (who has chosen M) from the Spy (who may have replayed her messages)
1997-07-07 paulson 1997-07-07 New proofs involving CERTIFICATE VERIFY
1997-07-04 paulson 1997-07-04 New constant "certificate"--just an abbreviation
1997-07-01 paulson 1997-07-01 More realistic model: the Spy can compute clientK and serverK
1997-07-01 paulson 1997-07-01 Baby TLS. Proofs work, but model seems unrealistic