A Simple and Secure Way to Show the Validity of Your Public Key
We present a protocol for convincing an opponent that an integer N is of the form PrQs, with P and Q primes congruent to 3 modulo 4 and with r and s odd. Our protocol is provably secure in the sense that it does not reveal the factors of N. The protocol is very fast and therefore can be used in practice.
KeywordsPrime Factor Random Element Joint Probability Distribution Chinese Remainder Theorem Quadratic Residue
- [BKP85]Berger, Kannan, Peralta, “A Framework For The Study Of Cryptographic Protocols”. Proceedings of Crypto85Google Scholar
- [Blum82]Manuel Blum, “Coin Flipping By Phone”. COMPCON. IEEE, February 1982Google Scholar
- [CEGP86]Chaum, Evertse, van de Graaf, Peralta, “Demonstrating Possession of a Discrete Logarithm Without Revealing it”. Proceedings of Crypto86Google Scholar
- [GHY85]Galil, Haber, Yung, “A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems”. 26th. FOCS, 1985.Google Scholar