@conference {
	title = {Trust-Aware Network Utility Optimization in Multihop Wireless Networks with Delay Constraints},
	author = {Paraskevas, Evripidis., Jiang, Tao., Purkayastha, Punyaslok., Baras, John S.},
	year = {2016},
	month = {06/2016},
	abstract = {Many resource allocation problems can be formulated as a constrained maximization of a utility function. Network Utility Maximization (NUM) applies optimization techniques to achieve decomposition by duality or the primal dual method. Several important problems, for example, joint source rate control, routing, and scheduling design, can be optimized by using this framework. In this work, we introduce an important network security concept, {\textquotedblleft}trust{\textquotedblright}, into the NUM formulation and we integrate nodes{\textquoteright} trust values in the optimization framework. These trust values are based on the interaction history between network entities and community-based monitoring. Our objective is to avoid routing packets through paths with large percentage of malicious nodes. We also add end-to-end delay constraints for each of the traffic flows. The delay constraints are introduced to capture the imposed quality of service (QoS) requirements for each traffic flow.},
	address = {Athens, Greece},
	booktitle = {24th Mediterranean Conference on Control and Automation},
	pages = {pp. 593-598}
}
@conference {
	title = {Composite Trust in Networked Multi-Agent Systems},
	author = {Baras, John S., Jiang, Tao.},
	year = {2012},
	month = {06/2012},
	abstract = {Trust plays a crucial role in the analysis, synthesis and operation of the integrated system consisting of social-cognitive, information and communication networks. Multi-agent systems and associated coalition operations, which involve two or more organizations, further augment the diversity and complexity of network interactions. Trust and its derivative notions affect dramatically the networked coalition operations. A substantial part of the research challenge has to do with the multitude of meanings, interpretations, symbolisms and mathematical models used to represent and analyze trust. In this paper, we introduce value directed graphs with weighted nodes as our model for composite trust. We extend the value directed graph with weighted nodes composite trust model to include not only numerical weights, but also constraints. We show that the semiring-based constraint satisfaction problem (SCSPs) framework can serve as the unified model to investigate trust relation establishment.},
	address = {Montreal, Canada},
	booktitle = {2012 American Control Conference (ACC 2012),},
	pages = {pp. 3547-3552}
}
@conference {
	title = {A Robust Collaborative Filtering Algorithm Using Ordered Logistic Regression},
	author = {Zheng, Shanshan., Jiang, Tao., Baras, John S.},
	year = {2011},
	month = {06/2011},
	abstract = {The Internet offers tremendous opportunities for information sharing and content distribution. However, without proper filtering and selection, the large amount of information may likely swarm the users rather than benefit them. Collaborative filtering is a technique for extracting useful information from the large information pool generated by interconnected online communities. In this paper, we develop a probabilistic collaborative filtering algorithm, which is based on ordered logistic regression and takes into account both similarities among the users and similarities among the items. We make inference with maximum likelihood and Bayesian frameworks, and propose a Markov Chain Monte Carlo based Expectation Maximization algorithm to optimize model parameters. The power of our proposed algorithm is its extensibility. We show that it can incorporate content and contextual information. More importantly, it can be easily extended to include the trustworthiness of users, thus being more robust to malicious data manipulation. The experimental results on a real world data set show that our proposed algorithm with the trust extension is robust under different types of attacks in recommendation systems.},
	address = {Kyoto, Japan},
	booktitle = {IEEE International Conference on Communications (ICC 2011)},
	pages = {pp. 1-6}
}
@conference {
	title = {Exploiting Trust Relations for Nash Equilibrium Efficiency in Ad Hoc Networks},
	author = {Zheng, Shanshan., Jiang, Tao., Baras, John S.},
	year = {2011},
	month = {06/2011},
	abstract = {Ad hoc networks rely on the mutual cooperation among individual nodes to achieve network-wide objectives. However, individual nodes may behave selfishly in order to maximize their own benefits without considering the global benefits of the network. One approach to incentivize nodes cooperation for better global benefits is to establish trust relations among nodes to guide their decision making. In this paper, we present a game theoretic analysis for the efficiency of establishing trust for improving node cooperation. The trust relations among nodes are modeled as a trust-weighted network, and we study a graphical game in this network where the nodes{\textquoteright} payoffs are affected by their trust relations. We characterize the Nash equilibrium and the social optimum of this game and show that the game efficiency has a close relationship to the Bonacich centralities of nodes in the trust-weighted network. Furthermore, we propose to improve game efficiency by introducing heterogeneous resources to nodes according to their centralities. We provide both experimental and theoretical analysis on the improvement of the game efficiency.},
	address = {Kyoto, Japan},
	booktitle = {IEEE International Conference on Communications (ICC 2011)},
	pages = {pp.1-5}
}
@conference {
	title = {Robust State Estimation Under False Data Injection in Distributed Sensor Networks},
	author = {Zheng, Shanshan., Jiang, Tao., Baras, John S.},
	year = {2010},
	month = {12/2010},
	abstract = {Distributed sensor networks have been widely employed to monitor and protect critical infrastructure assets. The network status can be estimated by centralized state estimation using coordinated data aggregation or by distributed state estimation, where nodes only exchange information locally to achieve enhanced scalability and adaptivity to network dynamics. One important property of state estimation is robustness against false data injection from sensors compromised by attackers. Different from most existing works in the literature that focus on centralized state estimation, we propose two novel robust distributed state estimation algorithms against false data injection. They are built upon an existing distributed Kalman filtering algorithm. In the first algorithm, we use variational Bayesian learning to estimate attack parameters and achieve performance similar to a centralized majority voting rule, without causing extra communication overhead. In the second algorithm, we introduce heterogeneity into the network by utilizing a subset of pre-trusted nodes to achieve performance better than majority voting. We show that as long as there is a path connecting each node to some of the pre-trusted nodes, the attackers can not subvert the network. Experimental results demonstrate the effectiveness of our proposed schemes.},
	address = {Miami, Florida},
	booktitle = {IEEE Globecom 2010},
	pages = {pp.1-5}
}
@conference {
	title = {Trust-aware State Estimation Under False Data Injection In Distributed Sensor Networks},
	author = {Zheng, Shanshan., Jiang, Tao., Baras, John S.},
	year = {2010},
	month = {09/2010},
	abstract = {Distributed sensor networks have been widely employed to monitor and protect critical infrastructure assets. The network status can be estimated by centralized state estimation using coordinated data aggregation or by distributed state estimation, where nodes only exchange information locally to achieve enhanced scalability and adaptivity to network dynamics. One important property of state estimation is robustness against false data injection from sensors compromised by attackers. Different from most existing works in the literature that focus on centralized state estimation, we propose two novel robust distributed state estimation algorithms against false data injection. They are built upon an existing distributed Kalman filtering algorithm. In the first algorithm, we use variational Bayesian learning to estimate attack parameters and achieve performance similar to a centralized majority voting rule, without causing extra communication overhead. In the second algorithm, we introduce heterogeneity into the network by utilizing a subset of pre-trusted nodes to achieve performance better than majority voting. We show that as long as there is a path connecting each node to some of the pre-trusted nodes, the attackers can not subvert the network. Experimental results demonstrate the effectiveness of our proposed schemes.},
	address = {Austin, Texas},
	booktitle = {TECHCON 2010},
	pages = {pp. 1-4}
}
@conference {
	title = {A Trust Based Distributed Kalman Filtering Approach for Mode Estimation in Power Systems},
	author = {Jiang, Tao., Matei, Ion., Baras, John S.},
	year = {2010},
	month = {04/2010},
	abstract = {We consider distributed mode estimation in power systems. The measurements are observed by PMUs (Power Management Units). We introduce a novel model of trust, using weights on the graph links and nodes that represent the networked PMUs. We describe two algorithms that intergarte distributed Kalman filtering with these trust weights. We consider two interpretations of these trust weights as information accuracy and reliability. We show that by appropriate use of these weights from the distributed estimation algorithm avoids using information from untrusted PMUs. Simulation experiments further demonstrate the behavior of these algorithms.},
	address = {Stockholm, Sweden},
	booktitle = {First Workshop on Secure Control Systems (SCS) as part of CPSWeek 2010},
	pages = {pp. 1-6}
}
@conference {
	title = {Compositional Framework for System Security with Multi-metric Optimization"},
	author = {Baras, John S., Jiang, Tao., Somasundaram, Kiran K., Ivanov, Vladimir I.},
	year = {2010},
	month = {03/2010},
	abstract = {The objective of the proposed research is to develop a compositional framework and methods for~performance vs security tradeoffs via multi-criteria optimization of system security, and therefore it aligns~with problem statement 2: {\textquotedblleft}Security Framework.{\textquotedblright} We propose to study a top-down approach ~for~optimizing (1) the security metric(s) of a composite system viewed as a bivariate function of its~subsystems{\textquoteright} security and performance metrics under given constraints and (2) the composition of~subsystems that provides higher system security than that of the composition of the same subsystems~driven solely by performance maximization. In this way, we reconcile the trade-off between security and~performance by introducing a holistic, multi-objective solution that satisfies both the performance and the~security requirements for the system, by overcoming the problem of compartmentalized security solutions~and thus achieving the {\textquotedblleft}best value{\textquotedblright} of the system. Our framework delineates methods for achieving~provably secure composition of secure subsystems and system components {\textendash} a critical problem area~where almost all current results demonstrate infeasibility of achieving compositional security.},
	address = {Washington DC},
	booktitle = {SERC Security Workshop}
}
@conference {
	title = {Coalition Formation and Trust in Collaborative Control},
	author = {Baras, John S., Jiang, Tao., Hovareshti, Pedram.},
	year = {2009},
	month = {08/2009},
	abstract = {We consider the collaboration of autonomous agents as a coalitional game subject to constraints, like communication, trust or reputation. We analyze the tradeoff between the benefits of collaboration and these constraints (or costs of collaboration) via dynamic, iterative stochastic games. The agents can observe locally the actions of other agents in their neighborhood and decide whether to collaborate or not in a distributed asynchronous manner. Trust values are taken into consideration when agents act and collaborate. Specifically they affect the selection of agents to collaborate with. We consider only problems where the information used for either estimating reputations or deciding on strategies is mostly local; i.e. from the neighbors of each agent. We show that randomized algorithms emerge as the agents try to reach the maximum payoff. We also investigate the topology of the formed network by studying the second largest eigenvalue of the corresponding graph, and describe its effects on control performance.},
	address = {Budapest, Hungary},
	booktitle = {European Control Conference 2009 (ECC {\textquoteright}09)},
	pages = {pp.1197-1202}
}
@conference {
	title = {A Composite Trust Model and its Application to Collaborative Distributed Information Fusion},
	author = {Matei, Ion., Baras, John S., Jiang, Tao.},
	year = {2009},
	month = {07/2009},
	abstract = {We consider distributed state estimation of~linear dynamic systems, observed by various sensors, as a problem in information fusion. We introduce a novel model of trust, using weights on the graph links and nodes that represent the sensor network. These weights can represent several interpretations of trustworthiness in sensor networks. We describe three algorithms that integrate distributed Kalman filtering with these trust weights. We consider two interpretations of these trust weights as information accuracy and reliability. We show that by appropriate use of these weights the distributed estimation algorithm avoids using information from untrusted sensors. Simulation experiments further demonstrate the behavior of these algorithms.},
	address = {Seattle, WA},
	booktitle = {12th International Conference on Information Fusion (Fusion 2009)},
	pages = {pp. 1950-1957}
}
@conference {
	title = {Coalition Formation through Learning in Autonomic Networks},
	author = {Jiang, Tao., Baras, John S.},
	year = {2009},
	month = {05/2009},
	abstract = {Autonomic networks rely on the cooperation of participating nodes for almost all their functions. However, due to resource constraints, nodes are generally selfish and try to maximize their own benefit when participating in the network. Therefore, it is important to study mechanisms, which can be used as incentives for cooperation inside the network. In this paper, the interactions among nodes are modeled as games. A node joins a coalition if it decides to cooperate with at least one node in the coalition. The dynamics of coalition formation proceed via nodes that interact strategically and adapt their behavior to the observed behavior of others. We present conditions that the coalition formed is stable in terms of Nash stability and the core of the coalitional game.},
	address = {Istanbul, Turkey},
	booktitle = {International Conference on Game Theory for Networks (GameNets09)},
	pages = {pp.10-16}
}
@conference {
	title = {Performance Comparison of Two Sequential Change Detection Algorithms on Detection of In-band Wormholes},
	author = {Zheng, Shanshan., Jiang, Tao., Baras, John S.},
	year = {2009},
	month = {03/2009},
	abstract = {This paper compares the performance of parametric and non-parametric sequential change detection algorithms for detecting in-band wormholes in wireless ad hoc networks. The algorithms considered are the non-parametric cumulative sum (NP-CUSUM) and the repeated sequential probability ratio test (R-SPRT). Theoretical performance of the two is compared using metrics that take into account the algorithms{\textquoteright} repeated nature, and the advantage of the parametric method is illustrated. On the other hand, connections between the parametric and non-parametric methods are made in the proposed worst-case adversary model, where the non-parametric method is shown to be more robust to attack strategy changes. Experimental evaluation of wormhole detection schemes based on the two algorithms is presented. This work has implications for both the theoretical understanding and practical design of wormhole detection schemes based on parametric and nonparametric change detection algorithms.},
	address = {Baltimore, MD},
	booktitle = {Conference on Information Sciences and Systems (CISS 2009)},
	pages = {pp.270-275}
}
@conference {
	title = {Trust Credential Distribution in Autonomic Networks},
	author = {Jiang, Tao., Baras, John S.},
	year = {2008},
	month = {11/2008},
	abstract = {Autonomic networks are networks that are self-organized, and controlled and managed in a decentralized way. Peers/nodes in such networks rely on co-operation of each other. Thus, accurate trust establishment and maintenance is essential for secure and reliable operations in autonomic networks. Trust management in autonomic networks is a much more challenging problem than in traditional server-based networks. In traditional networks, centralized trusted servers provide necessary trust credentials for trust establishment. However, such servers are not available in autonomic networks, where trust credentials are distributed among users in the network. In this paper, we design a distributed scheme for efficiently distributing trust credentials, which requires no global information exchanges. Our scheme is inspired from network coding, where trust credentials are combined by the intermediate nodes during distribution.},
	address = {New Orleans, LA},
	booktitle = {IEEE Global Communications Conference (IEEE Globecom 2008)},
	pages = {pp. 1-5}
}
@conference {
	title = {Intrusion Detection of In-Band Wormholes in MANETS Using Advanced Statistical Methods},
	author = {Zheng, Shanshan., Jiang, Tao., Baras, John S.},
	year = {2008},
	month = {11/2008},
	abstract = {Due to the dynamics and mobility of mobile ad hoc networks (MANETs), intrusion detection techniques in MANETs must be adaptive. In this work, we propose detection schemes that are suitable to detect in-band wormhole attacks. The first detection scheme uses the Sequential Probability Ratio Test (SPRT). The SPRT has been proven to be an optimal detection test when the probability distributions of both normal and abnormal behaviors are given. Furthermore, we introduce non-parametric methods, which require no training and are more adaptive to mobile scenarios. The proposed detection schemes are implemented and evaluated using a 48-node testbed and a mobile ad-hoc network emulator at the Army Research Lab. The performance and the~detection accuracy of various schemes are compared, especially in the presence of congestion. We provide a quantitative analysis of tradeoffs among detection latency and probabilities of false alarms and missed detection.},
	address = {San Diego, CA},
	booktitle = {Milcom: 08 Assuring Mission Success},
	pages = {pp. 1-7}
}
@conference {
	title = {Constrained Coalitional Games and Networks of Autonomous Agents},
	author = {Baras, John S., Jiang, Tao., Purkayastha, Punyaslok.},
	year = {2008},
	month = {03/2008},
	abstract = {We develop a unifying analytical and optimization based framework for the design, operation and performance evaluation of networks of dynamic autonomous agents. The fundamental view is that agents in such a network are dynamic entities that collaborate because via collaboration they can accomplish objectives and goals much better than working alone, or even accomplish objectives that they cannot achieve alone at all. Yet the benefits derived from such collaboration require some costs (e.g. communications), or equivalently, the collaboration is subject to constraints. Understanding and quantifying this tradeoff between the benefits vs the costs of collaboration, leads to new methods that can be used to analyze, design and control/operate networks of agents. Although the inspiration for the framework comes from social and economic networks, the fundamental ideas and in particular the methodology of dynamic constrained coalitional games (DCCG) can unify many concepts and algorithms for networks in various areas: social networks, communication networks, sensor networks, economic networks, biological networks, physics networks. We then analyze a specific instance of such tradeoffs arising in the design of security-aware network protocols. We extend network utility maximization (NUM) so as to encompass security metrics such as {\textquotedblleft}trust{\textquotedblright}. The trust values assigned to nodes are based on interaction history and community-based monitoring. The effect of these trust values on the resulting protocols is that in routing and media access scheduling node trustworthiness is automatically considered and used. We develop a distributed algorithm for the joint physical-MAC-routing protocol design. Our extension to NUM with security concerns leads to resilient networks.},
	address = {St. Julians, Malta},
	booktitle = {Third International Symposium on Communications, Control and Signal Processing},
	pages = {pp. 972-979}
}
@conference {
	title = {Trust Document Distribution in Manets},
	author = {Jiang, Tao., Baras, John S.},
	year = {2007},
	month = {10/2007},
	abstract = {Mobile ad-hoc networks (MANETs) are used in battlefields where no network infrastructure exists. Users rely on their physical neighbors to communicate with other users that are not in proximity. Accurate trust establishment and maintenance is essential for secure and reliable message transmissions in MANETs. Because of the mobility and dynamics of MANETs, the validity and value of trust documents change~with time as well as with battlefield conditions and scenario stage. Thus trust management in MANETs is a much more dynamic problem than in conventional wireline networks, as well as wireless cellular networks. In traditional networks, centralized trusted servers provide necessary trust documents for trust establishment. However, such servers are not available in MANETs. Trust documents are distributed among users in the network. In this paper, we develop and analyze distributed schemes for efficiently and securely distributing trust documents, and updates, so that users are able to establish reliable trust relations with their neighbors. Key performance metrics are time response and availability of documents across the network. Our approach is inspired from network coding, where trust documents are combined during distribution.},
	address = {Orlando, FL},
	booktitle = {2007 Military Communication Conference},
	pages = {pp. 1-7}
}
@conference {
	title = {Fundamental Tradeoffs and Constrained Coalitional Games in Autonomic Wireless Networks},
	author = {Jiang, Tao., Baras, John S.},
	year = {2007},
	month = {04/2007},
	abstract = {Autonomic networks depend on collaboration between their nodes for all their functionalities. The nodes, even if modeled as selfish, gain from such collaboration, in the sense that they can accomplish functionality and performance that is impossible to achieve without such collaboration. However,such gains from collaboration do not come for free. There are costs for such collaboration incurred by each node (e.g. energy consumption for forwarding other nodes packets). In this paper we use constrained coalitional games (i.e. collaborative dynamic games subject to constraints or costs for collaboration) to investigate several key problems in autonomic wireless networks including: network formation, efficient topologies and stability of coalitions.},
	address = {Limassol, Cyprus},
	booktitle = {5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc,and Wireless Networks},
	pages = {pp. 1-8}
}
@conference {
	title = {Coalition Formation in MANETS},
	author = {Jiang, Tao., Theodorakopoulos, George., Baras, John S.},
	year = {2006},
	month = {11/2006},
	abstract = {Wireless ad-hoc networks rely on the cooperation of participating nodes for almost all their functions. However, due to resource constraints, nodes are generally selfish and try to maximize their own benefit when participating in the network. Therefore, it is important to study mechanisms which can be used as incentives to form coalitions inside the network. In this paper, we study coalition formation based on game theory, especially cooperative game theory. First, the dynamics of coalition formation proceeds via pairwise bargaining. We show that the size of the maximum coalition is a decreasing function of the cost for establishing a link. After the coalition formation process reaches the steady state, we are interested in the stability of coalitions. We prove that coalitions are stable in terms of both pairwise stability and coalitional stability.},
	address = {Orlando, FL},
	booktitle = {25th Army Science Conference},
	pages = {pp.1-8}
}
@conference {
	title = {Trust Evaluation in Anarchy: A Case Study on Autonomous Networks},
	author = {Jiang, Tao., Baras, John S.},
	year = {2006},
	month = {04/2006},
	abstract = {With the explosive growth of network techniques, in particular wireless communications, the traditional centralized, fixed networks can no longer satisfy the enormous demands on network connectivity, data storage and information exchanges. New types of networks, such as pervasive computing networks, mobile ad hoc networks and P2P networks, emerged in recent years in order to provide solutions for the increasing requirements on networked services. All those networks are autonomous networks, because they are distributed and self-organized. As a case study, we employ a specific application {\textendash} distributed trust management {\textendash} to understand and analyze the behavior and properties of these {\textquotedblleft}anarchical{\textquotedblright} autonomous networks. We propose a statistical trust evaluation rule, prove its convergence and investigate its characteristics when the system is at the steady state. Our investigation results in several conclusions for the design of trust evaluation rules, some of which are unexpected if we do not have the stationary distribution at hand. Our study shows the importance and necessity of applying theoretical analyses to understand the complex characteristics of distributed, self-organized, autonomous networks.},
	address = {Barcelona, Spain},
	booktitle = {Proceedings of the 25th IEEE Conference on Computer Communications (Infocom06)}
}
@conference {
	title = {Coalition Formation in MANET and Other Networks},
	author = {Jiang, Tao., Theodorakopoulos, George., Baras, John S.},
	year = {2006},
	month = {01/2006},
	abstract = {Wireless ad-hoc networks rely on the cooperation of participating nodes for almost all their functions. However, due to resource constraints, nodes are generally selfish and try to maximize their own benefit when participating in the network. Therefore, it is important to study mechanisms which can be used as incentives to form coalitions inside the network. In this paper, we study coalition formation based on game theory, especially cooperative game theory. First, the dynamics of coalition formation proceeds via pairwise bargaining. We show that the size of the maximum coalition is a decreasing function of the cost for establishing a link. After the coalition formation process reaches the steady state, we are interested in the stability of coalitions. We prove that coalitions are stable in terms of both pairwise stability and coalitional stability.},
	address = {Orlando, FL},
	booktitle = {25th Army Science Conference}
}
@conference {
	title = {Solving Optimal Neural Layout by Gibbs Sampling},
	author = {Jiang, Tao., Xu, Peng., Abshire, Pamela A., Baras, John S.},
	year = {2005},
	month = {07/2005},
	abstract = {Neural systems of organisms derive their functionality largely from the numerous and intricate connections between individual components. These connections are costly and have been refined via evolutionary pressure that acts to maximize their functionality while minimizing the associated cost. This tradeoff can be formulated as a constrained optimization problem. In this paper, we use simulated annealing, implemented through Gibbs sampling, to investigate the minimal cost placement of individual components in neural systems. We show that given the constraints and the presumed cost function associated with the neural interconnections, we can find the configuration corresponding to the minimal cost. We restrict the mechanisms considered to those involving incremental improvement through local interactions since real neural systems are likely to be subject to such constraints. By adjusting the cost function and comparing with the actual configuration in neural systems, we can infer the actual cost function associated with the connections used by nature. This provides a powerful tool to biologists for investigating the configurations of neural systems.},
	address = {Salt Lake City, Utah},
	booktitle = {8th Joint Conference on Information Sciences 2005 (JCIS 2005 in conjunction with the 7th International Conference on Computational Intelligence and Natural Computation 2005, CINC)},
	pages = {pp. 424-427}
}
@conference {
	title = {Cooperation, Trust and Games in Wireless Networks},
	author = {Baras, John S., Jiang, Tao.},
	year = {2005},
	month = {06/2005},
	abstract = {As an important concept in network security, trust is interpreted as a set of relations among agents participating in the network activities. Trust relations are based on the previous behavior of an agent within a protocol. Trust establishment in distributed and resource-constraint networks, such as mobile ad hoc networks (MANETs), sensor networks and ubiquitous computing systems, is much more difficult but more crucial than in traditional hierarchical architectures, such as the Internet and base station- or access point-centered wireless LANs. Generally, this type of distributed networks have neither pre-established infrastructures, nor centralized control servers or trusted third parties (TTP). The trust information or evidence used to evaluate trustworthiness is provided by peers, i.e. the agents that form the network. Furthermore, resources (power, bandwidth, computation etc.) are normally limited because of the wireless and ad hoc environment, so the trust evaluation procedure should only rely on local information. Schemes that depend only on local interaction also have the desired emergent property that enables fast reaction to network member changes, topology changes and security changes that frequently happen in mobile networks. Therefore, the essential and unique properties of trust management in this new paradigm of wireless networking, as opposed to traditional centralized approaches are: uncertainty and incompleteness of trust evidence, trust value is between -1 and 1; locality in trust information exchange; distributed computation.},
	address = {Berkeley, CA},
	booktitle = {.Symposium on Systems, Control and Networks}
}
@conference {
	title = {Autonomous Trust Establishment},
	author = {Jiang, Tao., Baras, John S.},
	year = {2005},
	month = {03/2005},
	abstract = {Trust establishment in networks is the essential foundation for follow-on security mechanisms, such as key management and secure transmission. In this paper, we concentrate on self-organized, distributed and resource-constraint networks which pose formidable challenges on trust establishment due to lack of infrastructure and centralized servers. We model our trust establishment strategy as a local voting scheme and discuss its long run behavior. More specifically, we investigate the dynamic evolution of trust within the network, i.e. how trust spreads among nodes, via analyzing its convergence behavior. By theoretical analysis based on graph theory, we also find the conditions under which trust spreads to a maximum set of nodes and parameters that speed up or slow down this transition.},
	address = {Lisbon, Portugal},
	booktitle = {2nd International Network Optimization Conference},
	pages = {pp. 1-8}
}
@conference {
	title = {Cooperative Games, Phase Transitions on Graphs and Distributed Trust in MANET},
	author = {Baras, John S., Jiang, Tao.},
	year = {2004},
	month = {12/2004},
	abstract = {Mobile ad-hoc networks (MANET) provide a relative new paradigm of wireless networking, which poses several formidable challenges for control, monitoring and management, due to the basically "infrastructureless" nature of these networks. Security is viewed in this paper as part of the control-operations-management functionality of MANET. An important and critical part of security is trust establishment and maintenance. We provide a description of distributed trust within the MANET framework that consists of two major components: (a) trust document distribution; and (b) distributed trust computation. Within (a) we summarize our earlier work on swarm-intelligence based trust document distribution schemes, including their major advantages as compared to other schemes as well as their performance. This paper is primarily addressing our new results within (b). Here we show that under a variety of schemes for distributed trust computation and establishment we have established strong connections with various components of the theory of random graphs. In this context we demonstrate how phase transitions (in this case they mean node transitions from nontrusted to trusted) can appear within a MANET. We link the existence and analysis of such phase transitions to dynamic cooperative games. We demonstrate that dynamic cooperative games provide a natural framework for analyzing several problems for MANET. We also demonstrate the fundamental influence of the topology of the MANET on these phase transitions. Finally we conclude with a preliminary description of results that describe the effects of mobility and topology change on these trust establishment schemes.},
	address = {Atlantis, Paradise Island, Bahamas},
	booktitle = {43rd IEEE Conference on Decision and Control,},
	pages = {pp. 93-98}
}
@conference {
	title = {Ant-based Adaptive Trust Evidence Distribution in MANET},
	author = {Jiang, Tao., Baras, John S.},
	year = {2004},
	month = {03/2004},
	abstract = {Due to the lack of infrastructure and vulnerability of wireless links, security in ad hoc networks is considered to be much more difficult than in traditional hierarchical networks. Building the trust relationship between entities is a fundamental problem in ad hoc networks, since the availability of servers, which distribute trust certificates, is not guaranteed. Furthermore, the existence of any trusted server might not be assumed either. Therefore, the commonly used key distribution center (KDC) and certification authority (CA) are not applicable in such highly autonomous environments. In this paper, we propose a scheme for the distribution of trust certificates, which is completely distributed and adaptive to mobility. Our scheme is based on the swarm intelligence paradigm, which has been used for routing both in wired and wireless networks. Our simulations in ns-2 show that it performs very well in ad hoc environments.},
	address = {Tokyo, Japan},
	booktitle = {2nd International Workshop on Mobile Distributed Computing, in conjunction with the International Conference on Distributed Computing Systems, MDC\&rsquo;04},
	pages = {pp. 588-593}
}
@article {
	title = {Trust Credentials Distribution in Automatic Networks},
	author = {Jiang, Tao., Baras, John S.},
	journal = {submitted to IEEE Transactions on Parallel and Distributed Systems}
}
