On transformation of interactive proofs that preserve the prover's complexity

DOI10.1145/335305.335330zbMath1296.68061OpenAlexW2009759346MaRDI QIDQ3191986

Salil P. Vadhan

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335330

zbMATH Keywords

zero-knowledge proofsinteractive proof systemsArthur-Merlin gamespseudorandom permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Private Coins versus Public Coins in Zero-Knowledge Proof Systems

This page was built for publication: On transformation of interactive proofs that preserve the prover's complexity