We introduced a new method for distinguishing two probability ensembles called one from each method, in which the distinguisher receives as input two samples, one from each ensemble. We compare this new method with multi-sample from the same method already exiting in the literature and prove that there are ensembles distinguishable by the new method, but indistinguishable by the multi-sample from the same method. To evaluate the power of the proposed method we also show that if non-uniform distinguishers ( ...
Information (theme 2)
Springer
dx.doi.org/10.1007/s00224-015-9661-1
Theory of Computing Systems
Networks
This work was funded by the The Netherlands Organisation for Scientific Research (NWO); grant id nwo/024.002.003 - Networks
Algorithms and Complexity

Antunes, L.F, Buhrman, H.M, Matos, A, Souto, A, & Teixeira, A. (2016). Distinguishing two probability ensembles with one sample from each ensemble. Theory of Computing Systems, 59(3), 517–531. doi:10.1007/s00224-015-9661-1