A Simple and Secure Way to Show the Validity of Your Public Key

  • Jeroen van de Graaf
  • Renė Peralta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 293)


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.


Prime Factor Random Element Joint Probability Distribution Chinese Remainder Theorem Quadratic Residue 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [BKP85]
    Berger, Kannan, Peralta, “A Framework For The Study Of Cryptographic Protocols”. Proceedings of Crypto85Google Scholar
  2. [Blum82]
    Manuel Blum, “Coin Flipping By Phone”. COMPCON. IEEE, February 1982Google Scholar
  3. [CEGP86]
    Chaum, Evertse, van de Graaf, Peralta, “Demonstrating Possession of a Discrete Logarithm Without Revealing it”. Proceedings of Crypto86Google Scholar
  4. [GHY85]
    Galil, Haber, Yung, “A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems”. 26th. FOCS, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Jeroen van de Graaf
    • 1
  • Renė Peralta
    • 2
  1. 1.Centrum voor Wiskunde en InformaticaAmsterdam
  2. 2.Facultad de MatemáticasUniversidad Católica de ChileChile

Personalised recommendations