Another Look at Automated Theorem-Proving. II

Neal Koblitz

Paper 2011/485 Original: eprint.iacr.org/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: Preprint.
History: 2011-09-10: last updated; 2011-09-10: published
Short URL: https://ia.cr/2011/485
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2011/485}
}