Secure object identification: or: solving the Chess Grandmaster Problem
Date: September 2003
Publication: Proceedings of the 2003 Workshop on New Security Paradigms NSPW '03
Page(s): 77 - 85
Source 1: http://www.nspw.org/papers/2003/nspw2003-alkassar.pdf
Source 2: http://dx.doi.org/10.1145/986655.986668 - Subscription or payment required
Many applications of cryptographic identification protocols are vulnerable against physical adversaries who perform real time attacks. For instance, when identifying a physical object like an automated teller machine, common identification schemes can be bypassed by faithfully relaying all messages between the communicating participants. This attack is known as mafia fraud.The Probabilistic Channel Hopping (PCH) system we introduce in this paper, solves this problem by hiding the conversation channel between the participants. The security of our approach is based on the assumption that an adversary cannot efficiently relay all possible communication channels of the PCH system in parallel.
Do you have additional information to contribute regarding this research paper? If so, please email firstname.lastname@example.org with the details.