Name
Abstract | ||
|---|---|---|
Many security protocols are vulnerable to type flaw attacks, in which a protocol message may be forged from another message. The previous approaches focus on heuristic schemes to protect specific protocols but fail to expose the enabling factors of such attacks. In this paper, we investigate the relationship between the type flaw attacks on the security protocols and the knowledge of the principals. We formalize the notion of recognizability that characterizes the fact that a message could not be type-flawed. The approach helps us better understand security protocols and gives insights into the detection and prevention of type-flaw attacks. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/GLOCOM.2010.5683314 | GLOBECOM |
Keywords | Field | DocType |
protocols,type flaw attacks,telecommunication security,security protocols,protocol message,public key,niobium,security protocol,mathematical model | Heuristic,Cryptographic protocol,Computer security,Computer science,Computer network,Enabling Factors,Telecommunication security,Security service,Public-key cryptography | Conference |
ISSN | ISBN | Citations |
1930-529X E-ISBN : 978-1-4244-5637-6 | 978-1-4244-5637-6 | 3 |
PageRank | References | Authors |
0.37 | 17 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhiwei Li | 1 | 1315 | 107.73 |
| Weichao Wang | 2 | 500 | 33.87 |