可证明安全是现代密码方案的基本要求。该领域的研究工作起源于C.E.Shannon的完善保密性理论，但该理论依赖于无限的计算能力，使其缺乏实际指导意义。近年来，通过引入计算复杂性、概率算法和随机预言模型（random oracle paradigm），使得可证明安全的研究逐步面向实用，目前已经成为密码方案和协议的理论基础和设计依据。 本课程是密码学与计算机安全学科的博士生专业课，主要介绍现代密码科学的核心理论问题和研究结果，其中包括可证明安全的理论、工具和分析方法以及国内外相关研究的进展情况。要求学生深入理解和掌握：概率算法、单向函数、比特安全性、伪随机性、可证明安全加密、可证明安全数字签名等内容。通过本课程的学习，要求能够从本质上分析和证明现代密码的信息防护能力。

Provable Security is the essential requirement of modern cryptographic schemes. The corresponding research is originated from the C.E. Shannon’s Perfect Security Theory, which was lacking of practical value because of building on infinite computing capacity. In recent years, the appearance of computational complexity, probabilistic algorithm and random oracle paradigm gave the chance to shift from pure research to practical usage in Provable Security field, and it became the foundation of theory and implementation of cryptographic shemes and protocols. This lecture falls into the PHD courses of cryptography and computer security. It gives introductions to core theoretical questions and the conclusions of modern cryptography research. It includes the theory, tool and analytical method of provable security and the latest domestic and aboard progress. The requirement for student is to understand and grasp the contents of probabilistic algorithm, one way function, bits commitment, pseudo-randomness, provably secure encryption, provably secure digital signature, etc. Students should be able to analyse and prove the information protection capacity of modern cryptography basically after this course.