A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On Round-Efficient Argument Systems
[chapter]
2005
Lecture Notes in Computer Science
We consider the problem of constructing round-efficient public-coin argument systems, that is, interactive proof systems that are only computationally sound with a constant number of rounds. We focus on argument systems for NTime(T (n)) where either the communication complexity or the verifier's running time is subpolynomial in T (n), such as Kilian's argument system for NP [Kil92] and universal arguments [BG02, Mic00] . We begin with the observation that under standard complexity assumptions,
doi:10.1007/11523468_12
fatcat:x3k2vjcelzct5oggyjy2kujd3y