proposition: Theorem unconditional_secrecy LA A: ValidPackage LA [interface #val #[shares]: ('word × 'word) × 'set 'nat → 'seq 'word ] A_export A -> Advantage SHARE A = 0%R.
proof: Proof. move=> vA. rewrite Advantage_E Advantage_sym. by rewrite SHARE_equiv ?fdisjoints0. 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)