Multipath Inter-Domain Routing Decision Verification Protocol

2015 ◽  
Vol 713-715 ◽  
pp. 2269-2275
Author(s):  
Xiu Feng Qiu ◽  
Jian Wei Liu ◽  
Qian Hong Wu ◽  
Qi Zhong

Because of complicated security policy collisions and twisted interest conflicts in network domains, inter-domain routing security has been a challenge of secure routing. At present most of related researches focus on the authentication of routing source and true path, but seldom addresses another point of whether the routing decision process matches expected policy. In this paper, a multipath inter-domain routing decision verification protocol was designed, which can verify whether an autonomous domain (AD) keeps its promise about choosing appropriate M from N paths that have the same destination and are received from upstream ADs, and sending to a downstream AD. According to the analysis, the protocol is valid and can protect privacy of participants, as well as can resist attacks such as forgery, modification and replay etc. and deploy on internet incrementally.

2015 ◽  
Vol 12 (4) ◽  
pp. 1327-1344
Author(s):  
Lingjing Kong ◽  
Hong Shen

To resolve the difficulties in deployment of the classic security solution S-BGP (Secure Border Gateway Protocol), the Translator Trust Model (TTM) for a new solution SE-BGP (Security Enhanced BGP) was proposed to transform the centralized deployment mode of S-BGP to distributed mode. However, the trust (attestations of routing information) translation of TTM only depends on a single hub node and this results in severe threats for the inter-domain routing system. To overcome the deficiencies of TTM, in this paper we improve TTM to Distributed TTM (DTTM) by expanding the single hub node to a set of selected multiple hub nodes; in our DTTM, the task of attestations is distributed over multiple hub nodes instead of on a single hub node. In order to make the hub nodes respond to the case of single node failures, we design a restoration mechanism to recover the network based on the neighbour-ring structure. Besides, we develop Cooperative Secure BGP (CSBGP) to realize DTTM in BGP. In comparison with SE-BGP, our experimental results show that CS-BGP achieves an improved scalability, reduced convergence time and enhanced security.


Author(s):  
Konstantinos Papachristou ◽  
Traianos Theodorou ◽  
Stavros Papadopoulos ◽  
Aikaterini Protogerou ◽  
Anastasios Drosou ◽  
...  

Author(s):  
A.R. Naseer ◽  
Ismat K. Maarouf ◽  
Ashraf S. Hasan

Since routing is a fundamental operation in all types of networks, ensuring routing security is a necessary requirement to guarantee the success of routing operation. Securing routing task gets more challenging as the target network lacks an infrastructure-based routing operation. This infrastructure-less nature that invites a multihop routing operation is one of the main features of wireless sensor networks that raises the importance of secure routing problem in these networks. Moreover, the risky environment, application criticality, and resources limitations and scarcity exhibited by wireless sensor networks make the task of secure routing much more challenging. All these factors motivate researchers to find novel solutions and approaches that would be different from the usual approaches adopted in other types of networks. The purpose of this chapter is to provide a comprehensive treatment of the routing security problem in wireless sensor networks. The discussion flow of the problem in this chapter begins with an overview on wireless sensor networks that focuses on routing aspects to indicate the special characteristics of wireless sensor networks from routing perspective. The chapter then introduces the problem of secure routing in wireless sensor networks and illustrates how crucial the problem is to different networking aspects. This is followed by a detailed analysis of routing threats and attacks that are more specific to routing operation in wireless sensor networks. A research-guiding approach is then presented to the reader that analyzes and criticizes different techniques and solution directions for the secure routing problem in wireless sensor network. This is supported by state-of-the-art and familiar examples from the literature. The chapter finally concludes with a summary and future research directions in this field.


Author(s):  
Glen E. Bodner ◽  
Rehman Mulji

Left/right “fixed” responses to arrow targets are influenced by whether a masked arrow prime is congruent or incongruent with the required target response. Left/right “free-choice” responses on trials with ambiguous targets that are mixed among fixed trials are also influenced by masked arrow primes. We show that the magnitude of masked priming of both fixed and free-choice responses is greater when the proportion of fixed trials with congruent primes is .8 rather than .2. Unconscious manipulation of context can thus influence both fixed and free choices. Sequential trial analyses revealed that these effects of the overall prime context on fixed and free-choice priming can be modulated by the local context (i.e., the nature of the previous trial). Our results support accounts of masked priming that posit a memory-recruitment, activation, or decision process that is sensitive to aspects of both the local and global context.


2012 ◽  
Author(s):  
Yustina Rafla ◽  
Pennie Seibert ◽  
Jennifer Valerio ◽  
Christian Zimmerman

Sign in / Sign up

Export Citation Format

Share Document