Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*

被引：15

作者：

Martín Abadi

Phillip Rogaway

机构：

[1] Computer Science Department,

[2] University of California at Santa Cruz,undefined

[3] Santa Cruz,undefined

[4] CA 95064,undefined

[5] U.S.A. abadi@cs.ucsc.edu www.soe.ucsc.edu/~abadi/,undefined

[6] Department of Computer Science,undefined

[7] University of California at Davis,undefined

[8] Davis,undefined

[9] CA 95616,undefined

[10] U.S.A. rogaway@cs.ucdavis.edu www.cs.ucdavis.edu/~rogaway,undefined

来源：

Journal of Cryptology | 2002年 / 15卷

关键词：

Key words. Cryptography, Encryption, Formal reasoning, Provable security, Soundness.;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Two distinct, rigorous views of cryptography have developed over the years, in two mostly separate communities. One of the views relies on a simple but effective formal approach; the other, on a detailed computational model that considers issues of complexity and probability. There is an uncomfortable and interesting gap between these two approaches to cryptography. This paper starts to bridge the gap, by providing a computational justification for a formal treatment of encryption.

引用

页码：103 / 127

页数：24