In addition to the above results, we also revist the Broadbent and Lord's construction of one-time uncloneable encryption from monogamy of entanglement games [1]}. Their scheme shows that the success probability of any adversary cannot be better than \(0.85^n\) , where \(n\)  is the message length. Firstly, it is natural to ask if this bound is an artifact of the proof and whether it is possible to come up with a better proof that gets the ideal bound of
\(0.5^n\) . We argue that the bound is not artifact of the proof by demonstrating the existence of an adversary that can violate their scheme with probability \(0.7^n\) . Moreover, we also generalize their construction by showing a transformation from a broader class of monogamy games to uncloneable encryption; whereas, [2]} only showed the transformation for the BB84 monogamy game.
