Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1145/986655.986668 | NSPW |
Keywords | Field | DocType |
secure object identification,possible communication channel,mafia fraud,physical object,probabilistic channel hopping,conversation channel,cryptographic identification protocol,physical adversary,chess grandmaster problem,automated teller machine,pch system,common identification scheme,identification,communication channels,real time | Conversation,Computer security,Computer science,Cryptography,Communication channel,Probabilistic logic,Adversary,Relay | Conference |
ISBN | Citations | PageRank |
1-58113-880-6 | 15 | 1.52 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ammar Alkassar | 1 | 105 | 21.85 |
| Christian Stüble | 2 | 318 | 29.52 |
| Ahmad-reza Sadeghi | 3 | 5463 | 334.69 |