Computational Indistinguishability: A Sample Hierarchy


We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given k0 < k samples. It is well known that in any such pair of ensembles it cannot be that both are efficiently computable (and that such phenomena cannot exist for nonuniform classes of… (More)
DOI: 10.1109/CCC.1998.694588