-
Notifications
You must be signed in to change notification settings - Fork 16
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Formalization for SMC protocols #136
base: master
Are you sure you want to change the base?
Formalization for SMC protocols #136
Conversation
* port to MC2 (affeldt-aist#116) --------- Co-authored-by: Reynald Affeldt <[email protected]> Co-authored-by: Takafumi Saikawa <[email protected]> * changelog * fix * lemma 3.1 * cleaning * Lemma 3.2 * Lemma 3.3 in a new file probability/smc.v * WIP: try to prove Lemma 3.4 * WIP: lemma 3.4 * WIP: try prob + uniform dist * pXY_unif * comments * mc2 --------- Co-authored-by: Enrico Tassi <[email protected]> Co-authored-by: Reynald Affeldt <[email protected]> Co-authored-by: Greg Weng <[email protected]> Co-authored-by: weng-chenghui <[email protected]>
Based on the relation between restricted distribution and conditional probability, re-use lemma 3.4 as much as possible.
* clean up lemma_3_5 * prove Z_X_indep * remove more dead code
…+ mixed types RV2
…e about RV2_inde_reduce
For these two lemmas, I think the graphoid axioms suffice. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Actually, no graphoid axiom needed here.
Lemma RV2_indeC : | ||
P |= [% X, X] _|_ [% Y, Z] -> | ||
P |= [% X, Y] _|_ [% X, Z]. | ||
Proof. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Certainly not provable: assuming P |= X _|_ Y
we can derive P |= [%X, X] _|_ [% Y, Y]
, but P |= [% X, Y] _|_ [% X, Y]
definitely looks impossible.
smc/smc_proba.v
Outdated
|
||
Lemma RV2_inde_reduce : | ||
P |= X _|_ Y -> | ||
P |= [% X, X] _|_ Y. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Just use index_rv_comp
with f = fun x => (x, x)
and g' = idfun
.
This is the pull-request contains all formalization work in: "Toward a Formalization of Secure-Multiparty Computation Stack".