The Schnorr Identification Protocol relies upon the security of the Discrete Logarithm Problem. Schnorr's protocol was introduced after, and is comparable to, the identification protocol of Fiat and Shamir and that of Guillou-Quisquater.

learn more… | top users | synonyms

1
vote
0answers
21 views

Hash-values's length in identification schemes

I am trying to understand the impact of applying a hash function in an identification scheme. It makes reference to the publication "On the length of cryptographic hash-values used in identification ...
0
votes
0answers
28 views

Identification schemes: Okamoto

I am reading Cryptography theory and practice by Stinson. The book is talking about the proof of security of Schnorr and Okamoto schemes. It claims that if an impersonater can find (in the case of the ...
0
votes
2answers
84 views

Schnorr's identication protocol

Schnorr's identification protocol is said to be a honest verifier zero knowledge protocol. Does it imply it will not work if the verifier is dishonest? I'm wondering if this is the case, it would ...
0
votes
0answers
41 views

Size of Messages Exchanged by PRV and VER for Schnorr Protocol

In this file Elliptic Curve Based Zero Knowledge Proofs and Their Applicability on Resource Constrained Devices I don't understand the Table 6 (Table 6: Size of Messages Exchanged by the Prover(PRV) ...
2
votes
1answer
227 views

Schnorr Identification protocol sometimes wrong?

I'm implementing the Schnorr Identification protocol as part of a larger protocol. In a large percentage of cases, around 20%, my test fails. I don't think it's a code problem, although possible, but ...
1
vote
1answer
482 views

Schnorr Identification Scheme under active adversary

According to the paper “GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks” by Mihir Bellare and Adriana Palacio, the Schnorr ...
7
votes
4answers
362 views

How to forge Schnorr signatures if you can guess the challenge

Underlying the Schnorr signature is an identification protocol: let $G$ be a cyclic group where discrete log is "hard" and choose $g$ as a generator of $G$. Now have Alice pick a random (secret) ...