Computational Indistinguishability: A Sample Hierarchy

We consider the existence of pairs of probability ensembles that may be efficiently distinguished given k samples, but cannot be efficiently distinguished given k?

[1]  John C. Mitchell,et al.  A linguistic characterization of bounded oracle computation and probabilistic polynomial time , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[2]  Martin Hofmann.  A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion , 1997, CSL.

[3]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[4]  Oded Goldreich,et al.  Computational Indistinguishability: Algorithms vs. Circuits , 1998, Theor. Comput. Sci..

[5]  V. Shoup.  New algorithms for finding irreducible polynomials over finite fields , 1990 .

[6]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[7]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

[8]  David Zuckerman,et al.  Randomness-optimal oblivious sampling , 1997, Random Struct. Algorithms.

[9]  Martin Hofmann.  Safe recursion with higher types and BCK-algebra , 2000, Ann. Pure Appl. Log..

[10]  Bernd Meyer.  Constructive separation of classes of indistinguishable ensembles , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[11]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[13]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[14]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[15]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.