1401 search results - page 11 / 281 » Randomness in Interactive Proofs |
70
Voted
WEWORC
2007
14 years 10 months ago
2007
Abstract. Courtois, Finiasz and Sendrier proposed in 2001 a practical code-based signature scheme. We give a rigorous security analysis of a modified version of this scheme in the...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
JAPLL
2006
14 years 9 months ago
2006
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines...
CRYPTO
1991
Springer
15 years 1 months 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...
109
click to vote
STACS
2005
Springer
15 years 3 months ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...