Pasar al contenido principal

PLATAFORMA DE RESILIENCIA BASADA EN CLOUD PARA INFRAESTRUCTURAS DE TI SANITARIAS

PID2019-104855RB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE ALCALA

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Democratic Wireless Channel Assignment: Fair Resource Allocation in Wi-Fi Networks

  • Marsa-Maestre, Ivan
  • Tejedor-Romero, Marino
  • de la Hoz, Enrique
  • Murukannaiah, Pradeep
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
This work was supported in part by Project PID2019-104855RB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation, in part by Project SBPLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER, and in part by Projects UCeNet (CM/JIN/2019-031) and WiDAI (CM/JIN/2021-004) of the Comunidad de Madrid and University of Alcala. The work of M. Tejedor Romero was supported by a Ph.D. Grant from the Universidad de Alcala. The authors also would like to thank Prof. R. Aydogan for her insightful comments about the manuscript.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Channel Selection in Uncoordinated IEEE 802.11 Networks Using Graph Coloring

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Marsá-Maestre, Iván
  • de la Hoz, Enrique
  • Orden, David
  • Herranz-Oliveros, David
[EN] One of the big challenges in decentralized Wi-Fi networks is how to select channels for the different access points (APs) and their associated stations (STAs) in order to minimize interference and hence maximize throughput. Interestingly enough, de facto standards in terms of uncoordinated channel selection are quite simple, and in many cases result in fairly suboptimal channel allocations. Here, we explore how graph coloring can be used to evaluate and inform decisions on Wi-Fi channel selection in uncoordinated settings. Graph coloring, in its most basic form, is a classic mathematical problem where colors have to be assigned to nodes in a graph while avoiding assigning the same color to adjacent nodes. In this paper, we modeled Wi-Fi uncoordinated channel selection as a graph coloring problem and evaluated the performance of different uncoordinated channel selection techniques in a set of representative scenarios of residential buildings. The results confirm some of the widely accepted consensus regarding uncoordinated channel selection but also provide some new insights. For instance, in some settings, it would be better to delegate the decision on which channel to use to transmit the STAs, rather than having the AP make the decision on its own, which is the usual way., This publication is part of Project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR and of Project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, UE. Ivan Marsa-Maestre and David Orden are partially funded by Project SB-PLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER and by Project WiDAI (CM/JIN/2021-004) of the Comunidad de Madrid and University of Alcala. Jose Manuel Gimenez-Guzman, Ivan Marsa-Maestre, and David Herranz-Oliveros are also funded by Project PID2019-104855RB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation. David Orden is also partially supported by Project PID2019-104129GB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation. The APC was funded by Project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimal channel assignment on dense Wi-Fi networks using Thermodynamic Threshold Accepting

  • Tejedor-Romero, Marino
  • Cruz-Piris, Luis
  • Herranz-Oliveros, David
  • Marsa-Maestre, Iván
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] Channel assignment in Wi-Fi 6 dense networks is a challenging problem which critically impacts the performance of WLAN communications. Although there have been many proposals in the area of IEEE 802.11 channel assignment, LCCS has emerged as the de facto standard for distributed channel selection. Notwithstanding, centralized optimizers overcome the performance of distributed channel assignment algorithms, so their study is of utmost importance. One of the most successful optimization proposals in the state-of-the-art for Wi-Fi 4 is based on simulated annealing (SA). However, SA presents a significant limitation: its parameters must be adjusted manually for each scenario, otherwise yielding suboptimal solutions. In this paper, we propose a new technique for channel assignment optimization of Wi-Fi dense networks, called Thermodynamic Threshold Accepting (TTA), including modifications inspired by Threshold Accepting (TA) and Thermodynamic Simulated Annealing (TSA). With respect to SA, TTA avoids manual tuning, being able to adapt to the specific setting automatically. We evaluate TTA in a dense Wi-Fi model and, compared to SA, we show that our approach reaches optimal results without requiring any prior fine-tuning. We also show that TTA is even able to slightly overcome the performance of an accurately calibrated SA optimizer for the same number of iterations., This publication is part of project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/ 501100011033 and by the European Union NextGenerationEU /PRTR and of project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, UE. The work has also been funded by Project SB- PLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER, Spain, by Project WiDAI (CM/JIN/2021 004) of the Comunidad de Madrid and University of Alcalá, and by Projects PID2019-104855RB-I00 and PID2019-104129GB-I00/AEI / 10.13039/501100011033 of the Spanish Ministry of Science and Innovation. Finally, this work is part of the research project SBPLY/23/180225/000160, which is funded b
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

