89 search results - page 1 / 18 » On Interactive Proofs with a Laconic Prover |
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
CRYPTO
1991
Springer
14 years 2 days ago
1991
Springer
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
FOCS
2008
IEEE
13 years 9 months ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
CRYPTO
1989
Springer
14 years 18 days ago
1989
Springer
