Dynamic Trust Metrics for Peer-to-Peer Systems

Duma, Claudiu; Shahmehri, Nahid; Caronni, Germano

doi:10.1109/dexa.2005.80

Cited by 64 publications

(43 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The full details of the reputation model that we have used is presented in Duma et al [116]. Below we present some details of this model that we have used in TRAP.…”

Section: Calculation Of Reputation Valuesmentioning

confidence: 99%

See 1 more Smart Citation

Collaborative Network Security: Targeting Wide-area Routing and Edge-network Attacks

Hiran

2016

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

To ensure that services can be delivered reliably and continuously over the Internet, it is important that both Internet routes and edge networks are secured. However, the sophistication and distributed nature of many attacks that target wide-area routing and edge networks make it difficult for an individual network, user, or router to detect these attacks. Therefore collaboration is important. Although the benefits of collaboration between different network entities have been demonstrated, many open questions still remain, including how to best design distributed scalable mechanisms to mitigate attacks on the network infrastructure. This thesis makes several contributions that aim to secure the network infrastructure against attacks targeting wide-area routing and edge networks.First, we present a characterization of a controversial large-scale routing anomaly, in which a large Telecom operator hijacked a very large number of Internet routes belonging to other networks. We use publicly available data from the time of the incident to understand what can be learned about large-scale routing anomalies and what type of data should be collected in the future to diagnose and detect such anomalies.Second, we present multiple distributed mechanisms that enable collaboration and information sharing between different network entities that are affected by such attacks. The proposed mechanisms are applied in the contexts of collaborating Autonomous Systems (ASes), users, and servers, and are shown to help raise alerts for various attacks. Using a combination of data-driven analysis and simulations, based on publicly available real network data (including traceroutes, BGP announcements, and network relationship data), we show that our solutions are scalable, incur low communication and processing overhead, and provide attractive tradeoffs between attack detection and false alert rates.Finally, for a set of previously proposed routing security mechanisms, we consider the impact of regional deployment restrictions, the scale of the collaboration, and the size of the participants deploying the solutions. Although regional deployment can be seen as a restriction and the participation of large networks is often desirable, we find interesting cases where regional deployment can yield better results compared to random global deployment, and where smaller networks can play an important role in achieving better security gains. This study offers new insights towards incremental deployment of different classes of routing security mechanisms.This work was supported by the Swedish National Graduate School of Computer Science (CUGS) and the Internet Foundation in Sweden (IIS). iii Populärvetenskaplig sammanfattningInternet och dess tjänsterär mycket exponerade för attacker. Många av de kritiska protokoll och mekanismer som behövs för att leverera tjänsteröver internet designades för flera decennier sedan. Dessa protokoll och mekanismerär starkt beroende av tillit mellan olika nätverkskomponenter, såsom routers och servrar. Den ex...

show abstract

“…The full details of the reputation model that we have used is presented in Duma et al [116]. Below we present some details of this model that we have used in TRAP.…”

Section: Calculation Of Reputation Valuesmentioning

confidence: 99%

“…TRAP uses a dynamic trust metric that is resilient to oscillatory behavior. It consists of a short-term trust factor, a long-term trust factor and a penalty factor that can be applied to either the short-term or the long-term trust factor [116], and has values from 0 to 1.…”

Section: Calculation Of Reputation Valuesmentioning

confidence: 99%

Collaborative Network Security: Targeting Wide-area Routing and Edge-network Attacks

Hiran

2016

Linköping Studies in Science and Technology. Dissertations

View full text Add to dashboard Cite

show abstract

“…Many scholars put forward a variety of dynamic trust relationship prediction models in the open environment based on the mathematical methods and tools used to describe the uncertainty phenomenon [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. These models reflect the dynamics, complexity and uncertainty of trust relationship from different aspects, making people understand the nature of the dynamic trust relationship, and promoting the research and the development of related theory of trust relationship effectively.…”

Section: Research Backgroundmentioning

confidence: 99%

“…For example, the PTM model based on the evidence theory proposed by Almenarez et al [5,6]; the trust model based on the vector mechanism put forward by Hassan et al [7]; the trust model based on the theory of the half ring proposed by George et al [8]; the trust model based on the entropy theory proposed by Sun et al [9,10] and the trust model based on the cloud mode proposed by He et al [11]. Dimitri proposed the model based on the Bayesian network model and used the Kalman information filter mechanism [12]. Claudiu proposed the dynamic trust model based on the reinforcement learning method of machine learning [13].…”

Section: Related Research Workmentioning

confidence: 99%

A Direct Trust Aggregation Algorithm Based on the Minimum Variance Time Sequence Weight

Long¹,

Wensheng²

2015

TOCSJ

View full text Add to dashboard Cite

Direct trust relationship is the foundation of research on the indirect recommendation trust between agents and the global trust degree. In view of the lack of analysis and attention on the direct trust in the current research of dynamic trust relationship, this paper proposed a minimum variance time sequence weight based on direct trust aggregation algorithm which is constrained by the fuzzy integration operator orness measurement level. The algorithm introduces the concept of agent reputation, elaborates the evolution process and the law of the trust in the process of direct interaction, and further characterizes the complexity and stability of direct trust relationship. The simulation experimental results show that the model has a good dynamic adaptability and scalability compared with the conventional model.

show abstract

“…With the application of trust management in research for network security, a more general definition is proposed by Grandison [2]: "Trust management is the activity of collecting, encoding, analyzing and presenting evidence relating to competence, honesty, security or dependability with the purpose of making assessments and decisions regarding trust relationships." Expanded from network security research, trust management has been studied in the context of access control [3], public key architecture [4], and reputation systems for peer-topeer networks [5,6]. Meanwhile industries that require collaboration and sharing (e.g.…”

Section: Introductionmentioning

confidence: 99%

Application of Fuzzy Logic in Federated Trust Management for Pervasive Computing

Weaver

2006

30th Annual International Computer Software and Applications Conference (COMPSAC'06)

View full text Add to dashboard Cite

show abstract

Dynamic Trust Metrics for Peer-to-Peer Systems

Cited by 64 publications

References 8 publications

Collaborative Network Security: Targeting Wide-area Routing and Edge-network Attacks

Collaborative Network Security: Targeting Wide-area Routing and Edge-network Attacks

A Direct Trust Aggregation Algorithm Based on the Minimum Variance Time Sequence Weight

Application of Fuzzy Logic in Federated Trust Management for Pervasive Computing

Contact Info

Product

Resources

About