The Experts below are selected from a list of 489 Experts worldwide ranked by ideXlab platform
James Irvine - One of the best experts on this subject based on the ideXlab platform.
-
VTC Fall - A Trust Based Threshold Revocation Scheme for MANETs
2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013Co-Authors: Hisham Dahshan, Fatma Elsayed, Alaa Rohiem, Aly Elgmoghazy, James IrvineAbstract:Security is very important for the reliable operation of mobile Ad Hoc networks (MANETs). One of the critical security issues in MANETs is the revocation of misbehaving nodes. In this paper, we propose a Trust based threshold cryptography revocation scheme for MANETs. In our proposed scheme, the master private key is split into n pieces according to a random polynomial. Each node in the proposed scheme is configured with a share ski of the CA private key SK, the node's public key pki, and the CA public key PK before joining the network. Meanwhile, the master private key could be recovered by combining any threshold t pieces based on Lagrange interpolation. Consequently, the proposed scheme improves the safety levels in MANETs. The proposed hop-by-hop certificate revocation scheme is based on both threshold cryptography and Transitive Trust between mobile nodes. Because of the decentralized nature of our proposed scheme, it enables a group of legitimate nodes to perform fast revocation of a nearby misbehaving node. The proposed scheme is highly robust in the mobility environment of MANETs. The advantages of the proposed scheme are justified through extensive simulations.
-
AINA - Key Management in Web of Trust for Mobile Ad Hoc Networks
2009 International Conference on Advanced Information Networking and Applications, 2009Co-Authors: Hisham Dahshan, James IrvineAbstract:A mobile ad hoc network MANET is a collection ofwireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Trust establishment and management are essential for any security framework of MANETs. Providing key management through accessing Trusted authorities or centralized servers is infeasible for MANETs due to the absence of any infrastructure, frequent mobility, and wireless link instability. In this paper we propose a self-organized, hop-by-hop public key management for MANETs based on Transitive Trust between mobile nodes. Each node creates its public key and the corresponding private key locally by the node itself, issuing certificates to neighboring nodes, and holding certificates in its local certificates repository. Authentication of public keys is performed by using both direct and recommendation Trust. The proposed scheme has low communication cost and the simulation results show that the scheme is highly robust in the mobility environment of MANETs.
Hisham Dahshan - One of the best experts on this subject based on the ideXlab platform.
-
VTC Fall - A Trust Based Threshold Revocation Scheme for MANETs
2013 IEEE 78th Vehicular Technology Conference (VTC Fall), 2013Co-Authors: Hisham Dahshan, Fatma Elsayed, Alaa Rohiem, Aly Elgmoghazy, James IrvineAbstract:Security is very important for the reliable operation of mobile Ad Hoc networks (MANETs). One of the critical security issues in MANETs is the revocation of misbehaving nodes. In this paper, we propose a Trust based threshold cryptography revocation scheme for MANETs. In our proposed scheme, the master private key is split into n pieces according to a random polynomial. Each node in the proposed scheme is configured with a share ski of the CA private key SK, the node's public key pki, and the CA public key PK before joining the network. Meanwhile, the master private key could be recovered by combining any threshold t pieces based on Lagrange interpolation. Consequently, the proposed scheme improves the safety levels in MANETs. The proposed hop-by-hop certificate revocation scheme is based on both threshold cryptography and Transitive Trust between mobile nodes. Because of the decentralized nature of our proposed scheme, it enables a group of legitimate nodes to perform fast revocation of a nearby misbehaving node. The proposed scheme is highly robust in the mobility environment of MANETs. The advantages of the proposed scheme are justified through extensive simulations.
-
AINA - Key Management in Web of Trust for Mobile Ad Hoc Networks
2009 International Conference on Advanced Information Networking and Applications, 2009Co-Authors: Hisham Dahshan, James IrvineAbstract:A mobile ad hoc network MANET is a collection ofwireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Trust establishment and management are essential for any security framework of MANETs. Providing key management through accessing Trusted authorities or centralized servers is infeasible for MANETs due to the absence of any infrastructure, frequent mobility, and wireless link instability. In this paper we propose a self-organized, hop-by-hop public key management for MANETs based on Transitive Trust between mobile nodes. Each node creates its public key and the corresponding private key locally by the node itself, issuing certificates to neighboring nodes, and holding certificates in its local certificates repository. Authentication of public keys is performed by using both direct and recommendation Trust. The proposed scheme has low communication cost and the simulation results show that the scheme is highly robust in the mobility environment of MANETs.
Ming-chin Chuang - One of the best experts on this subject based on the ideXlab platform.
-
TEAM: Trust-extended authentication mechanism for vehicular ad Hoc networks
IEEE Systems Journal, 2014Co-Authors: Ming-chin Chuang, Jeng-farn LeeAbstract:The security in vehicular ad hoc networks (VANETs) is receiving a significant amount of attention in the field of wireless mobile networking because VANETs are vulnerable to malicious attacks. A number of secure authentication schemes based on asymmetric cryptography have been proposed to prevent such attacks. However, these schemes are not suitable for highly dynamic environments like VANETs, because they cannot cope with the authentication procedure efficiently. Hence, this still calls for an efficient authentication scheme for VANETs. In this paper, we propose a decentralized lightweight authentication scheme called Trust-Extended Authentication Mechanism (TEAM) for vehicle-to-vehicle (V2V) communication networks. TEAM adopts the concept of Transitive Trust relationships to improve the performance of the authentication procedure. Moreover, TEAM satisfies the following security requirements: anonymity, location privacy, mutual authentication to prevent spoofing attacks, forgery attacks, modification attacks and replay attacks, as well as no clock synchronization problem, no verification table, fast error detection, and session key agreement. To the best of our knowledge, this is the first work to propose a hash-based authentication scheme with high security properties in VANETs.
-
TEAM: Trust-Extended Authentication Mechanism for Vehicular Ad Hoc Networks
IEEE Systems Journal, 2014Co-Authors: Ming-chin ChuangAbstract:The security of vehicular ad hoc networks (VANETs) has been receiving a significant amount of attention in the field of wireless mobile networking because VANETs are vulnerable to malicious attacks. A number of secure authentication schemes based on asymmetric cryptography have been proposed to prevent such attacks. However, these schemes are not suitable for highly dynamic environments such as VANETs, because they cannot efficiently cope with the authentication procedure. Hence, this still calls for an efficient authentication scheme for VANETs. In this paper, we propose a decentralized lightweight authentication scheme called Trust-extended authentication mechanism (TEAM) for vehicle-to-vehicle communication networks. TEAM adopts the concept of Transitive Trust relationships to improve the performance of the authentication procedure and only needs a few storage spaces. Moreover, TEAM satisfies the following security requirements: anonymity, location privacy, mutual authentication, forgery attack resistance, modification attack resistance, replay attack resistance, no clock synchronization problem, no verification table, fast error detection, perfect forward secrecy, man-in-the-middle attack resistance, and session key agreement.
David C Parkes - One of the best experts on this subject based on the ideXlab platform.
-
sybil proof accounting mechanisms with Transitive Trust
Adaptive Agents and Multi-Agents Systems, 2014Co-Authors: Sven Seuken, David C ParkesAbstract:For the design of distributed work systems like P2P file-sharing networks it is essential to provide incentives for agents to work for each other rather than free ride. Several mechanisms have been proposed to achieve this goal, including currency systems, credit networks, and accounting mechanisms. It has proven particularly challenging to provide robustness to sybil attacks, i.e., attacks where an agent creates and controls multiple false identities. In this paper, we consider accounting mechanisms for domains in which (1) transactions cannot be bound to reports, (2) transactions are bilateral and private, and (3) agents can only form Trust links upon successful work interactions. Our results reveal the trade-off one must make in designing such mechanisms. We show that accounting mechanisms with a strong form of Transitive Trust cannot be robust against strongly beneficial sybil attacks. However, we also present a mechanism that strikes a balance, providing a weaker form of Transitive Trust while also being robust against the strongest form of sybil attacks. On the one hand, our results highlight the role of strong social ties in providing robustness against sybil attacks (such as those leveraged in credit networks using bilateral IOUs), and on the other hand our results show what kind of robustness properties are possible and impossible in domains where such pre-existing Trust relations do not exist.
-
AAMAS - Sybil-proof accounting mechanisms with Transitive Trust
2014Co-Authors: Sven Seuken, David C ParkesAbstract:For the design of distributed work systems like P2P file-sharing networks it is essential to provide incentives for agents to work for each other rather than free ride. Several mechanisms have been proposed to achieve this goal, including currency systems, credit networks, and accounting mechanisms. It has proven particularly challenging to provide robustness to sybil attacks, i.e., attacks where an agent creates and controls multiple false identities. In this paper, we consider accounting mechanisms for domains in which (1) transactions cannot be bound to reports, (2) transactions are bilateral and private, and (3) agents can only form Trust links upon successful work interactions. Our results reveal the trade-off one must make in designing such mechanisms. We show that accounting mechanisms with a strong form of Transitive Trust cannot be robust against strongly beneficial sybil attacks. However, we also present a mechanism that strikes a balance, providing a weaker form of Transitive Trust while also being robust against the strongest form of sybil attacks. On the one hand, our results highlight the role of strong social ties in providing robustness against sybil attacks (such as those leveraged in credit networks using bilateral IOUs), and on the other hand our results show what kind of robustness properties are possible and impossible in domains where such pre-existing Trust relations do not exist.
-
hybrid Transitive Trust mechanisms
Adaptive Agents and Multi-Agents Systems, 2010Co-Authors: Jie Tang, Sven Seuken, David C ParkesAbstract:Establishing Trust amongst agents is of central importance to the development of well-functioning multi-agent systems. For example, the anonymity of transactions on the Internet can lead to inefficiencies; e.g., a seller on eBay failing to ship a good as promised, or a user free-riding on a file-sharing network. Trust (or reputation) mechanisms can help by aggregating and sharing Trust information between agents. Unfortunately these mechanisms can often be manipulated by strategic agents. Existing mechanisms are either very robust to manipulation (i.e., manipulations are not beneficial for strategic agents), or they are very informative (i.e., good at aggregating Trust data), but never both. This paper explores this trade-off between these competing desiderata. First, we introduce a metric to evaluate the informativeness of existing Trust mechanisms. We then show analytically that Trust mechanisms can be combined to generate new hybrid mechanisms with intermediate robustness properties. We establish through simulation that hybrid mechanisms can achieve higher overall efficiency in environments with risky transactions and mixtures of agent types (some cooperative, some malicious, and some strategic) than any previously known mechanism.
-
AAMAS - Hybrid Transitive Trust mechanisms
2010Co-Authors: Jie Tang, Sven Seuken, David C ParkesAbstract:Establishing Trust amongst agents is of central importance to the development of well-functioning multi-agent systems. For example, the anonymity of transactions on the Internet can lead to inefficiencies; e.g., a seller on eBay failing to ship a good as promised, or a user free-riding on a file-sharing network. Trust (or reputation) mechanisms can help by aggregating and sharing Trust information between agents. Unfortunately these mechanisms can often be manipulated by strategic agents. Existing mechanisms are either very robust to manipulation (i.e., manipulations are not beneficial for strategic agents), or they are very informative (i.e., good at aggregating Trust data), but never both. This paper explores this trade-off between these competing desiderata. First, we introduce a metric to evaluate the informativeness of existing Trust mechanisms. We then show analytically that Trust mechanisms can be combined to generate new hybrid mechanisms with intermediate robustness properties. We establish through simulation that hybrid mechanisms can achieve higher overall efficiency in environments with risky transactions and mixtures of agent types (some cooperative, some malicious, and some strategic) than any previously known mechanism.
Andreas U. Schmidt - One of the best experts on this subject based on the ideXlab platform.
-
Transitive Trust in mobile scenarios
arXiv: Cryptography and Security, 2006Co-Authors: Nicolai Kuntze, Andreas U. SchmidtAbstract:Horizontal integration of access technologies to networks and services should be accompanied by some kind of convergence of authentication technologies. The missing link for the federation of user identities across the technological boundaries separating authentication methods can be provided by Trusted computing platforms. The concept of establishing Transitive Trust by Trusted computing enables the desired crossdomain authentication functionality. The focus of target application scenarios lies in the realm of mobile networks and devices.
-
ETRICS - Transitive Trust in mobile scenarios
Lecture Notes in Computer Science, 2006Co-Authors: Nicolai Kuntze, Andreas U. SchmidtAbstract:Horizontal integration of access technologies to networks and services should be accompanied by some kind of convergence of authentication technologies. The missing link for the federation of user identities across the technological boundaries separating authentication methods can be provided by Trusted computing platforms. The concept of establishing Transitive Trust by Trusted computing enables the desired cross-domain authentication functionality. The focus of target application scenarios lies in the realm of mobile networks and devices.
-
Scaling Concepts between Trust and Enforcement
Trust Modeling and Management in Digital Environments, 1Co-Authors: Andreas U. Schmidt, Andreas Leicher, Inhyok ChaAbstract:Enforcement and Trust are opposite concepts in information security. This chapter reflects on the paradigm shift from traditional concepts of access control and policy enforcement toward decentralised methods for establishing Trust between loosely connected entities. By delegating parts of enforcement tasks to Trusted elements dispersed in a system, the system can establish Transitive Trust relationships. This is the most advanced evolution of the organisational method of separation of duties within IT security. The technological basis for Trust in systems – Trusted Computing platforms – is described on conceptual levels allowing comparison with other top-level security concepts and mapping to application domains. Important applications in modern information systems and networks are exhibited.
