## Abstract

We consider the problem of whether there exist non-trivial constant-round public-coin zero-knowledge (ZK) proofs. To date, in spite of high interest in the problem, there is no definite answer to the question. We focus on the type of ZK proofs that admit a universal simulator (which handles all malicious verifiers), and show a connection between the existence of such proof systems and a seemingly unrelated “program functionality distinguishing” problem: For a natural class of constant-round public-coin ZK proofs (which we call “canonical,” since all known ZK protocols fall into this category), a session prefix output by the universal simulator can actually be used to distinguish a non-trivial property of the next-step functionality of the verifier’s code. Our result can be viewed as new evidence against the existence of constant-round public-coin ZK proofs, since the existence of such a proof system will bring about either one of the following: (1) a positive result for the above functionality-distinguishing problem, a typical goal in reverse-engineering attempts, commonly believed to be notoriously hard, or (2) a major paradigm shift in simulation strategies, beyond the only known (straight-line simulation) technique applicable to their argument counterpart, as we also argue. Note that the earlier negative evidence on constant-round public-coin ZK proofs is Barack, Lindell and Vadhan [FOCS 2003]’s result, which was based on the incomparable assumption of the existence of certain entropy-preserving hash functions, now known not to be achievable from standard assumptions via black-box reduction. The core of our technical contribution is showing that there exists a single verifier step for constant-round public-coin ZK proofs whose functionality (rather than its code) is crucial for a successful simulation. This is proved by combining a careful analysis of the behavior of a set of verifiers in the above protocols and during simulation, with an improved structure-preserving version of the well-known Babai-Moran Speedup (de-randomization) Theorem, a key tool of independent interest.

Original language | English |
---|---|

Title of host publication | Security and cryptography for networks |

Subtitle of host publication | 10th International Conference, SCN 2016, Amalfi, Italy, August 31-September 2, 2016, Proceedings |

Editors | Vassilis Zikas, Roberto De Prisco |

Place of Publication | Cham, Switzerland |

Publisher | Springer, Springer Nature |

Chapter | 13 |

Pages | 237-253 |

Number of pages | 17 |

ISBN (Electronic) | 9783319446189 |

ISBN (Print) | 9783319446172 |

DOIs | |

Publication status | Published - 2016 |

Externally published | Yes |

Event | 10th International Conference on Security and Cryptography for Networks, SCN 2016 - Amalfi, Italy Duration: 31 Aug 2016 → 2 Sep 2016 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 9841 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 10th International Conference on Security and Cryptography for Networks, SCN 2016 |
---|---|

Country | Italy |

City | Amalfi |

Period | 31/08/16 → 2/09/16 |