There is still no consistent definition of general ad hoc network properties. All introduced protocols for ad hoc networks are based on different assumptions and security requirements, and are consequently suited for specific applications only. Due to the broad field of applications, a general security model can still not be found in any literature. We define two ad hoc network categories, name...

Our team submitted runs for the TREC KBA Cumulative Citation Recommendation task. This task involves labeling over 300 million documents for whether they are relevant and/or central to particular entities already in a database. For this task, we used an SVM classifier that uses unigrams and named entities as binary features. In this paper, we describe our work for the 2012 evaluation and the re...

DyTR is an approach to trust that goes beyond traditional authentication-based techniques, in which the trustworthiness of entities in a system adapts over time based on system events. Using a socio-cognitive model of trust, DyTR provides an adaptive trustassessment methodology that allocates resources dynamically to an initial level of credentials, continually assesses trust, and adaptively al...

Authenticated group key agreement problem is important in many modern collaborative and distributed applications. Recently, there are two ID-based authenticated group key agreement schemes have been proposed, one is Choi et al.’s [2] scheme, the other is Du et al.’s [3] scheme. They are all constructed from bilinear pairings based on Burmester and Desmedt scheme [1]. In this paper, we propose a...

In Internet of Things (IoT), cryptography-based security services are widely used to mitigate threats. However, establishing cryptographic keys between entities in dynamic IoTs is a challenging issue, due the high mobility these entities. They may not have established secrets prior key establishment, and establishment has be finished limited time. Existing solutions either rely on having secret...

Distance bounding protocols can be employed in mutual entity authentication schemes to determine an upper bound on the distance to another entity. As these protocols are conducted over noisy wireless adhoc channels, they should be designed to cope well with substantial bit error rates during the rapid single bit exchanges. This paper investigates the robustness to high bit error rates of two im...

Robust electronic authentication capable of reliably identifying remote entities (human users or software components) with a certain level of assurance in authentication strength is an important prerequisite to facilitate effective user authorisation and fine-grained access control in distributed systems. In a Federated Access Management environment, users are referred back to their home or aff...

This paper presents the results of a study performed over phishing threats and vulnerabilities present in nowadays authentication environments. The main goal of this paper is to present our solution, the anti-phishing model which can be applied to any web environment, and not just to e-banking or the financial sector, without limitations nor additional requirements. We start presenting a brief ...

This paper addresses the development of trust in the use of Open Data through incorporation of appropriate authentication and integrity parameters for use by end user Open Data application developers in an architecture for trustworthy Open Data Services.The advantages of this architecture scheme is that it is far more scalable, not another certificate authority hierarchy with massive dispersion...

The subject of this paper is the authentication services as found in the Kuperee3 server. The authentication protocol is based on the Zheng-Seberry public key cryptosystem, and makes use of the distinct features of the cryptosystem. Although couched in the terminology of Kerberos, the protocol has subtle features, such as the binding together of two entities by a third entity, leading to the ne...