You are looking at a specific version 20110910:014736 of this paper.
See the latest version.
Paper 2011/485
Another Look at Automated Theorem-Proving. II
Neal Koblitz
Abstract
I continue the discussion initiated in part I of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments. I examine some recent papers that describe automated security proofs for hashed ElGamal encryption, Boneh-Franklin identity-based encryption, and OAEP.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. not submitted yet
- Keywords
- public-key cryptographyautomated proofsproof checkingencryption
- Contact author(s)
- koblitz @ uw edu
- History
- 2011-09-10: received
- Short URL
- https://ia.cr/2011/485
- License
-
CC BY
