Managing Editor: Magliveras, Spyros S. / Steinwandt, Rainer / Trung, Tran
null Blackburn, Simon R. / Brickell, Ernie / Burmester, Mike / Cramer, Ronald / Dawson, Ed / Gilman, Robert / Gonzalez Vasco, Maria Isabel / Grosek, Otokar / Imai, Hideki / Kim, Kwangjo / Koblitz, Neal / Kurosawa, Kaoru / Menezes, Alfred / Mullin, Ron / Nguyen, Phong Q. / Pieprzyk, Josef / Safavi-Naini, Rei / Shparlinski, Igor / Stinson, Doug / Williams, Hugh C. / Yung, Moti
4 Issues per year
Mathematical Citation Quotient 2010: 0.31
1Department of Mathematics, University of Washington, Box 354350, Seattle, WA 98195, USA
Citation Information: Journal of Mathematical Cryptology. Volume 5, Issue 3-4, Pages 205–224, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: 10.1515/jmc-2011-0014, January 2012
Publication History:
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.
Keywords.: Automated theorem-proving; computer-assisted proof; proof checking; public key cryptography; encryption
Comments (0)