Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 17
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A fair and secure cluster formation process for Ad hoc networks

  • Rifa Pous, Helena
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
An efficient approach for organizing large ad hoc networks is to divide the nodes into multiple clusters and designate, for each cluster, a clusterhead which is responsible for holding intercluster control information. The role of a clusterhead entails rights and duties. On the one hand, it has a dominant position in front of the others because it manages the connectivity and has access to other node's sensitive information. But on the other hand, the clusterhead role also has some associated costs. Hence, in order to prevent malicious nodes from taking control of the group in a fraudulent way and avoid selfish attacks from suitable nodes, the clusterhead needs to be elected in a secure way. In this paper we present a novel solution that guarantees the clusterhead is elected in a cheat-proof manner.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

J3Gen: a PRNG for low-cost passive RFID

  • Melià Seguí, Joan
  • Garcia-Alfaro, Joaquin
  • Herrera-Joancomartí, Jordi
Pseudorandom number generation (PRNG) is the main security tool in low-cost passive radio-frequency identification (RFID) technologies, such as EPC Gen2. We present a lightweight PRNG design for low-cost passive RFID tags, named J3Gen. J3Gen is based on a linear feedback shift register (LFSR) configured with multiple feedback polynomials. The polynomials are alternated during the generation of sequences via a physical source of randomness. J3Gen successfully handles the inherent linearity of LFSR based PRNGs and satisfies the statistical requirements imposed by the EPC Gen2 standard. A hardware implementation of J3Gen is presented and evaluated with regard to different design parameters, defining the key-equivalence security and nonlinearity of the design. The results of a SPICE simulation confirm the power-consumption suitability of the proposal., The authors would like to thank Josep Domingo-Ferrer, Miquel Soriano and David Megías for their helpful comments during the realization of this work. The authors thank as well the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper. This work was partly funded by the Spanish Government through projects TSI2007-65406-C03-03 E-AEGIS, TIN2011-27076-C03-02 CO-PRIVACY, CONSOLIDER INGENIO 2010 CSD2007-0004 ARES, and TIN2010-15764 N-KHRONOUS.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

On the computational security of a distributed key distribution scheme

  • Daza, Vanesa
  • Herranz, Javier
  • Sáez, Germán
In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss., The work of the first two authors was partially supported by the Spanish Ministry of Education and Science under Projects TSI2007-65406-C03-02 (“eAEGIS”) and CONSOLIDER CSD2007-00004 (“ARES”). The work of V. Daza was also supported by the Government of Catalonia under Grant 2005-SGR-00446. The work of J. Herranz was also supported by the Government of Catalonia under Grant 2005-SGR-00093. Finally, the work of G. Sáez was partially supported by the/nSpanish Ministry of Education and Science under Project TSI2006-02731.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Data privacy for simply anonymized network logs represented as graphs-considerations for graph alteration operations

  • Nettleton, David F.
  • Torra, Vicenç
In this paper we review the state of the art on graph privacy with special emphasis on applications to online social networks, and we consider some novel aspects which have not been greatly covered in the specialized literature on graph privacy. The following key considerations are covered: (i) choice of different operators to modify the graph; (ii) information loss based on the cost of graph operations in terms of statistical characteristics (degree, clustering coefficient and path length) in the original graph; (iii) computational cost of the operations; (iv) in the case of the aggregation of two nodes, the choice of similar adjacent nodes rather than isomorphic topologies, in order to maintain the overall structure of the graph; (v) a statistically knowledgeable attacker who is able to search for regions of a simply anonymized graph based on statistical characteristics and map those onto a given node and its immediate neighborhood., This research is partially supported by the Spanish MEC (projects ARES CONSOLIDER INGENIO 2010 CSD2007-00004 -- eAEGIS TSI2007-65406-C03-02).
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Evaluación del rendimiento de una solución de cupones electrónicos para dispositivos móviles

  • Isern-Deyà, Andreu Pere
  • Hinarejos, M. Francisca
  • Ferrer-Gomila, Josep Lluís
