Nuprl Lemma : nonce-release-lemma
∀[ses:SES]
∀[bss:Basic1 List]
∀[A:Id]
(∀[es:EO+(Info)]. ∀[thr:Thread].
(∀[i:ℕ||thr||]. ∀[j:ℕi].
(¬(New(thr[j]) released before thr[i])) supposing
((∀k:{j + 1..i-}. (¬↑thr[k] ∈b Send)) and
(↑thr[j] ∈b New))) supposing
(loc(thr)= A and
(thr is one of bss at A))) supposing
((Protocol1(bss) A) and
Honest(A))
supposing Legal(bss)
supposing SecurityAxioms
Proof
Definitions occuring in Statement :
ses-protocol1-legal: Legal(bss),
ses-protocol1: Protocol1(bss),
ses-protocol1-thread: (thr is one of bss at A),
ses-basic-sequence1: Basic1,
ses-thread-loc: loc(thr)= A,
ses-thread: Thread,
ses-axioms: SecurityAxioms,
release-before: (a released before e),
ses-honest: Honest(A),
ses-send: Send,
ses-new: New,
ses-info: Info,
security-event-structure: SES,
eclass-val: X(e),
in-eclass: e ∈b X,
event-ordering+: EO+(Info),
Id: Id,
select: L[n],
length: ||as||,
list: T List,
int_seg: {i..j-},
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
not: ¬A,
apply: f a,
add: n + m,
natural_number: $n
Lemmas :
select_wf,
ses-act_wf,
sq_stable__le,
less_than_transitivity2,
length_wf,
le_weakening2,
lelt_wf,
equal_wf,
es-E_wf,
event-ordering+_subtype,
ses-info_wf,
es-causl-swellfnd,
less_than_transitivity1,
less_than_irreflexivity,
int_seg_wf,
decidable__equal_int,
subtype_rel-int_seg,
false_wf,
le_weakening,
subtract_wf,
int_seg_properties,
le_wf,
nat_wf,
zero-le-nat,
es-causl_wf,
not_wf,
Id_wf,
es-loc_wf,
es-locl_wf,
event-has*_wf,
eclass-val_wf,
event-ordering+_wf,
ses-new_wf,
ses-action_wf,
all_wf,
int_seg_subtype-nat,
ses-thread-member_wf,
assert_wf,
in-eclass_wf,
ses-send_wf,
es-interface-subtype_rel2,
top_wf,
subtype_top,
sdata_wf,
decidable__lt,
not-equal-2,
condition-implies-le,
minus-add,
minus-minus,
minus-one-mul,
add-swap,
add-commutes,
add-associates,
add_functionality_wrt_le,
zero-add,
le-add-cancel-alt,
less-iff-le,
le-add-cancel,
set_wf,
less_than_wf,
primrec-wf2,
decidable__le,
not-le-2,
add-zero,
add-mul-special,
zero-mul,
iff_weakening_equal,
true_wf,
squash_wf,
es-le-not-locl,
btrue_neq_bfalse,
assert_elim,
not_assert_elim,
decidable__ses-action,
sq_stable_from_decidable,
ses-verify_wf,
ses-sign_wf,
ses-decrypt_wf,
encryption-key_wf,
ses-encrypt_wf,
ses-rcv_wf,
or_wf,
es-causle_weakening_locl,
es-causl_transitivity1,
decidable__exists_int_seg,
decidable__es-E-equal,
ses-legal-thread-has*-nonce,
decidable__equal_Id,
es-le_weakening,
es-causl_transitivity2,
es-causl_irreflexivity,
es-causle_weakening,
es-causl_weakening,
es-locl_transitivity2,
iseg_member,
equal_functionality_wrt_subtype_rel2,
iseg_select2,
le-add-cancel2,
ses-thread-order,
es-locl_irreflexivity,
es-locl_transitivity1,
es-le_weakening_eq,
es-le_transitivity,
ses-thread-weak-order,
security-event-structure_wf,
bool_subtype_base,
bool_wf,
subtype_base_sq,
and_wf,
eclass_wf,
assert_functionality_wrt_uiff,
le_antisymmetry_iff,
es-le_wf,
release-before_wf
Latex:
\mforall{}[ses:SES]
\mforall{}[bss:Basic1 List]
\mforall{}[A:Id]
(\mforall{}[es:EO+(Info)]. \mforall{}[thr:Thread].
(\mforall{}[i:\mBbbN{}||thr||]. \mforall{}[j:\mBbbN{}i].
(\mneg{}(New(thr[j]) released before thr[i])) supposing
((\mforall{}k:\{j + 1..i\msupminus{}\}. (\mneg{}\muparrow{}thr[k] \mmember{}\msubb{} Send)) and
(\muparrow{}thr[j] \mmember{}\msubb{} New))) supposing
(loc(thr)= A and
(thr is one of bss at A))) supposing
((Protocol1(bss) A) and
Honest(A))
supposing Legal(bss)
supposing SecurityAxioms
Date html generated:
2015_07_23-PM-00_18_40
Last ObjectModification:
2015_07_16-AM-09_37_16
Home
Index