1 paper
N. Bordenabe, A. McIver, C Morgan +1
In quantitative information flow we say that program Q is "at least as secure as" P just when the amount of secret information flowing from Q is never more than flows from $P…