El comercio electrónico móvil (m-commerce) representa ya una importante área de negocio con grandes oportunidades para consumidores y comerciantes. Sin embargo, todavía existen escenarios que requieren mejoras en cuanto a eficiencia, como son los cupones electrónicos. La eficiencia y el rendimiento de estas soluciones suele medirse únicamente considerando el coste de las operaciones criptográficas o realizando pruebas de laboratorio en entornos limitados, muchas veces una única máquina para ejecutar todo el escenario de pruebas (incluyendo consumidores y comerciantes). En este artículo presentamos un análisis del rendimiento de una solución de cupones electrónicos, mediante la cual comprobamos que no es suficiente analizar únicamente la carga debido a las operaciones criptográficas, sino que también deben considerarse otros factores, como el efecto de la red.
RUA. Repositorio Institucional de la Universidad de Alicante
Publication Otros (Other)

Herramienta para la compensación de parámetros de QoS y seguridad

  • Nieto, Ana
  • López, Javier
El análisis conjunto de mecanismos de seguridad y QoS es esencial para las redes heterogéneas donde diversos dispositivos pueden coexistir en entornos dinámicos. En concreto, los dispositivos no siempre pueden ser conocidos, por lo que diferentes requisitos y mecanismos pueden surgir para el análisis. En este artículo, proponemos una herramienta para facilitar la configuración de entornos basada en el análisis paramétrico de dependencias, tomando como base de conocimiento un conjunto de parámetros de seguridad y QoS. Esta forma de análisis de parámetros a alto nivel permite considerar las dependencias y la compensación entre mecanismos con independencia del sistema de información subyacente. Posibilita por tanto evaluar el impacto que tales mecanismos, y otros definidos acorde al modelo, tienen sobre un sistema previo a su despliegue.
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

EPA: An efficient and privacy-aware revocation mechanism for vehicular ad hoc networks

  • Hernández Gañan, Carlos
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
  • Esparza Martín, Óscar|||0000-0002-2593-0162
  • Mata Diaz, Jorge|||0000-0003-4831-0588
  • Alins Delgado, Juan José|||0000-0001-8214-4056
Security is vital for the reliable operation of vehicular ad hoc networks (VANETs). One of the critical security issues is the revocation of misbehaving vehicles. While essential, revocation checking can leak private information. In particular, repositories receiving the certificate status queries could infer the identity of the vehicles posing the query and the target of the query. An important loss of privacy results from this ability to tie the checking vehicle with the query's target, due to their likely willingness to communicate. In this paper, we propose an Efficient and Privacy-Aware revocation Mechanism (EPA) based on the use of Merkle Hash Trees (MHT) and a Crowds-based anonymous protocol, which replaces the time-consuming certificate revocation lists checking process. EPA provides explicit, concise, authenticated and unforgeable information about the revocation status of each certificate while preserving the users' privacy. Moreover, EPA reduces the security overhead for certificate status checking, and enhances the availability and usability of the revocation data. By conducting a detailed performance evaluation, EPA is demonstrated to be reliable, efficient, and scalable., Peer Reviewed
O2, repositorio institucional de la UOC
Publication Artículo científico (JournalArticle)

A Forwarding Cooperation Protocol for Plain and Cluster-based Ad Hoc Networks

  • Rifà-Pous, Helena
  • Herrera-Joancomartí, Jordi
In ad hoc networks, due to the lack of a dedicated network infrastructure, members have to collaborate ones with the others to support the basic networking functions that allow them to communicate. The main challenge of this model is combating the intrinsic selfish behavior of the participants, which are usually equipped with handheld and mobile devices with limited resources. In this paper, a forwarding protocol is presented that stimulates the cooperation through a mechanism that combines both credit and reputation-based solutions. A mi-cropayment protocol is used to charge and reward the applier and forwarders of a transmission respectively. The credits obtained for collaboration not only are a mean to pay for network services, but are a symbol of the cooperative range of a node. Using this information, the presented model benefits most cooperative nodes with preferential transmission channels and a higher quality of service. The model is suited for plain and cluster-based ad hoc networks.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Data privacy for simply anonymized network logs represented as graphs-considerations for graph alteration operations

  • Nettleton, David F.
  • Torra, Vicenç
