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
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/485,
      author = {Neal Koblitz},
      title = {Another Look at Automated Theorem-Proving. II},
      howpublished = {Cryptology ePrint Archive, Paper 2011/485},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/485}},
      url = {https://eprint.iacr.org/2011/485}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.