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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 293 LNCS, Issue , 1988, Pages 128-134

  van de Graaf, Jeroen ^a   Peralta, Renė ^b  

^a CWI   (Netherlands)

^b PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INTEGER-N; PROVABLY SECURE; PUBLIC KEYS;

CRYPTOGRAPHY;

EID: 85028761718     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48184-2_9     Document Type: Conference Paper

References (4)

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