复杂性理论和密码学的一些方面：五讲讲座
Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial
摘要：
在本教程中，提出了密码学和计算复杂性理论的选定主题。我们将简要介绍经典密码学的历史和基础，然后讨论现代公钥密码学。特别注意的是支付给密码协议和构建这样的协议，如单向函数的关键组件的问题。一个函数是单向的，如果它很容易计算，但很难反演。我们讨论的概念，单向函数在密码学和复杂性理论的设置。我们还考虑了交互式证明系统，并提出了一些有趣的零知识协议。在零知识协议中，一方可以说服另一方知道一些秘密信息，而无需透露任何信息。受这些协议的启发，我们调查了一些复杂性理论的结果交互式证明系统和相关的复杂性类。
英文摘要：
In this tutorial, selected topics of cryptology and of computational complexity theory are presented. We give a brief overview of the history and the foundations of classical cryptography, and then move on to modern public-key cryptography. Particular attention is paid to cryptographic protocols and the problem of constructing the key components of such protocols such as one-way functions. A function is one-way if it is easy to compute, but hard to invert. We discuss the notion of one-way functions both in a cryptographic and in a complexity-theoretic setting. We also consider interactive proof systems and present some interesting zero-knowledge protocols. In a zero-knowledge protocol one party can convince the other party of knowing some secret information without disclosing any bit of this information. Motivated by these protocols, we survey some complexity-theoretic results on interactive proof systems and related complexity classes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
