In this paper the authors analyze provable security proofs, using the EDL signature scheme as its case study, and interpret their benefits and drawbacks when applied to the real world. Provable security has been an area of contention. Some, such as Koblitz and Menezes, give little credit to the potential extra security provided and argue that it is a distracting goal. However, others believe that an algorithm with a security proof is superior to one without it, and are prepared to accept the impact to performance that their use might involve. Goldreich has been notable for the user defence of the security proof, and for their opposition to the view of Koblitz and Menezes.