On Doubly-Efficient Interactive Proof Systems
From MaRDI portal
Publication:4571853
DOI10.1561/0400000084zbMath1394.68179OpenAlexW4206758876WikidataQ129955550 ScholiaQ129955550MaRDI QIDQ4571853
Publication date: 2 July 2018
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000084
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (2)
SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
This page was built for publication: On Doubly-Efficient Interactive Proof Systems