IEEE 802.11 graph models

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Marsa-Maestre, Ivan
  • Cruz-Piris, Luis
  • Orden, David
  • Tejedor-Romero, Marino
[EN] There are several recent research lines addressing Wi-Fi network planning and optimiza-tion, both in terms of channel assignment and access point deployment. The problem with these works is that evaluation is usually performed with specific and closed models regarding signal prop-agation, throughput computation, and utility definition. Also, many of the models in the literature make assumptions about the role of wireless stations, or the co-channel interference, which-while being valid in the context of a single research work-makes very difficult to compare different approaches, to re-use concepts from previous mechanisms to create new ones, or to generalize mechanisms to other scenarios. This makes the different research lines in Wi-Fi network planning and optimization progress in an isolated manner.This paper aims to address such a recurring problem by proposing a graph-based generic model for Wi-Fi utility computation in network planning scenarios, as well as providing a collection of scenario graphs which may be used to benchmark different planning and optimization approaches. Experiments are conducted to show the validity of the model and the significance of its features, along with its extensibility to other scenarios., This work has been partially funded by Projects PID2019-10 4855RB-I00/AEI/10.13039/501100011033 and PID2019-10412 9GB-I00/AEI/10.13039/501100011033, by Project SBPLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER, by Projects UCeNet (CM/JIN/2019-031) and WiDAI (CM/JIN/2021-004) of the Comunidad de Madrid and University of Alcala, and by H2020-MSCA-RISE project 734922 - CONNECT. The publication is also part of project TED2021-131387B-I00 funded by MCIN/AEI/10.13039/501100011033 and by the European Union "NextGenerationEU"/PRTR and of project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/50110001103 3/FEDER, UE.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Distributed Remote E-Voting System Based on Shamir&apos, s Secret Sharing Scheme

  • Tejedor-Romero, Marino
  • Orden, David
  • Marsa-Maestre, Ivan
  • Junquera-Sanchez, Javier
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] A number of e-voting systems have been proposed in the last decades, attracting the interest of the research community. The challenge is far from being fully addressed, especially for remote systems. In this work, we propose DiverSEC, a distributed, remote e-voting system based on Shamir secret sharing, operations in Galois field and mixnets, which enables end-to-end vote verification. Parties participate as nodes in the network, protecting their interests and ensuring process integrity due to the conflicting interests. The threat model is very conservative, not letting even the most privileged actors to compromise votes privacy or integrity. Security in depth is implemented, overlapping different mechanisms to offer guarantees even in the most adverse operating conditions. The main contributions of the resulting system are our proposal for secret-sharing among the political parties, which guarantees that no party can compromise the integrity of the ballot without being detected and identified in real time, and the computational and architectural scalability of the proposal, which make it easy to implement., M.T.-R. is funded by a predoctoral grant from the University of Alcala. M.T.-R., I.M.-M. and J.M.G.-G. are partially funded by Project PID2019-104855RB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation, by Project SBPLY/19/180501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER and by Project UCeNet (CM/JIN/2019-031) of the Comunidad de Madrid and University of Alcala. D.O. is partially supported by Project PID2019-104129GB-I00/AEI/10.13039/501100011033 of the Spanish Ministry of Science and Innovation, and by H2020-MSCA-RISE project 734922-CONNECT.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Surgical immunization strategies against lateral movement in Active Directory environments

  • Herranz-Oliveros, David
  • Marsa-Maestre, Ivan
  • Tejedor-Romero, Marino
  • de la Hoz, Enrique
  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
