This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
|
The algorith given under the "procedure" heading describes the Fiat-Shamit identification scheme, which is not zero-knowledge. See the German wikipedia for the differences of Feige-Fiat_shamir and Fiat-Shamir.— Preceding unsigned comment added by 194.231.192.194 ( talk) 16:58, 2 January 2007 (UTC)
In ZKPs, it's traditional to use Peggy/Victor (prover/verifier) instead of Alice and Bob. -- Johnruble 15:07, 10 July 2007 (UTC)
Could it be that v_i ≡ s_i^2 ( mod n ) is wrong? According to Trappe, Wade; Washington, Lawrence C. (2003). Introduction to Cryptography with Coding Theory it is v_i ≡ s_i^(-2) ( mod n ) which is equal to v_i*s_i^2 ≡ (1 mod n) 138.246.2.114 ( talk) 08:51, 27 July 2016 (UTC)
In the security section, a ZK simulator is proposed. This simulator is not sufficient: the x it outputs is always a square (a member of QR(N)), while this is not the case for honest commitments.— Preceding unsigned comment added by 78.48.105.117 ( talk) 15:41, 25 September 2016 (UTC)
https://web.archive.org/web/20220120034507/https://link.springer.com/content/pdf/10.1007/BF02351717.pdf https://web.archive.org/web/20200211022012/https://academiccommons.columbia.edu/doi/10.7916/D8PZ5HRV/download — Preceding unsigned comment added by 2600:1700:95E0:59F0:1133:B0CC:62CF:823F ( talk) 13:54, 27 June 2022 (UTC)
This article is rated Start-class on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
|
The algorith given under the "procedure" heading describes the Fiat-Shamit identification scheme, which is not zero-knowledge. See the German wikipedia for the differences of Feige-Fiat_shamir and Fiat-Shamir.— Preceding unsigned comment added by 194.231.192.194 ( talk) 16:58, 2 January 2007 (UTC)
In ZKPs, it's traditional to use Peggy/Victor (prover/verifier) instead of Alice and Bob. -- Johnruble 15:07, 10 July 2007 (UTC)
Could it be that v_i ≡ s_i^2 ( mod n ) is wrong? According to Trappe, Wade; Washington, Lawrence C. (2003). Introduction to Cryptography with Coding Theory it is v_i ≡ s_i^(-2) ( mod n ) which is equal to v_i*s_i^2 ≡ (1 mod n) 138.246.2.114 ( talk) 08:51, 27 July 2016 (UTC)
In the security section, a ZK simulator is proposed. This simulator is not sufficient: the x it outputs is always a square (a member of QR(N)), while this is not the case for honest commitments.— Preceding unsigned comment added by 78.48.105.117 ( talk) 15:41, 25 September 2016 (UTC)
https://web.archive.org/web/20220120034507/https://link.springer.com/content/pdf/10.1007/BF02351717.pdf https://web.archive.org/web/20200211022012/https://academiccommons.columbia.edu/doi/10.7916/D8PZ5HRV/download — Preceding unsigned comment added by 2600:1700:95E0:59F0:1133:B0CC:62CF:823F ( talk) 13:54, 27 June 2022 (UTC)