Direct Product Hardness Amplification

David Lanzenberger and Ueli Maurer

Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 605–625, Nov 2021.

This paper makes three contributions. First, we present a simple theory of random systems. The main idea is to think of a probabilistic system as an equivalence class of distributions over deterministic systems. Second, we demonstrate how in this new theory, the optimal information-theoretic distinguishing advantage between two systems can be characterized merely in terms of the statistical distance of probability distributions, providing a more elementary understanding of the distance of systems. In particular, two systems that are $ϵ$ -close in terms of the best distinguishing advantage can be understood as being equal with probability $1 - ϵ$ , a property that holds statically, without even considering a distinguisher, let alone its interaction with the systems. Finally, we exploit this new characterization of the distinguishing advantage to prove that any threshold combiner is an amplifier for indistinguishability in the information-theoretic setting, generalizing and simplifying results from Maurer, Pietrzak, and Renner (CRYPTO 2007).

BibTeX Citation

@inproceedings{LanMau21,
    author       = {David Lanzenberger and Ueli Maurer},
    title        = {Direct Product Hardness Amplification},
    editor       = {Nissim, Kobbi and Waters, Brent},
    booktitle    = {Theory of Cryptography --- TCC 2021},
    pages        = {605--625},
    series       = {LNCS},
    volume       = {13043},
    year         = {2021},
    month        = {11},
    address      = {Cham},
    publisher    = {Springer International Publishing},
}