[EN] Lateral movement, in which a cyber attacker progresses through an enterprise network in order to compromise its most valuable assets, is a key stage of any intrusion nowadays. Therefore, being able to mitigate lateral movement, be it by slowing down attacker progress or by limiting its reach, is a top priority for enterprise cyber-defence. Due to the inherent complexity of enterprise networks, it is also a paramount challenge. This challenge becomes even more prominent if we take into account the high impact of deploying security countermeasures on the performance or functionality of the network. In this paper we model lateral movement as an infection process and propose a methodology to prioritize which network elements to protect for a more effective and efficient mitigation. To do this we rely on a graph model and graph theoretic metrics taken from epidemiology research, and apply them to the trust relationships in Microsoft Active Directory infrastructures. We propose selective immunization techniques which act as ``surgical¿¿ countermeasures, by impacting a very reduced ratio of the nodes in the network. Experiments show that the selective immunization strategies we propose effectively mitigate infection spread in these settings while keeping the amount of immunized nodes at a minimum., This work has been partially funded by the project PID2019-104855RB-I00/AEI/10.13039/501100011033 from the Ministry of Science and Innovation of Spain, the project SBPLY/19/180501/000171 from the Government of Castilla-La Mancha (Spain), and the projects UCeNet (CM/JIN/2019-031) and WiDAI (CM/JIN/2021-004) from the Community of Madrid and the University of Alcalá. David Herranz is also funded by an FPU grant from the University of Alcalá. This publication is also part of the TED2021-131387B-I00 project funded by MCIN/AEI/10.13039/501100011033 and the European Union NextGenerationEU /PRTR, and the project PID2021-123168NB-I00 funded by MCIN/AEI/10.13039/501100011033/FEDER, EU.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Goal-Oriented Source Coding and Filtering for Vehicular Communications

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Leyva-Mayorga, Israel
  • Popovski, Petar
[EN] Vehicle-to-everything (V2X) networks will constitute a prominent application in future generations of cellular networks, definitely transforming our conception of transportation systems. A major challenge in V2X networks is the vast amount of data generated by the large number of sensors in the vehicles, which saturates the wireless links. As it is not possible to meet the throughput, timing, and reliability requirements for the total bulk of generated data, one needs to filter out data based on the actual communication goal. In this article, we present an architecture and diverse options to implement filtering and source coding for goal-oriented (GO) vehicular communications. We illustrate how filtering and source coding contribute to meeting the strict delay requirements while maintaining energy-efficient operation. Our results show that GO communications, performed as the combination of Bloom filtering and GO source coding, can greatly contribute not only to reduce the energy consumption by up to 30% but also to decrease delay, which in turn increases the supported amount of delay-sensitive traffic by up to 819.2%., This work was supported in part by the MCIN/AEI/10.13039/501100011033 and the European Union "NextGenerationEU"/PRTR under Project TED2021-131387B-I00; in part by the MCIN/AEI/10.13039/501100011033/FEDER, UE under Project PID2021123168NB-I00; in part by the Spanish Ministry of Science and Innovation under Project PID2019-104855RB-I00/AEI/10.13039/501100011033; in part by the SNS JU Project 6G-GOALS through the EU's Horizon Program under Grant 101139232; and in part by the Villum Investigator Grant "WATER" from the Velux Foundation, Denmark. Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the Benefits of Channel Bonding in Dense, Decentralized Wi-Fi 4 Networks

  • Gimenez-Guzman, Jose Manuel|||0000-0002-1645-8476
  • Marsa-Maestre,Ivan
  • Orden, David
  • Fernandez, Susel
  • Tejedor-Romero, Marino
