This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Matching Secrets in the Absence of a Continuously Available Trusted Authority
February 1987 (vol. 13 no. 2)
pp. 289-292
C. Meadows, Naval Research Laboratory
The problem of authentication of mutually suspicious parties is one that is becoming more and more important with the proliferation of distributed systems. In this paper we describe a protocol, based on the difficulty of finding discrete logarithms over finite fields, by which users can verify whether they have matching credentials without revealing their credentials to each other unless there is a match. This protocol requires a trusted third party, but does not require it to be available to the users except when they sign up for the system. Thus it is useful in situations in which a trusted third party exists but is not available to all users at all times.
Index Terms:
public-key cryptography, Authentication, cryptographic protocols, discrete logarithms, distributed systems, finite fields, matchmaking protocols
Citation:
C. Meadows, D. Mutchler, "Matching Secrets in the Absence of a Continuously Available Trusted Authority," IEEE Transactions on Software Engineering, vol. 13, no. 2, pp. 289-292, Feb. 1987, doi:10.1109/TSE.1987.233152
Usage of this product signifies your acceptance of the Terms of Use.