A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf
.
Fundamental problems in provable security and cryptography
2006
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
This paper examines methods for formally proving the security of cryptographic schemes. We show that, despite many years of active research, 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.
doi:10.1098/rsta.2006.1895
pmid:17090456
fatcat:kbia7avak5dvpl5tgh7h66eosu