[EN] Channel bonding is a technique first defined in the IEEE 802.11n standard to increase the throughput in wireless networks by means of using wider channels. In IEEE 802.11n (nowadays also known as Wi-Fi 4), it is possible to use 40 MHz channels instead of the classical 20 MHz channels. Although using channel bonding can increase the throughput, the classic 802.11 setting only allows for two orthogonal channels in the 2.4 GHz frequency band, which is not enough for proper channel assignment in dense settings. For that reason, it is commonly accepted that channel bonding is not suitable for this frequency band. However, to the best of our knowledge, there is not any accurate study that deals with this issue thoroughly. In this work, we study in depth the effect of channel bonding in Wi-Fi 4 dense, decentralized networks operating in the 2.4 GHz frequency band. We confirm the negative effect of using channel bonding in the 2.4 GHz frequency band with 11 channels which are 20 MHz wide (as in North America), but we also show that when there are 13 or more channels at hand (as in many other parts of the world, including Europe and Japan), the use of channel bonding yields consistent throughput improvements. For that reason, we claim that the common assumption of not considering channel bonding in the 2.4 GHz band should be revised., Jose Manuel Gimenez-Guzman, Ivan Marsa-Maestre, David Orden, and Susel Fernandez were partially funded by Project SBPLY/19/180 501/000171 of the Junta de Comunidades de Castilla-La Mancha and FEDER and by Project UCeNet (CM/JIN/2019-031) of the Comunidad de Madrid and University of Alcala. Jose Manuel Gimenez-Guzman, Ivan Marsa-Maestre, and Susel Fernandez were also funded by Project PID2019-104855RB-I00/AEI/10.130 39/501 100 011 033 of the Spanish Ministry of Science and Innovation. David Orden was also partially supported by Project PID2019-104129GB-I00/AEI/10.130 39/501 100 011 033 of the Spanish Ministry of Science and Innovation and by H2020-MSCA-RISE Project 734922 - CONNECT. Marino Tejedor-Romero was funded by a predoctoral contract from University of Alcala.
Investigo. Repositorio Institucional de la Universidade de Vigo
Publicación Artículo científico (JournalArticle)

Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields

  • Blanco Chacón, Iván
  • Pedrouzo Ulloa, Alberto
  • Njah Nchiwo, Rahinatou Y.
  • Barbero Lucas, Beatriz
We discuss the advantages and limitations of cyclotomic fields to have fast polynomial arithmetic within homomorphic encryption, and show how these limitations can be overcome by replacing cyclotomic fields by a family that we refer to as cyclo-multiquadratic. This family is of particular interest due to its arithmetic efficiency properties and to the fact that the Polynomial Learning with Errors (PLWE) and Ring Learning with Errors (RLWE) problems are equivalent for it. Likewise, we provide exact expressions for the condition number for any cyclotomic field, but under what we call the twisted power basis. As a tool for our result, we obtain refined polynomial upper bounds for the condition number of cyclotomic fields with up to 6 different primes dividing the conductor. From a more practical side, we also show that for this family, swapping between NTT (Number Theoretic Transform) and coefficient representations can be achieved at least twice faster than for the usual cyclotomic family., Agencia Estatal de Investigación | Ref. MTM2016-79400-P, Agencia Estatal de Investigación | Ref. PID2019-104855RB-I00, Agencia Estatal de Investigación | Ref. TED2021-130624B-C21, Universidad de Alcalá | Ref. CCG20/IA-057, Xunta de Galicia | Ref. ED431C 2021/47, Universidade de Vigo, Magnus Ehrnrooth Foundation (Finland), Academy of Finland | Ref. 351271, Ministry of Defence (Finland) | Ref. #2500M-0147, Universidade de Vigo/CISUG
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Optimal channel assignment on dense Wi-Fi networks using Thermodynamic Threshold Accepting

  • Tejedor Romero, Marino|||0000-0002-1679-0161
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Cruz Piris, Luis de la|||0000-0002-9570-2851
  • Herranz Oliveros, David|||0009-0009-0926-3986
  • Marsá Maestre, Iván|||0000-0002-5529-2851
