Ricardo Villanueva Polanco

Dr. Ricardo Villanueva Polanco

Technology Innovation Institute, Abu Dhabi, Abū Z̧aby, United Arab Emirates
orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 October 2021 in IEEE Access
Verified
Journal Article
Open access
FNFredy Andres Novoa
Fredy Andres Novoa
AOAna Lucila Sandoval Orozco
Ana Lucila Sandoval Orozco
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco
Pedro WightmanPedro Wightman
Pedro Wightman
The applications that use blockchain are cryptocurrencies, decentralized finance applications, video games and many others. Most of these applications trust that the blockchain will prevent issues like fraud, thanks to the built-in cryptographic mechanisms provided by the data structure and the consensus protocol. However, blockchains suffers from what is called a 51% attack or majority attack, which is considered a high risk for the integrity of these blockchains, where if a miner, or a group of them, has more than half the computing capability of the network, it can rewrite the blockchain. Even though this attack is possible in theory, it is regarded as hard-achievable in practice, due to the assumption that, with enough active members, it is very complicated to have that much computing power; however, this assumption has not been studied with enough detail. In this work, a detailed characterization of the miners in the Bitcoin and Crypto Ethereum blockchains is presented, with the aim of proving the computing distribution assumption and to creating profiles that may allow the detection of anomalous behaviors and prevent 51% attacks. The results of the analysis show that, in the last years, there has been an increasing concentration of hash rate power in a very small set of miners, which generates a real risk for current blockchains. Also, that there is a pattern in mining among the main miners, which makes it possible to identify out-of-normal behavior.

9 September 2019
Verified
Book Chapter
Closed access
PDF file
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco

28 December 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco
EAEduardo David Angulo
Eduardo David Angulo
This research paper evaluates the feasibility of cold boot attacks on the Supersingular Isogeny Key Encapsulation (SIKE) mechanism. This key encapsulation mechanism has been included in the list of alternate candidates of the third round of the National Institute of Standards and Technology (NIST) Post-Quantum Cryptography Standardization Process. To the best of our knowledge, this is the first time this scheme is assessed in the cold boot attacks setting. In particular, our evaluation is focused on the reference implementation of this scheme. Furthermore, we present a dedicated key-recovery algorithm for SIKE in this setting and show that the key recovery algorithm works for all the parameter sets recommended for this scheme. Moreover, we compute the success rates of our key recovery algorithm through simulations and show the key recovery algorithm may reconstruct the SIKE secret key for any SIKE parameters for a fixed and small α=0.001 (the probability of a 0 to 1 bit-flipping) and varying values for β (the probability of a 1 to 0 bit-flipping) in the set {0.001,0.01,…,0.1}. Additionally, we show how to integrate a quantum key enumeration algorithm with our key-recovery algorithm to improve its overall performance.

18 June 2021 in IEEE Access
Verified
Journal Article
Open access
JAJorge Ariza
Jorge Ariza
Miguel JimenoMiguel Jimeno
Miguel Jimeno
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco
JCJose Capacho
Jose Capacho
The use of e-learning technologies is growing even faster due to the existing conditions where virtual setups temporarily replace traditional classroom environments. Service infrastructure support for e-learning has moved to the cloud. For this reason, the efficient provisioning of resources for such platforms, which is achieved through prediction, is very relevant. The existing techniques for predicting the use of resources in the cloud are not designed with e-learning’s specific requirements. This paper presents a neural network-based model for predicting the usage of computational resources for e-learning platforms. This model consists of a series of interconnected neural networks used to predict values for variables of interest, such as Random Access Memory (RAM) usage and Central Processing Unit (CPU) usage. Using data collected from a high school real scenario, we analyzed and used it to train and validate our neural network-based model. This scenario consisted of a Moodle server deployed in a Google Virtual Machine with a configured course and its contents. Each student performed a series of activities while connected to it. Our proposed model achieves high accuracy. The obtained results are promising, paving the way towards constructing software tools for provisioning computational resources on demand for e-learning platforms.

15 June 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco
This research article assesses the feasibility of cold boot attacks on the lifted unbalanced oil and Vinegar (LUOV) scheme, a variant of the UOV signature scheme. This scheme is a member of the family of asymmetric cryptographic primitives based on multivariable polynomials over a finite field K and has been submitted as candidate to the ongoing National Institute of Standards and Technology (NIST) standardisation process of post-quantum signature schemes. To the best of our knowledge, this is the first time that this scheme is evaluated in this setting. To perform our assessment of the scheme in this setting, we review two implementations of this scheme, the reference implementation and the libpqcrypto implementation, to learn the most common in-memory private key formats and next develop a key recovery algorithm exploiting the structure of this scheme. Since the LUOV’s key generation algorithm generates its private components and public components from a 256-bit seed, the key recovery algorithm works for all the parameter sets recommended for this scheme. Additionally, we tested the effectiveness and performance of the key recovery algorithm through simulations and found the key recovery algorithm may retrieve the private seed when α = 0.001 (probability that a 0 bit of the original secret key will flip to a 1 bit) and β (probability that a 1 bit of the original private key will flip to a 0 bit) in the range { 0.001 , 0.01 , 0.02 , … , 0.15 } by enumerating approximately 2 40 candidates.

27 November 2022 in Sensors
Verified
Journal Article
Open access
PDF file
FNFredy Andres Novoa
Fredy Andres Novoa
DADaniel Povedano Alvarez
Daniel Povedano Alvarez
RPRicardo Villanueva Polanco
Ricardo Villanueva Polanco
AOAna Lucila Sandoval Orozco
Ana Lucila Sandoval Orozco
Luis Javier García VillalbaLuis Javier García Villalba
Luis Javier García Villalba
Cryptojacking or illegal mining is a form of malware that hides in the victim’s computer and takes the computational resources to extract cryptocurrencies in favor of the attacker. It generates significant computational consumption, reducing the computational efficiency of the victim’s computer. This attack has increased due to the rise of cryptocurrencies and their profitability and its difficult detection by the user. The identification and blocking of this type of malware have become an aspect of research related to cryptocurrencies and blockchain technology; in the literature, some machine learning and deep learning techniques are presented, but they are still susceptible to improvement. In this work, we explore multiple Machine Learning classification models for detecting cryptojacking on websites, such as Logistic Regression, Decision Tree, Random Forest, Gradient Boosting Classifier, k-Nearest Neighbor, and XGBoost. To this end, we make use of a dataset, composed of network and host features’ samples, to which we apply various feature selection methods such as those based on statistical methods, e.g., Test Anova, and other methods as Wrappers, not only to reduce the complexity of the built models but also to discover the features with the greatest predictive power. Our results suggest that simple models such as Logistic Regression, Decision Tree, Random Forest, Gradient Boosting, and k-Nearest Neighbor models, can achieve success rate similar to or greater than that of advanced algorithms such as XGBoost and even those of other works based on Deep Learning.