@article {CSI13, title = {Building Trust from Context Similarity Measures}, journal = {Computer Standards \& Interfaces, Special Issue on Security in Information Systems}, volume = {36}, year = {2014}, pages = {792-800}, publisher = {Elsevier}, abstract = {

\ Trust is an essential feature of any system where entities have to\ collaborate among them. Trust can assist entities making decisions\ about what is the best entity for establishing a certain collaboration.\ It would be desirable to simulate behaviour of users as in social environments\ where they tend to establish relationships or to trust users\ who have common interests or share some of their opinions, i.e., users\ who are similar to them to some extent. Thus, in this paper we first\ introduce the concept of context similarity among entities and from it\ we derive a similarity network which can be seen as a graph. Based\ on this similarity network we dene a trust model that allows us also\ to establish trust along a path of entities. A possible applications of\ our model are proximity-based trust establishment. We validate our model in this scenario.

}, issn = {0920-5489}, doi = {10.1016/j.csi.2013.12.012}, author = {Carmen Fernandez-Gago and Isaac Agudo and Javier Lopez} } @inproceedings {moyano2013ifiptm, title = {Towards Trust-Aware and Self-Adaptive Systems}, booktitle = {7th IFIP WG 11.11 International Conference on Trust Management (IFIPTM 2013)}, series = {AICT}, volume = {401}, year = {2013}, month = {Jun 2013}, pages = {255-262}, publisher = {Springer}, organization = {Springer}, address = {Malaga}, abstract = {

The Future Internet (FI) comprises scenarios where many heterogeneous and dynamic entities must interact to provide services (e.g., sensors, mobile devices and information systems in smart city scenarios). The dynamic conditions under which FI applications must execute call for self-adaptive software to cope with unforeseeable changes in the application environment. Software engineering currently provides frameworks to develop reasoning engines that automatically take reconfiguration decisions and that support the runtime adaptation of distributed, heterogeneous applications. However, these frameworks have very limited support to address security concerns of these application, hindering their usage for FI scenarios. We address this challenge by enhancing self-adaptive systems with the concepts of trust and reputation. Trust will improve decision-making processes under risk and uncertainty, in turn improving security of self-adaptive FI applications. This paper presents an approach that includes a trust and reputation framework into a platform for adaptive, distributed component-based systems, thus providing software components with new abilities to include trust in their reasoning process.

}, isbn = {978-3-642-38323-6}, issn = {1868-4238}, doi = {10.1007/978-3-642-38323-6}, author = {Francisco Moyano and Benoit Baudry and Javier Lopez}, editor = {Carmen Fernandez-Gago and Isaac Agudo and Fabio Martinelli and Siani Pearson} } @proceedings {ifiptm13, title = {Trust Management VII, 7th WG11.11 International conference}, volume = {401}, year = {2013}, month = {June 2013}, publisher = {Springer}, address = {Malaga (Spain)}, isbn = {978-3-642-38323-6}, editor = {Carmen Fernandez-Gago and Fabio Martinelli and Siani Pearson and Isaac Agudo} } @inproceedings {Moyano_ESSoS12, title = {A Task Ordering Approach for Automatic Trust Establishment}, booktitle = {Proceedings of the 2012 International Symposium on Engineering Secure Software and Systems (ESSoS 2012)}, series = {LNCS}, volume = {7159}, year = {2012}, month = {Feb 2012}, pages = {76{\textendash}89}, publisher = {Springer}, organization = {Springer}, address = {Eindhoven, The Netherlands}, abstract = {

Trust has become essential in computer science as a way of assisting the process of decision-making, such as access control. In any system, several tasks may be performed, and each of these tasks might pose different associated trust values between the entities of the system. For instance, in a file system, reading and overwriting a file are two tasks that pose different trust values between the users who can carry out these tasks. In this paper, we propose a simple model for automatically establishing trust relationships between entities considering an established order among tasks.

}, keywords = {task ordering, trust evaluation, trust graph}, doi = {10.1007/978-3-642-28166-2_8}, author = {Francisco Moyano and Carmen Fernandez-Gago and Isaac Agudo and Javier Lopez}, editor = {Gilles Barthe and Ben Livshits and Riccardo Scandariato} } @article {Alcaraz2011, title = {An Early Warning System based on Reputation for Energy Control Systems}, journal = {IEEE Transactions on Smart Grid}, volume = {2}, number = {4}, year = {2011}, month = {Nov 2011}, pages = {827-834}, publisher = {IEEE}, abstract = {

Most of energy control or SCADA (Supervisory Control and Data Acquisition) systems are very dependent on advanced technologies and on traditional security mechanisms for protecting the a system against anomalous events. Security mechanisms are not enough to be used in critical systems, since they can only detect anomalous events occurring at a certain moment in time. For this reason it becomes of paramount importance the usage of intelligent systems with capability for preventing anomalous situations and reacting against them on time. This type of systems are, for example, Early Warning Systems (EWS). In this paper, we propose an EWS based on Wireless Sensor Networks (WSNs) (under the ISA100.11a standard) and reputation for controling the network behaviour. The WSN are organized into clusters where a Cluster Head (CH) is designated. This CH will contain a Reputation Manager Module. The usability of this approach is also analyzed considering a Smart Grid scenario.} keywords = {Critical Information Infrastructures, Sensor Networks, Early Warning Systems, Reputation, SCADA Systems, Smart Grid.

}, keywords = {Early Warning Systems, Reputation, SCADA Systems, Smart Grid, wireless sensor networks}, issn = {1949-3053}, doi = {10.1109/TSG.2011.2161498}, author = {Cristina Alcaraz and Carmen Fernandez-Gago and Javier Lopez} } @article {Agudo2010b, title = {A Scale Based Trust Model for Multi-Context Environments}, journal = {Computers and Mathematics with Applications}, volume = {60}, year = {2010}, month = {July}, pages = {209-216}, publisher = {Elsevier}, abstract = {

When interactions among users of a system have to take place, for example, over the internet, establishing trust relationships among these users becomes crucial. However, the way this trust is established depends to a certain extent on the context where the interactions take place. Most of the time, trust is encoded as a numerical value that might not be very meaningful for a not very experienced user. In this paper we propose a model that takes into account the semantic and the computational sides of trust. This avoids users having to deal directly with the computational side; they instead deal with meaningful labels such as Bad or Good in a given context.

}, issn = {0898-1221}, doi = {10.1016/j.camwa.2010.02.009}, author = {Isaac Agudo and Carmen Fernandez-Gago and Javier Lopez} } @article {JavierLopezMunoz2010, title = {Trust Management Systems for Wireless Sensor Networks: Best practices}, journal = {Computer Communications}, volume = {33}, number = {9}, year = {2010}, pages = {0140-3664}, publisher = {Elsevier}, abstract = {

Wireless sensor networks (WSNs) have been proven a useful technology for perceiving information about the physical world and as a consequence has been used in many applications such as measurement of temperature, radiation, flow of liquids, etc. The nature of this kind of technology, and also their vulnerabilities to attacks make the security tools required for them to be considered in a special way. The decision making in a WSN is essential for carrying out certain tasks as it aids sensors establish collaborations. In order to assist this process, trust management systems could play a relevant role. In this paper, we list the best practices that we consider are essential for developing a good trust management system for WSN and make an analysis of the state of the art related to these practices.

}, issn = {0140-3664}, doi = {10.1016/j.comcom.2010.02.006}, author = {Javier Lopez and Rodrigo Roman and Isaac Agudo and Carmen Fernandez-Gago} } @inproceedings {Alcaraz2009, title = {Adaptive Dispatching of Incidences Based on Reputation for SCADA Systems}, booktitle = {6th International Conference on Trust, Privacy and Security in Digital Business (TrustBus{\textquoteright}09)}, series = {LNCS}, year = {2009}, month = {September}, pages = {86-94}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Linz, Austria}, abstract = {

SCADA systems represent a challenging scenario where the management of critical alarms is crucial. Their response to these alarms should be efficient and fast in order to mitigate or contain undesired effects. This work presents a mechanism, the Adaptive Assignment Manager (AAM) that will aid to react to incidences in a more efficient way by dynamically assigning alarms to the most suitable human operator. The mechanism uses various inputs for identifying the operators such as their availability, workload and reputation. In fact, we also define a reputation component that stores the reputation of the human operators and uses feedback from past experiences.

}, keywords = {Critical Control Systems, Reputation, Supervisory Control and Data Acquisition Systems}, isbn = {978-3-642-03747-4}, doi = {10.1007/978-3-642-03748-1_9}, author = {Cristina Alcaraz and Isaac Agudo and Carmen Fernandez-Gago and Rodrigo Roman and Gerardo Fernandez and Javier Lopez} } @article {Agudo2009, title = {Concurrent access control for multi-user and multi-processor systems based on trust relationships}, journal = {Concurrency and Computation: Practice and Experience}, volume = {21}, year = {2009}, month = {July}, pages = {1389-1403}, publisher = {John Wiley \& Sons}, abstract = {

Concurrent access control is an old problem in many fields in Computer Science. It has been solved in many languages and systems, using mechanisms like monitors or priority queues. Nowadays computers implement multi-core capabilities. This means that they are virtually capable of execution of processes in parallel. This requires new techniques and open new issues in the field of concurrent access control. Moreover, most operating systems are multi-user; thus, we have to focus on a multi-processor multi-user scenario. Trust becomes a paramount aspect when building distributed applications; the same applies on a lower scale in modern computers. We propose the use of a trust graph that keeps record of the trust relationships of the system and helps in deciding on concurrent access requests. The information encoded in the graph will be used both in order to decide on the access requests and to order granted requests in terms of their associated trust level

}, issn = {1532-0626}, doi = {10.1002/cpe.1430}, author = {Isaac Agudo and Carmen Fernandez-Gago and Javier Lopez} } @inproceedings {Agudo2009a, title = {A Multidimensional Reputation Scheme for Identity Federations}, booktitle = {Sixth European Workshop on Public Key Services, Applications and Infrastructures (EuroPKI{\textquoteright}09)}, series = {LNCS}, volume = {6391}, year = {2009}, pages = {225-238}, publisher = {Springer}, organization = {Springer}, abstract = {

Deciding who to trust in the internet of services paradigm is an important and open question. How to do it in an optimal way is not always easy to determine. Trust is usually referred to a particular context whereas a single user may interact in more than one given context. We are interested in investigating how a Federated Reputation System can help exporting trust perceptions from one context to another. We propose a model for deriving trust in online services. In this context, trust is defined as the level of confidence that the service provider holds on the subject interacting with it to behave in a proper way while using the service. Thus, we derive trust by using the reputation values that those users have gained for interacting with these services.

}, isbn = {978-3-642-16440-8}, issn = {0302-9743 (Print) 1611-3349 (Online)}, doi = {10.1007/978-3-642-16441-5_15}, author = {Isaac Agudo and Carmen Fernandez-Gago and Javier Lopez} } @inproceedings {Agudo2008, title = {Delegating Privileges over Finite Resources: A Quota Based Delegation Approach}, booktitle = {5th International Workshop on Formal Aspects in Security and Trust (FAST{\textquoteright}08)}, series = {LNCS}, volume = {5491}, year = {2008}, pages = {302-315}, publisher = {Springer}, organization = {Springer}, address = {Malaga (Spain)}, abstract = {

When delegation in real world scenarios is considered, the delegator (the entity that posses the privileges) usually passes the privileges on to the delegatee (the entity that receives the privileges) in such a way that the former looses these privileges while the delegation is effective. If we think of a physical key that opens a door, the privilege being delegated by the owner of the key is opening the door. Once the owner of the key delegates this privilege to another entity, by handing over the key, he is not able to open the door any longer. This is due to the fact that the key is not copied and handed over but handed over to the delegatee. When delegation takes place in the electronic world, the delegator usually retains also the privileges. Thus, both users have them simultaneously. This situation, which in most cases is not a problem, may be undesirable when dealing with certain kind of resources. In particular, if we think of finite resources, those in which the number of users accessing simultaneously is finite, we can not allow that a user delegating his access privilege is also granted access when the delegation if effective. In this paper we propose an approach where each user is delegated an access quota for a resource. If further delegating of the delegated quota occurs, this is subtracted from his quota. That is, when delegating, part of the quota remains with the delegator and another part goes to the delegatee. This allows a more fairly access to the resource. Moreover, we show that this approach can also be applied to any kind of resources by defining appropriate authorization policies.

}, isbn = {978-3-642-01464-2}, issn = {0302-9743 (Print) 1611-3349 (Online)}, doi = {10.1007/978-3-642-01465-9}, author = {Isaac Agudo and Carmen Fernandez-Gago and Javier Lopez} } @inproceedings {Agudo2008a, title = {A Model for Trust Metrics Analysis}, booktitle = {5th International Conference on Trust, Privacy and Security in Digital Business (TrustBus{\textquoteright}08)}, series = {LNCS}, volume = {5185}, year = {2008}, pages = {28-37}, publisher = {Springer}, organization = {Springer}, abstract = {

Trust is an important factor in any kind of network essential, for example, in the decision-making process. As important as the definition of trust is the way to compute it. In this paper we propose a model for defining trust based on graph theory and show examples of some simple operators and functions that will allow us to compute trust.

}, isbn = {978-3-540-85734-1}, issn = {0302-9743 (Print) 1611-3349 (Online)}, doi = {10.1007/978-3-540-85735-8_4}, author = {Isaac Agudo and Carmen Fernandez-Gago and Javier Lopez} } @inproceedings {IsaacAgudo2005b, title = {A Representation Model of Trust Relationships with Delegation Extensions}, booktitle = {3th International Conference on Trust Management (iTRUST{\textquoteright}05)}, series = {LNCS}, volume = {3477}, year = {2005}, month = {May}, pages = {9-22}, publisher = {Springer}, organization = {Springer}, address = {Versailles, France}, abstract = {

Logic languages establish a formal framework to solve authorization and delegation conflicts. However, we consider that a visual representation is necessary since graphs are more expressive and understandable than logic languages. In this paper, and after overviewing previous works using logic languages, we present a proposal for graph representation of authorization and delegation statements. Our proposal is based on Varadharajan et al. solution, though improve several elements of that work. We also discuss about the possible implementation of our proposal using attribute certificates.

}, isbn = {978-3-540-26042-4}, issn = {0302-9743 (Print) 1611-3349 (Online)}, doi = {10.1007/11429760_9}, author = {Isaac Agudo and Javier Lopez and Jose A. Montenegro} }