Channel assignment in Wi-Fi 6 dense networks is a challenging problem which critically impacts the performance of WLAN communications. Although there have been many proposals in the area of IEEE 802.11 channel assignment, LCCS has emerged as the de facto standard for distributed channel selection. Notwithstanding, centralized optimizers overcome the performance of distributed channel assignment algorithms, so their study is of utmost importance. One of the most successful optimization proposals in the state-of-the-art for Wi-Fi 4 is based on simulated annealing (SA). However, SA presents a significant limitation: its parameters must be adjusted manually for each scenario, otherwise yielding suboptimal solutions. In this paper, we propose a new technique for channel assignment optimization of Wi-Fi dense networks, called Thermodynamic Threshold Accepting (TTA), including modifications inspired by Threshold Accepting (TA) and Thermodynamic Simulated Annealing (TSA). With respect to SA, TTA avoids manual tuning, being able to adapt to the specific setting automatically. We evaluate TTA in a dense Wi-Fi model and, compared to SA, we show that our approach reaches optimal results without requiring any prior fine-tuning. We also show that TTA is even able to slightly overcome the performance of an accurately calibrated SA optimizer for the same number of iterations., Agencia Estatal de Investigación, Junta de Comunidades de Castilla-La Mancha, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Trace-based cryptanalysis of cyclotomic R_{q,0}xR_q-PLWE for the non-split case

  • Blanco Chacón, Iván|||0000-0002-4666-019X
  • Barbero Lucas, Beatriz
  • Durán Díaz, José Raúl|||0000-0001-6217-4768
  • Njah Epouse Nchiwo, Rahinatou Yuh
We describe a decisional attack against a version of the PLWE problem in which the samples are taken from a certain proper subring of large dimension of the cyclotomic ring Fq[x]/(Φp k (x)) with k > 1 in the case where q ≡ 1 (mod p) but Φp k (x) is not totally split over Fq. Our attack uses the fact that the roots of Φp k (x) over suitable extensions of Fq have zero-trace and has overwhelming success probability as a function of the number of input samples. An implementation in Maple and some examples of our attack are also provided., Agencia Estatal de Investigación, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Democratic Wireless Channel Assignment: Fair Resource Allocation in Wi-Fi Networks

  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Tejedor Romero, Marino|||0000-0002-1679-0161
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Murukannaiah, Pradeep
User experience is the ultimate quality of service criterion for modern WLAN networks. However, network configuration approaches are mainly network-centric. We envision a paradigm shift, empowering users in network management. We study how automated negotiation and collective intelligence can support the democratic configuration of a wireless network, leveraging client and provider interests. This new paradigm allows for flexible network configuration, which enables better exploitation of resources considering the clients’ real usage and needs, and a fair distribution of throughput among users., Agencia Estatal de Investigación, Junta de Comunidades de Castilla-La Mancha, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

On the benefits of channel bonding in dense, decentralized Wi-Fi 4 networks

  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Orden Martín, David|||0000-0001-5403-8467
  • Fernández Melián, Susel|||0000-0002-1576-4340
  • Tejedor Romero, Marino|||0000-0002-1679-0161
Channel bonding is a technique first defined in the IEEE 802.11n standard to increase the throughput in wireless networks by means of using wider channels. In IEEE 802.11n (nowadays also known as Wi-Fi 4), it is possible to use 40 MHz channels instead of the classical 20 MHz channels. Although using channel bonding can increase the throughput, the classic 802.11 setting only allows for two orthogonal channels in the 2.4 GHz frequency band, which is not enough for proper channel assignment in dense settings. For that reason, it is commonly accepted that channel bonding is not suitable for this frequency band. However, to the best of our knowledge, there is not any accurate study that deals with this issue thoroughly. In this work, we study in depth the effect of channel bonding in Wi-Fi 4 dense, decentralized networks operating in the 2.4 GHz frequency band. We confirm the negative effect of using channel bonding in the 2.4 GHz frequency band with 11 channels which are 20 MHz wide (as in North America), but we also show that when there are 13 or more channels at hand (as in many other parts of the world, including Europe and Japan), the use of channel bonding yields consistent throughput improvements. For that reason, we claim that the common assumption of not considering channel bonding in the 2.4 GHz band should be revised., Junta de Comunidades de Castilla-La Mancha, Universidad de Alcalá, Agencia Estatal de Investigación, European Commission
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Contribución de congreso (ConferenceOutput)

