most citedAutomatic analysis of distance bounding protocols

11 citations · 16 across the 5 of their papers we have counts for

collaborators
Showing cs.CRShow all

5 papers · 1 filter

cs.CR2010

Disabling equational theories in unification for cryptographic protocol analysis through tagging

Sreekanth Malladi

In this paper, we show a new tagging scheme for cryptographic protocol messages. Under this tagging, equational theories of operators such as exclusive-or, binary addition etc. are…

cs.CR2010

How to prevent type-flaw and multi-protocol attacks on cryptographic protocols under Exclusive-OR

Sreekanth Malladi

Type-flaw attacks and multi-protocol attacks on security protocols have been frequently reported in the literature. Heather et al. and Guttman et al. have proven that these could b…

cs.CR20101 cited

How to prevent type-flaw attacks on security protocols under algebraic properties

Sreekanth Malladi, Pascal Lafourcade

Type-flaw attacks upon security protocols wherein agents are led to misinterpret message types have been reported frequently in the literature. Preventing them is crucial for proto…

cs.CR201011 cited

Automatic analysis of distance bounding protocols

Sreekanth Malladi, Bezawada Bruhadeshwar, Kishore Kothapalli

Distance bounding protocols are used by nodes in wireless networks to calculate upper bounds on their distances to other nodes. However, dishonest nodes in the network can turn the…

cs.CR20104 cited

Protocol indepedence through disjoint encryption under Exclusive-OR

Sreekanth Malladi

Multi-protocol attacks due to protocol interaction has been a notorious problem for security. Gutman-Thayer proved that they can be prevented by ensuring that encrypted messages ar…