Abstract: A symmetric-key cryptographic scheme is deemed to be provably secure if one can formally argue that it is secure given the hardness of some underlying computational problem. This thesis is a study of the provable ...