Another look at automated theorem-proving

Another look at automated theorem-proving

I examine the use of automated theorem-proving for reductionist security arguments in cryptography and discuss three papers that purport to show the potential of computer-assisted proof-writing and proof-checking. I look at the proofs that the authors give to illustrate the “game-hopping” technique...

Full description

Bibliographic Details
Main Author: Koblitz Neal
Format: Article
Language:English
Published: De Gruyter 2007-12-01
Series:Journal of Mathematical Cryptology
Subjects:
automated theorem-proving
proof-checking
public key cryptography
signatures
encryption
Online Access:https://doi.org/10.1515/jmc.2007.020

Internet

https://doi.org/10.1515/jmc.2007.020

Similar Items