Modelado del conocimiento de ciberseguridad en entornos hospitalarios

  • Fernández Melián, Susel|||0000-0002-1576-4340
  • Cruz Piris, Luis de la|||0000-0002-9570-2851
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
XV Jornadas de Ingeniería Telemática JITEL 2021, 27/10/2021-29/10/2021, Universidade da Coruña, A Coruña, España., En la actualidad se está produciendo un considerable incremento en el número de ataques informáticos dirigidos a infraestructuras críticas en todo el mundo, entre las que destacan las infraestructuras de los centros hospitalarios. Estos ataques pueden tener graves consecuencias, desde el filtrado masivo de datos sanitarios confidenciales, hasta el colapso total de las infraestructuras TICs de las entidades sanitaras. Este trabajo se centra en la gestión del conocimiento de ciberseguridad en el entorno hospitalario y consiste en el desarrollo de una ontología que modele los principales conceptos y relaciones identificados en este dominio. El objetivo principal es poder contar con infraestructuras capaces de detectar estos ataques y establecer mecanismos de actuación que permitan mitigar sus efectos sobre los activos en un entorno tan crucial y vulnerable como es el entorno sanitario., Universidad de Alcalá, Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

RLWE/PLWE equivalence for the maximal totally real subextension of the 2rpq-th cyclotomic field

  • Blanco Chacón, Iván|||0000-0002-4666-019X
  • López Hernanz, Lorena|||0000-0002-9850-5028
We generalise our previous work by giving a polynomial upper bound on the condition number of certain quasi-Vandermonde matrices to es tablish the equivalence between the RLWE and PLWE problems for the totally real subfield of the cyclotomic fields of conductor 2r , 2rp and 2rpq with r ≥ 1 and p, q arbitrary primes. Moreover, we give some cryptographic motivations for the study of these subfields., Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

RLWE/PLWE equivalence for totally real cyclotomic subextensions via quasi-Vandermonde matrices

  • Blanco Chacón, Iván|||0000-0002-4666-019X
We propose and justify a generalized approach to prove the polynomial reduction of the RLWE to the PLWE problem attached to the ring of integers of a monogenic number field. We prove such equivalence in the case of the maximal totally real subextension of the 4p th cyclotomic field, with p arbitrary prime., Agencia Estatal de Investigación, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

IEEE 802.11 graph models

  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Cruz Piris, Luis De La|||0000-0002-9570-2851
  • Orden Martín, David|||0000-0001-5403-8467
  • Tejedor Romero, Marino|||0000-0002-1679-0161
There are several recent research lines addressing Wi-Fi network planning and optimization, both in terms of channel assignment and access point deployment. The problem with these works is that evaluation is usually performed with specific and closed models regarding signal propagation, throughput computation, and utility definition. Also, many of the models in the literature make assumptions about the role of wireless stations, or the co-channel interference, which -while being valid in the context of a single research work- makes very difficult to compare different approaches, to re-use concepts from previous mechanisms to create new ones, or to generalize mechanisms to other scenarios. This makes the different research lines in Wi-Fi network planning and optimization progress in an isolated manner. This paper aims to address such a recurring problem by proposing a graph-based generic model for Wi-Fi utility computation in network planning scenarios, as well as providing a collection of scenario graphs which may be used to benchmark different planning and optimization approaches. Experiments are conducted to show the validity of the model and the significance of its features, along with its extensibility to other scenarios., Agencia Estatal de Investigación, Junta de Comunidades de Castilla-La Mancha, Universidad de Alcalá, European Commission