Recipients' Anonymity in Multihop Ad-hoc Networks

Multihop ad-hoc networks have a dynamic topology. Retrieving a route towards a remote peer requires the execution of a recipient lookup, which can publicly reveal sensitive information about him. Within this context, we propose an efficient, practical and scalable solution to guaranteethe anonymity of recipients' nodes in ad-hoc networks.

An Improved Hybrid Model for the Generic Hoist Scheduling Problem

Peer-reviewed

Anonymous Routing Protocol in decentralized networks

Peer-reviewed

JXTAnonym: An anonymity layer for JXTA services messaging

With the evolution of the P2P research eld, new problems, such as those related with information security, have arisen. It is important to provide security mechanisms to P2P systems, since it has already become one of the key issues when evaluating them. However, even though many P2P systems have been adapted to provide a security baseline to their underlying applications, more advanced capabilities are becoming necessary. Speci cally, privacy preservation and anonymity are deemed essential to make the information society sustainable. Unfortunately, sometimes, it may be di cult to attain anonymity unless it is included into the system's initial design. The JXTA open protocols speci cation is a good example of this kind of scenario. This work studies how to provide anonymity to JXTA's architecture in a feasible manner and proposes an extension which allows deployed services to process two-way messaging without disclosing the endpoints'identities to third parties.

Versatile iPad forensic acquisition using the Apple Camera Connection Kit

Peer reviewed

Towards secure mobile P2P applications using JXME

Mobile devices have become ubiquitous, allowing the integration of new information from a large range of devices. However, the development of new applications requires a powerful framework which simplifies their construction. JXME is the JXTA implementation for mobile devices using J2ME, its main value being its simplicity when creating peer-to-peer (P2P) applications on limited devices. On that regard, an issue that is becoming veryimportant in the recent times is being able to provide a security baseline to such applications. This paper analyzes the currentstate of security in JXME and proposes a simple security mechanism in order to protect JXME applications against a broad range of vulnerabilities.

A novel semi-fragile forensic watermarking scheme for remote sensing images

Peer-reviewed

High capacity FFT-based audio watermarking

Peer-reviewed

Steganalytic Methods for the Detection of Histogram Shifting Data Hiding Schemes

Peer-reviewed

Protecting mobile agents from external replay attacks

Peer-reviewed

Algoritmos genéticos para la anonimización de grafos

Peer-reviewed

High capacity robust audio watermarking scheme based on FFT and linear regression

Peer-reviewed

Threading libraries performance when applied to image acquisition and processing in a forensic application

Peer-reviewed

A survey on automatic recommenders in the context of institutional repositories

Peer-reviewed

Aproximación al reajuste automático de centroides mediante la heurística de Lloyd para resolver el problema de las K-Medias

Peer-reviewed