1401 search results - page 18 / 281 » Randomness in Interactive Proofs |
COCO
2008
Springer
14 years 11 months ago
2008
Springer
FOCS
2008
IEEE
14 years 10 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...
ASE
2005
14 years 9 months ago
2005
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
JOC
2011
14 years 15 days ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...