Welcome to the resource topic for 2011/485
Title:
Another Look at Automated Theorem-Proving. II
Authors: 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.
ePrint: https://eprint.iacr.org/2011/485
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .