proposition: Lemma sec_share_bij (U: seq Party) (m m': Word) (c: PolyEnc t'): uniq U -> (size U <= t')%N -> make_shares m' (nat_to_poly t' (share_bij U m m' c)) U = make_shares m (nat_to_poly t' c ) U.
proof: Proof. move=> Huniq Hltn. rewrite /share_bij /= poly_nat_poly ?size_poly_bij ?size_nat_to_poly //. by apply: sec_poly_bij. Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude) extructures(ord fset fmap) Equations(Equations)