BibTeX
@MISC{Zhang_aprivate,
author = {Kan Zhang and Roger Needham},
title = {A Private Matchmaking Protocol},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we introduce the problem of private matchmaking. Private matchmaking is interesting because it has conflicting requirements for anonymity and authentication. A private matchmaking protocol allows two or more mutually suspicious parties with matching credentials to locate and authenticate each other without revealing their credentials or identities to anyone including the matchmaker. Private matchmaking is more than mutual authentication of suspicious parties in that it has further requirements on privacy and efficient locating. We present a simple and efficient solution to the private matchmaking problem without using public-key cryptography or a trusted matchmaker. Extensions and open problems are also discussed.
Keyphrases
private matchmaking private matchmaking protocol suspicious party efficient solution public-key cryptography ever-increasing speed conflicting requirement open problem private matchmaking problem mutual authentication efficient locating trusted matchmaker privacy issue major concern personal activity
