Privacy and Reliability by Dispersive Routing

Zlatokrilov, Haim; Levy, Hanoch

doi:10.1007/11499169_33

Cited by 5 publications

(8 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We base the proof on the following claim that is also used in the proof of Theorem 8: The detailed proofs of Theorem 7 and Claim 1 are omitted and can be found in [27].…”

Section: Theoremmentioning

confidence: 99%

“…For that reason and for a better understanding of the problem, we have formulated the attacker problem as a linear programming problem. Due to lack of space we omit the details of the formulation and present them in [27]. This formulation can be used to solve the attacker problem by a Linear Programming (LP) solver.…”

Section: A Brief Description Of the Problemmentioning

confidence: 99%

“…where P is the number of paths in the attacker problem Proof: We provide only a sketch of the proof and the detailed proof can be found in [27]: The approach is to show that any approximation ratio to the PWST can be used to approximate the attacker problem. We prove this by translating the attacker problem to an instance of PWST in polynomial time.…”

Section: Theoremmentioning

confidence: 99%

“…The proof is based on reduction from the 3SAT problem (similar construction to the one in [24], the details can be found in [27]). …”

Section: Proof: Inmentioning

confidence: 99%

“…else remove l i from LP model Procedure ValidateSolutionWithLP solves the attacker problem linear programming model described in [27] by a linear programming solver such as CPLEX [14]. The procedure returns the minimal guaranteed attacker's cost.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Session Privacy Enhancement by Traffic Dispersion

Zlatokrilov

Levy

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We propose to overcome this via dispersive routing, conducted over multiple paths. This increases significantly the costs inflicted on an attacker who wishes to eavesdrop sessions by hijacking network links (or routers). We formulate the Security Traffic Manager (STM) problem (route session fragments 1 , over multiple paths, so that protection against an attacker, with a known hijacking budget, is guaranteed) and the attacker problem (find the cheapest hijacking strategy). The problems are analyzed for cases in which the attacker must eavesdrop all the fragments as well for cases in which it must eavesdrop only a fraction of them. We analyze the theoretical complexity of these problems and offer algorithms for finding dispersive routes that guarantee security. Though some theoretical cases of the problem are shown to be NP-Hard, typical practical cases can be solved by polynomial time algorithms. We extend the STM problem to more practical situations where the goal of the STM is to guarantee privacy, using minimal number of limited-length paths. The algorithms are tested through simulation and shown to be efficient in many scenarios. The model and algorithms offered in this study can be used for deploying a "session enhanced security" service in packet networks 2 .

show abstract

“…We base the proof on the following claim that is also used in the proof of Theorem 8: The detailed proofs of Theorem 7 and Claim 1 are omitted and can be found in [27].…”

Section: Theoremmentioning

confidence: 99%

Section: A Brief Description Of the Problemmentioning

confidence: 99%

Section: Theoremmentioning

confidence: 99%

“…The proof is based on reduction from the 3SAT problem (similar construction to the one in [24], the details can be found in [27]). …”

Section: Proof: Inmentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Session Privacy Enhancement by Traffic Dispersion

Zlatokrilov

Levy

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

show abstract

Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing

Zlatokrilov

Levy

2007

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications

View full text Add to dashboard Cite

Area Avoidance Routing in Distance-Vector Networks

Zlatokrilov¹,

Levy²

2008

2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications

View full text Add to dashboard Cite

Network routing may be required, under certain applications, to avoid certain areas (or nodes). These areas can be of potential security threat, possess poor quality or have other undesired characteristics. Thus, protocols that can perform area avoidance routing can be beneficial for many objectives. Such routing is particularly challenging in distancevector networks, where only the shortest-distance information is available to the nodes. We address this challenge by algorithms that retrieve distance-vector information from other nodes in the network, referred to as reference nodes, and exploit it for computing guaranteed area-avoiding paths. Having these paths, the source can direct the packets using loose source routing towards the destination. We lay out the model for area avoidance routing and study several algorithms for calculating area-avoiding paths. In addition, we address the problem of dynamically selecting reference nodes. We show, through analysis and extensive simulation, that in many cases a small number of reference nodes are sufficient for area avoidance routing 1 .

show abstract

Privacy and Reliability by Dispersive Routing

Cited by 5 publications

References 2 publications

Session Privacy Enhancement by Traffic Dispersion

Session Privacy Enhancement by Traffic Dispersion

Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing

Area Avoidance Routing in Distance-Vector Networks

Contact Info

Product

Resources

About