Skip to content
BY-NC-ND 3.0 license Open Access Published by De Gruyter January 25, 2012

Another look at automated theorem-proving II

Neal Koblitz


I continue the discussion initiated in part I (published in this journal in 2007) 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.

Received: 2011-10-30
Revised: 2011-12-01
Accepted: 2011-12-05
Published Online: 2012-01-25
Published in Print: 2012-February

© 2012 by Walter de Gruyter Berlin Boston

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Scroll Up Arrow