Common use of Secret Keys from Dirty Paper Coding Clause in Contracts

Secret Keys from Dirty Paper Coding. We study the Gaussian case under an average power constraint. The channel to the legitimate receiver and the eavesdropper is expressed as: where the maximization is over all auxilary random variables u that obey the Markov chain u (x, s) (yr, ye). Additionally it suffices to limit the cardinality of the auxiliary variable to (1 + ) in (18). → → |S| |X | The achievability in (18) follows from (7) by augmenting yr = x + s + zr

Secret Keys from Dirty Paper Coding. ‌ We study the Gaussian case under an average power constraint. The channel to the legitimate receiver and the eavesdropper is expressed as: where the maximization is over all auxilary random variables u that obey the Markov chain u (x, s) (yr, ye). Additionally it suffices to limit the cardinality of the auxiliary variable to (1 + ) in (18). → → |S| |X | The achievability in (18) follows from (7) by augmenting yr = x + s + zr