An interactive identification scheme based on discrete logarithms and factoring

DOI10.1007/BF00191319zbMath0739.68033OpenAlexW4253346574MaRDI QIDQ1184505

Kevin S. McCurley, Ernest F. Brickell

Publication date: 28 June 1992

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00191319

zbMATH Keywords

digital signaturesinteractive identificationwitness hiding

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Off-line electronic cash based on secret-key certificates ⋮ Practical proofs of knowledge without relying on theoretical proofs of membership on languages ⋮ On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes ⋮ Computation of discrete logarithms in prime fields ⋮ An interactive identification scheme based on discrete logarithms and factoring ⋮ Several practical protocols for authentication and key exchange ⋮ On Schnorr's preprocessing for digital signature schemes ⋮ Short fail-stop signature scheme based on factorization and discrete logarithm assumptions ⋮ An algorithm for modular exponentiation.

Cites Work

• A key distribution system equivalent to factoring
• Zero-knowledge proofs of identity
• Computation of discrete logarithms in prime fields
• An interactive identification scheme based on discrete logarithms and factoring
• The Knowledge Complexity of Interactive Proof Systems
• Monte Carlo Methods for Index Computation (mod p)
• Greatest of the Least Primes in Arithmetic Progressions Having a Given Modulus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interactive identification scheme based on discrete logarithms and factoring