Relative Perfect Secrecy: Universally Optimal Strategies and Channel Design

M.H.R. Khouzani, Pasquale Malacaria
2016 2016 IEEE 29th Computer Security Foundations Symposium (CSF)  
16 Formally, for all M : θ 1 ∈ M , take α 1 (θ 1 ; M ) = 1 and α 1 (θ; M ) = 0 ∀θ = θ 1 , and for all M : θ 1 / ∈ M , take α 1 (θ; M ) = 1/|M | ∀θ ∈ M and α 1 (θ; M ) = 0 ∀θ / ∈ M . 17 Formally: α(θ; M ) = 1/|M | ∀θ ∈ M and α(θ; M ) = 0 ∀θ / ∈ M , for all M ∈ M.
doi:10.1109/csf.2016.12 dblp:conf/csfw/KhouzaniM16 fatcat:7hqzgsengvepbblpbuxinvh3am