Abstract
We construct a simulator for the simulating auxiliary input problem with complexity better than all previous results and prove the optimality up to logarithmic factors by establishing a black-box lower bound. Specifically, let be the length of the auxiliary input and be the indistinguishability parameter. Our simulator is more complicated than the distinguisher family. For the lower bound, we show the relative complexity to the distinguisher of a simulator is at least assuming the simulator is restricted to use the distinguishers in a black-box way and satisfy a mild restriction.
Cite
CITATION STYLE
Chen, Y. H., Chung, K. M., & Liao, J. J. (2018). On the complexity of simulating auxiliary input. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10822 LNCS, pp. 371–390). Springer Verlag. https://doi.org/10.1007/978-3-319-78372-7_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