In this paper we review the state of the art on graph privacy with special emphasis on applications to online social networks, and we consider some novel aspects which have not been greatly covered in the specialized literature on graph privacy. The following key considerations are covered: (i) choice of different operators to modify the graph; (ii) information loss based on the cost of graph operations in terms of statistical characteristics (degree, clustering coefficient and path length) in the original graph; (iii) computational cost of the operations; (iv) in the case of the aggregation of two nodes, the choice of similar adjacent nodes rather than isomorphic topologies, in order to maintain the overall structure of the graph; (v) a statistically knowledgeable attacker who is able to search for regions of a simply anonymized graph based on statistical characteristics and map those onto a given node and its immediate neighborhood., This research is partially supported by the Spanish MEC (projects ARES CONSOLIDER INGENIO 2010 CSD2007-00004 -- eAEGIS TSI2007-65406-C03-02).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

EPA: An efficient and privacy-aware revocation mechanism for vehicular ad hoc networks

  • Hernández Gañan, Carlos
  • Muñoz Tapia, José Luis
  • Esparza Martín, Óscar
  • Mata Diaz, Jorge
  • Alins Delgado, Juan José
Security is vital for the reliable operation of vehicular ad hoc networks (VANETs). One of the critical security issues is the revocation of misbehaving vehicles. While essential, revocation checking can leak private information. In particular, repositories receiving the certificate status queries could infer the identity of the vehicles posing the query and the target of the query. An important loss of privacy results from this ability to tie the checking vehicle with the query's target, due to their likely willingness to communicate. In this paper, we propose an Efficient and Privacy-Aware revocation Mechanism (EPA) based on the use of Merkle Hash Trees (MHT) and a Crowds-based anonymous protocol, which replaces the time-consuming certificate revocation lists checking process. EPA provides explicit, concise, authenticated and unforgeable information about the revocation status of each certificate while preserving the users' privacy. Moreover, EPA reduces the security overhead for certificate status checking, and enhances the availability and usability of the revocation data. By conducting a detailed performance evaluation, EPA is demonstrated to be reliable, efficient, and scalable., Peer Reviewed, Preprint
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

J3Gen: a PRNG for low-cost passive RFID

  • Melià Seguí, Joan
  • Garcia-Alfaro, Joaquin
  • Herrera-Joancomartí, Jordi
Pseudorandom number generation (PRNG) is the main security tool in low-cost passive radio-frequency identification (RFID) technologies, such as EPC Gen2. We present a lightweight PRNG design for low-cost passive RFID tags, named J3Gen. J3Gen is based on a linear feedback shift register (LFSR) configured with multiple feedback polynomials. The polynomials are alternated during the generation of sequences via a physical source of randomness. J3Gen successfully handles the inherent linearity of LFSR based PRNGs and satisfies the statistical requirements imposed by the EPC Gen2 standard. A hardware implementation of J3Gen is presented and evaluated with regard to different design parameters, defining the key-equivalence security and nonlinearity of the design. The results of a SPICE simulation confirm the power-consumption suitability of the proposal., The authors would like to thank Josep Domingo-Ferrer, Miquel Soriano and David Megías for their helpful comments during the realization of this work. The authors thank as well the anonymous reviewers for their valuable comments and suggestions to improve the quality of the paper. This work was partly funded by the Spanish Government through projects TSI2007-65406-C03-03 E-AEGIS, TIN2011-27076-C03-02 CO-PRIVACY, CONSOLIDER INGENIO 2010 CSD2007-0004 ARES, and TIN2010-15764 N-KHRONOUS.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

