Another look at automated theorem-proving II

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 encry...

Full description

Bibliographic Details
Main Author: Koblitz Neal
Format: Article
Language:English
Published: De Gruyter 2012-02-01
Series:Journal of Mathematical Cryptology
Subjects:
Online Access:https://doi.org/10.1515/jmc-2011-0014

Similar Items