163 search results - page 1 / 33 » Computationally Convincing Proofs of Knowledge |
63
Voted
STACS
1991
Springer
15 years 1 months ago
1991
Springer
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...
IH
2001
Springer
15 years 2 months ago
2001
Springer
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any infor...
113
click to vote
COCO
2005
Springer
15 years 3 months ago
2005
Springer
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
107
click to vote
AFRICACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for provin...