Fundamental problems in provable security and cryptography
Alexander W. Dent · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · 2006
This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research and dozens of significant results, there are fundamental problems which have yet to be solved. We also present a new approach to one of the more controversial aspects of provable security, the random oracle model.