On the Power of Impersonation Attacks

Details On the Power of Impersonation Attacks On the Power of Impersonation Attacks

2010-07-07

arxiv.org/abs/1007.1086v1

Computer Science

Distributed, Parallel, and Cluster Computing

This is the full version of a brief announcement (under the same name), which appeared in Proc. 21st International Symposium o

Scientific paper

In this paper we consider a synchronous message passing system in which in every round an external adversary is able to send each processor up to k messages with falsified sender identities and arbitrary content. It is formally shown that this impersonation model is slightly stronger than the asynchronous message passing model with crash failures. In particular, we prove that (k+1)-set agreement can be solved in this model, while k-set agreement is impossible, for any k>=1. The different strength of the asynchronous and impersonation models is exhibited by the order preserving renaming problem, for which an algorithm with n+k target namespace exists in the impersonation model, while an exponentially larger namespace is required in case of asynchrony.

Affiliated with

Also associated with

No associations

Rating

On the Power of Impersonation Attacks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Power of Impersonation Attacks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Power of Impersonation Attacks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-345149