On Concurrent Identification Protocols
Author(s)
Goldreich, Oded![Thumbnail](/bitstream/handle/1721.1/149060/MIT-LCS-TM-250.pdf.jpg?sequence=3&isAllowed=y)
DownloadMIT-LCS-TM-250.pdf (5.086Mb)
Metadata
Show full item recordAbstract
We consider communication networks in which it is not possible to identify the source of a message which is broadcastes through the network. A natural question is whether it is possible for two users to identify each other concurrently, through a secure two-party protocol. We show that more than the existence of a secure Public Key Cryptosystem should be assumed in order to present a secure protocol for concurrent identification. We present two concurrent identification protocols: The first one relies on the existence of a center who has distributed "identification tags" two the users; while the second protocol relies on the distribution of "experimental sequences" by instances of a pre-protocol which have taken place between every two users.
Date issued
1983-12Series/Report no.
MIT-LCS-TM-250