2016-10-01
Distinguishing two probability ensembles with one sample from each ensemble
Publication
Publication
Theory of Computing Systems , Volume 59 - Issue 3 p. 517- 531
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 ( ...
Additional Metadata | |
---|---|
Springer | |
doi.org/10.1007/s00224-015-9661-1 | |
Theory of Computing Systems | |
Networks | |
Organisation | Algorithms and Complexity |
Antunes, L., Buhrman, H., 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 |