The Enc algorithm of one-time pad is deterministic, but our denitions of encryption allow Enc to be randomized (i.e., it may give dierent outputs when called twice with the same k and m). For full credit, you should prove the statement even for the case of Enc is randomized. However, you may assume that Dec is deterministic