Another look at automated theorem-proving II

被引：4

作者：

Koblitz, Neal ^{[1
]}

机构：

[1] Univ Washington, Dept Math, Box 354350, Seattle, WA 98195 USA

来源：

JOURNAL OF MATHEMATICAL CRYPTOLOGY | 2011年 / 5卷 / 3-4期

关键词：

Automated theorem-proving; computer-assisted proof; proof checking; public key cryptography; encryption;

D O I：

10.1515/jmc-2011-0014

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页码：205 / 224

页数：20

共 33 条

[11]

Boldyreva A, 2007, CCS'07: PROCEEDINGS OF THE 14TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P276

[12] Identity-based encryption from the Weil pairing [J].

Boneh, D ;

Franklin, M .

SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615

[13]

Chatterjee S., 2012, LNCS, V7118, P293

[14]

Cramer R, 1998, LECT NOTES COMPUT SC, V1462, P13, DOI 10.1007/BFb0055717

[15] RSA-OAEP is secure under the RSA assumption [J].

Fujisaki, E ;

Okamoto, T ;

Pointcheval, D ;

Stern, J .

JOURNAL OF CRYPTOLOGY, 2004, 17 (02) :81-104

[16]

Fujisaki E, 1999, LECT NOTES COMPUT SC, V1560, P53

[17]

Galindo D, 2005, LECT NOTES COMPUT SC, V3580, P791

[18]

Halevi S., 2007, J MATH CRYPTOL, V1, P385

[19]

Halevi S., PLAUSIBLE APPROACH C

[20]

Hwang J.Y., 2009, ASIACCS 09, P157

← 1 2 3 4 →