Computational indistinguishability: a sample hierarchy
暂无分享,去创建一个
[1] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[2] János Komlós,et al. The eigenvalues of random symmetric matrices , 1981, Comb..
[3] Andrew Chi-Chih Yao,et al. Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.
[4] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[5] V. Shoup. New algorithms for finding irreducible polynomials over finite fields , 1990 .
[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[7] Oded Goldreich,et al. Foundations of Cryptography (Fragments of a Book) , 1995 .
[8] David Zuckerman. Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.
[9] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[10] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[11] Bernd Meyer. Constructive separation of classes of indistinguishable ensembles , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.
[12] Oded Goldreich,et al. Computational Indistinguishability: Algorithms vs. Circuits , 1998, Theor. Comput. Sci..