On the computational security of a distributed key distribution scheme

  • Daza, Vanesa
  • Herranz, Javier
  • Sáez, Germán
In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss., The work of the first two authors was partially supported by the Spanish Ministry of Education and Science under Projects TSI2007-65406-C03-02 (“eAEGIS”) and CONSOLIDER CSD2007-00004 (“ARES”). The work of V. Daza was also supported by the Government of Catalonia under Grant 2005-SGR-00446. The work of J. Herranz was also supported by the Government of Catalonia under Grant 2005-SGR-00093. Finally, the work of G. Sáez was partially supported by the/nSpanish Ministry of Education and Science under Project TSI2006-02731.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Planar vector fields with a given set of orbits

  • Llibre, Jaume|||0000-0002-9511-5999
  • Ramírez, Rafael Orlando|||0000-0002-4958-0291
  • Sadovskaia, Natalia
We determine all the C 1 planar vector fields with a given set of orbits of the form y - y(x) = 0 satisfying convenient assumptions. The case when these orbits are branches of an algebraic curve is also study. We show that if a quadratic vector field admits a unique irreducible invariant algebraic curve g(x, y) = S∑j=0 aj (x)y S-j = 0 with S branches with respect to the variable y, then the degree of the polynomial g is at most 4S.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Fuzzy role-based access control

  • Martínez García, Carles
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Borrell i Viader, Joan|||0000-0001-6649-0450
RBAC (Role-Based Access Control) is a widely used access control model, which reduces the maintenance cost of classical identity-based access control. However, despite the benefits of RBAC, there are environments in which RBAC can hardly be applied. We present FRBAC (Fuzzy Role-Based Access Control), a generalization of RBAC through fuzzy relations that extends the applicability of RBAC to environments where authorization-related information is vague. Moreover, FRBAC deals with environments where the actions that can be executed over the resources have a fractional meaning, as data lying in databases and risk-based access control.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Supervised learning using a symmetric bilinear form for record linkage

  • Abril Castellano, Daniel
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Record Linkage is used to link records of two different files corresponding to the same individuals. These algorithms are used for database integration. In data privacy, these algorithms are used to evaluate the disclosure risk of a protected data set by linking records that belong to the same individual. The degree of success when linking the original (unprotected data) with the protected data gives an estimation of the disclosure risk. In this paper we propose a new parameterized aggregation operator and a supervised learning method for disclosure risk assessment. The parameterized operator is a symmetric bilinear form and the supervised learning method is formalized as an optimization problem. The target of the optimization problem is to find the values of the aggregation parameters that maximize the number of re-identification (or correct links). We evaluate and compare our proposal with other non-parametrized variations of record linkage, such as those using the Mahalanobis distance and the Euclidean distance (one of the most used approaches for this purpose). Additionally, we also compare it with other previously presented parameterized aggregation operators for record linkage such as the weighted mean and the Choquet integral. From these comparisons we show how the proposed aggregation operator is able to overcome or at least achieve similar results than the other parameterized operators. We also study which are the necessary optimization problem conditions to consider the described aggregation functions as metric functions.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Data privacy

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Data privacy studies methods, tools, and theory to avoid the disclosure of sensitive information. Its origin is in statistics with the goal to ensure the confidentiality of data gathered from census and questionnaires. The topic was latter introduced in computer science and more particularly in data mining, where due to the large amount of data currently available, has attracted the interest of researchers, practitioners, and companies. In this paper we will review the main topics related to data privacy and privacy-enhancing technologies.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A bloom filter based model for decentralized authorization

  • Foley, Simon N.
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
A decentralized authorization mechanism is proposed that uses Bloom filters to implement authorization delegation. This lightweight mechanism is unlike conventional approaches that typically rely on public key certificates to implement distributed delegation. In taking an approach based on one-way hash functions, the mechanism may be preferable for use in computationally constrained environments where public-key cryptography is not desirable.