One-way functions are essential for complexity based cryptography
暂无分享,去创建一个
[1] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[2] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[3] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[4] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[5] Leonid A. Levin,et al. Pseudo-random generation from one-way functions , 1989, STOC '89.
[6] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[7] David Chaum,et al. Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How , 1986, CRYPTO.
[8] Silvio Micali,et al. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[9] Adi Shamir,et al. How to share a secret , 1979, CACM.
[10] Charles Rackoff,et al. A Basic Theory of Public and Private Cryptosystems , 1988, CRYPTO.
[11] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[12] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[13] Gilles Brassard,et al. Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyond , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).