Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Berger, Kannan, Peralta, “A Framework For The Study Of Cryptographic Protocols”. Proceedings of Crypto85
Manuel Blum, “Coin Flipping By Phone”. COMPCON. IEEE, February 1982
Chaum, Evertse, van de Graaf, Peralta, “Demonstrating Possession of a Discrete Logarithm Without Revealing it”. Proceedings of Crypto86
Galil, Haber, Yung, “A Private Interactive Test of a Boolean Predicate and Minimum-Knowledge Public-Key Cryptosystems”. 26th. FOCS, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van de Graaf, J., Peralta, R. (1988). A Simple and Secure Way to Show the Validity of Your Public Key. In: Pomerance, C. (eds) Advances in Cryptology — CRYPTO ’87. CRYPTO 1987. Lecture Notes in Computer Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48184-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-48184-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18796-7
Online ISBN: 978-3-540-48184-3
eBook Packages: Springer Book Archive