Díaz-Sánchez, Daniel; Marín-López, Andrés; Almenárez-Mendoza, Florina; Campo-Vázquez, Celeste; García-Rubio, Carlos Context awareness in network selection for dynamic environments Journal Article In: Telecommunication Systems, vol. 36, iss. 1, pp. 49-60, 2007, ISSN: 1572-9451. Abstract | Links | BibTeX | Tags: Context-awareness, everyware, Mobile devices, Network selection, Pervasive computing, Sistema tele-educacion integrado Marín-López, Andrés; Díaz-Sánchez, Daniel; Almenárez, Florina; García-Rubio, Carlos; Campo, Celeste Smart card-based agents for fair non-repudiation Journal Article In: COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, vol. 51, iss. 9, pp. 2288-2298, 2007, ISSN: 0346-251X. Abstract | Links | BibTeX | Tags: Ad hoc mode, Electronic transactions, everyware, Fairness, Non-repudiation protocol, Smart Card, Unreliable channels Campo, Celeste; Almenárez, Florina; Díaz, Daniel; García-Rubio, Carlos; Marín-López, Andrés Secure Service Discovery based on Trust Management for ad-hoc Networks Journal Article In: Journal of Universal Computer Science, vol. 12, no. 3, pp. 340-356, 2006, ISSN: 0948-695X. Abstract | Links | BibTeX | Tags: ad-hoc networks, everyware, iteaeasywireless, Security, service discovery protocol, trust, Ubisec Almenarez, Florina; Díaz, Daniel; Marín, Andrés Secure Ad-Hoc mBusiness: Enhancing WindowsCE Security Journal Article In: Lecture Notes In Computer Sciences, vol. 3184, pp. 90-99, 2004, ISSN: 0302-9743. Abstract | Links | BibTeX | Tags: EasyWireless, everyware, Mutual Authentication, Smart Card, Trust Degree, Trust Relationship, Trusted Third Party, Ubisec2007
@article{diazsanchez003,
title = {Context awareness in network selection for dynamic environments},
author = {Daniel Díaz-Sánchez and Andrés Marín-López and Florina Almenárez-Mendoza and Celeste Campo-Vázquez and Carlos García-Rubio },
url = {https://link.springer.com/article/10.1007/s11235-007-9058-9},
doi = {https://doi.org/10.1007/s11235-007-9058-9},
issn = {1572-9451},
year = {2007},
date = {2007-11-17},
urldate = {2007-11-17},
journal = {Telecommunication Systems},
volume = {36},
issue = {1},
pages = {49-60},
abstract = {Mobile devices of new generation are able to connect to multiple networks and to constitute new infrastructureless networks. These dynamic environments require new security paradigms and automatic mechanisms to minimize user intervention. Our goal is the definition of a new concept of distance that considers the current domain constraints and the user preferences. This paper addresses some of the problems of these complex environments by using Multidimensional Scaling (MDS) techniques. We also propose collaborative mechanisms for automatic environment marking. Based on these ideas we have developed Pervasive Interaction Manager (PervsIM), a decision mechanism that selects the most appropriate network or peer to interact with. Besides we have defined an embedded access control module which ensures that PervsIM decisions are followed by all applications. Furthermore, several simulation results and implementation details outline how these results can be incorporated in today’s mobile devices.},
keywords = {Context-awareness, everyware, Mobile devices, Network selection, Pervasive computing, Sistema tele-educacion integrado},
pubstate = {published},
tppubtype = {article}
}
@article{marin003,
title = {Smart card-based agents for fair non-repudiation},
author = {Andrés Marín-López and Daniel Díaz-Sánchez and Florina Almenárez and Carlos García-Rubio and Celeste Campo},
url = {https://www.sciencedirect.com/science/article/pii/S1389128607000278?via%3Dihub
https://www.sciencedirect.com/science/article/pii/S1389128607000278/pdfft?md5=96ecfc2c235f0f03fd85b40c499ffdad&pid=1-s2.0-S1389128607000278-main.pdf},
doi = {https://doi.org/10.1016/j.comnet.2007.01.014},
issn = {0346-251X},
year = {2007},
date = {2007-01-31},
urldate = {2007-01-31},
journal = {COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING},
volume = {51},
issue = {9},
pages = {2288-2298},
abstract = {Non-repudiation protocols are of great importance for electronic interactions. Different protocols have been proposed in this field, progressively relaxing the requirements on the computing power of both parties, and on the load and involvement of a trusted third party (TTP). Besides, there is a need to provide mobile users with a protocol adequate for ad hoc scenarios, where only unreliable channels can be guaranteed, and where the CA may not be reachable. In this paper we propose a new version of the fair non-repudiation protocol proposed by Gürgens et al. in [Sigrid Gürgens, Carsten Rudolph, Holger Vogt, On the security of fair non-repudiation protocols, in: Colin Boyd, Wenbo Mao (Eds.), ISC, Lecture Notes in Computer Science, vol. 2851, Springer, 2003, pp. 193–207]. We show unfair scenarios that can appear if one party controls the communication among the TTP and the other party. We introduce notary agents, which play the TTP role, and run our fair non-repudiation protocol. Notary agents execute inside the smart card, and sign the protocol messages with the user’s private key on his behalf. Our approach enables the protocol to run on unreliable channels, disconnected from the CA.},
keywords = {Ad hoc mode, Electronic transactions, everyware, Fairness, Non-repudiation protocol, Smart Card, Unreliable channels},
pubstate = {published},
tppubtype = {article}
}
2006
@article{campo001,
title = {Secure Service Discovery based on Trust Management for ad-hoc Networks},
author = {Celeste Campo and Florina Almenárez and Daniel Díaz and Carlos García-Rubio and Andrés Marín-López},
url = {https://www.jucs.org/jucs_12_3/secure_service_discovery_based.html
https://lib.jucs.org/article/28594/},
doi = {http://dx.doi.org/10.3217/jucs-012-03-0340},
issn = {0948-695X},
year = {2006},
date = {2006-03-28},
urldate = {2006-03-28},
journal = {Journal of Universal Computer Science},
volume = {12},
number = {3},
pages = {340-356},
abstract = {In ad-hoc networks, mobile devices communicate via wireless links without the aid of any fixed networking infrastructure. These devices must be able to
discover services dynamically and share them safely, taking into account ad-hoc networks requirements such as limited processing and communication power, decentralised
management, and dynamic network topology, among others. Legacy solutions fail in
addressing these requirements.
In this paper, we propose a service discovery protocol with security features, the Secure
Pervasive Discovery Protocol. SPDP is a fully distributed protocol in which services
offered by devices can be discovered by others, without a central server. It is based on an
anarchy trust model, which provides location of trusted services, as well as protection
of confidential information, secure communications, or access control.},
keywords = {ad-hoc networks, everyware, iteaeasywireless, Security, service discovery protocol, trust, Ubisec},
pubstate = {published},
tppubtype = {article}
}
discover services dynamically and share them safely, taking into account ad-hoc networks requirements such as limited processing and communication power, decentralised
management, and dynamic network topology, among others. Legacy solutions fail in
addressing these requirements.
In this paper, we propose a service discovery protocol with security features, the Secure
Pervasive Discovery Protocol. SPDP is a fully distributed protocol in which services
offered by devices can be discovered by others, without a central server. It is based on an
anarchy trust model, which provides location of trusted services, as well as protection
of confidential information, secure communications, or access control.2004
@article{10.1007/978-3-540-30079-3_10,
title = {Secure Ad-Hoc mBusiness: Enhancing WindowsCE Security},
author = {Florina Almenarez and Daniel Díaz and Andrés Marín},
editor = {Sokratis Katsikas and Javier Lopez and Günther Pernul},
url = {https://link.springer.com/chapter/10.1007/978-3-540-30079-3_10
https://doi.org/10.1007/978-3-540-30079-3_10},
doi = {10.1007/978-3-540-30079-3_10},
issn = {0302-9743},
year = {2004},
date = {2004-01-01},
urldate = {2004-01-01},
journal = {Lecture Notes In Computer Sciences},
volume = {3184},
pages = {90-99},
publisher = {Springer Berlin Heidelberg},
address = {Berlin, Heidelberg},
abstract = {Nowadays we can perform business transactions with remote servers interconnected to Internet using our personal devices. These transactions can also be possible without any infrastructure in pure ad-hoc networks. In both cases, interacting parts are often unknown, therefore, they require some mechanism to establish ad-hoc trust relationships and perform secure transactions. Operating systems for mobile platforms support secure communication and authentication, but this support is based on hierarchical PKI. For wireless communications, they use the (in)secure protocol WEP. This paper presents a WCE security enhanced architecture allowing secure transactions, mutual authentication, and access control based on dynamic management of the trusted certificate list. We have successfully implemented our own CSP to support the new certificate management and data ciphering.},
keywords = {EasyWireless, everyware, Mutual Authentication, Smart Card, Trust Degree, Trust Relationship, Trusted Third Party, Ubisec},
pubstate = {published},
tppubtype = {article}
}
Publications
Context awareness in network selection for dynamic environments Journal Article In: Telecommunication Systems, vol. 36, iss. 1, pp. 49-60, 2007, ISSN: 1572-9451. Smart card-based agents for fair non-repudiation Journal Article In: COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, vol. 51, iss. 9, pp. 2288-2298, 2007, ISSN: 0346-251X. Secure Service Discovery based on Trust Management for ad-hoc Networks Journal Article In: Journal of Universal Computer Science, vol. 12, no. 3, pp. 340-356, 2006, ISSN: 0948-695X. Secure Ad-Hoc mBusiness: Enhancing WindowsCE Security Journal Article In: Lecture Notes In Computer Sciences, vol. 3184, pp. 90-99, 2004, ISSN: 0302-9743.2007
2006
2004