Pasar al contenido principal

PRIVACIDAD Y SEGURIDAD EN BLOCKCHAINS PUBLICAS Y SUS APLICACIONES A LOS MERCADOS DE DATOS

PID2019-110224RB-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 UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

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

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

Gpu generation of binary 2-separating codes

  • Fernandez, Marcel
  • Livieratos, John
  • Martínez Zaldívar, Francisco José|||0000-0002-7845-6273
  • García Mollá, Víctor Manuel|||0000-0003-4768-7367
  • Simarro, M. Angeles|||0000-0001-6238-2532
  • Gonzalez, Alberto|||0000-0002-6984-3212
[EN] This paper addresses the generation of binary 2-separating codes and the study of the code rates that can be achieved in practice. In the case of binary 2-separating codes, there exist lower and upper theoretical bounds in the rates that can be achieved. The generation of 2-separating codes has been studied from a theoretical point of view, but, as far as we know, it has not been tackled from a practical point of view. In this paper, we consider and analyze two different generation algorithms. Both algorithms were implemented in CUDA and executed in GPUs, for the sake of efficiency. The first algorithm is inspired by the Moser-Tardos algorithm, which is based on the Local Lov & aacute;sz Lemma. This algorithm has a strong theoretical appeal; codes obtained through this first algorithm can be shown to match the best known lower bound. To generate codes with rates as large as possible, a second algorithm has been implemented. The rates achieved are larger than those achieved with the first algorithm, but they still are very far from the theoretical upper bound. The results obtained suggest that the theoretical upper bound can probably be improved., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was supported in part by the Spanish Ministery of Science and Innovation under grant PID2021-125736OB-I00 (MCIN/AEI /10.13039/501100011033/, ERDF A way of making Europe ), and by GVA under grant CIPROM/2022/20. The work of Marcel Fernández has been supported by TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

An algorithmic construction of union-intersection-bounded families

  • Fernández Muñoz, Marcel|||0000-0001-7655-135X
  • Livieratos, John
  • Martín Mollevi, Sebastià|||0000-0002-9799-6793
© 2024 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, In this paper, we present lower bounds and algorithmic constructions of union-intersection-bounded families of sets. The lower bound is established using the Lovász Local Lemma. This bound matches the best known bound for the size of union-intersection-bounded families of sets. We then use the variable framework for the Lovász Local Lemma, to discuss an algorithm that outputs explicit constructions that attain the lower bound. The algorithm has polynomial complexity in the number of points in the family., The authors declare the following financial interests/personal relationships which may be considered as potential competing interests: Sebastia Martin reports financial support was provided by Spain Ministry of Science and Innovation (PID2019-109379RB-I00). Marcel Fernandez reports financial support was provided by Government of Spain Ministry of Finance and Public Administration (PID2019-110224RB-I00)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Can we run our Ethereum nodes at home?

  • Cortes Goicoechea, Mikel
  • Mohandas Daryanani, Tarun
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
  • Bautista Gómez, Leonardo
Scalability is a common issue among the most used permissionless blockchains, and several approaches have been proposed to solve it. However, tackling scalability while preserving the security and decentralization of the network is a significant challenge. To deliver effective scaling solutions, Ethereum achieved a significant protocol improvement, including a change in the consensus mechanism towards Proof of Stake. This improvement greatly reduced the hardware requirements to run a node, leading to significant sustainability benefits with a lower network energy consumption. This work analyzes the resource usage behaviour of different clients running as Ethereum consensus nodes, comparing their performance under different configurations and analyzing their differences. Our results show higher requirements than initially claimed and show how different clients react to network perturbations. Furthermore, we discuss the differences between the consensus clients, including their strong points and limitations., This work was supported in part by the Lido Ecosystem Grant Organization (LEGO), in part by Spanish TCO-RISEBLOCK Project under Grant PID2019-110224RB-I00, in part by the Ethereum Foundation under the Research Grant FY21-0356, and in part by Protocol Labs under its Ph.D. Fellowship Program under Grant FY22-P2P., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Stochastic simplicial contagion model

  • Hernández Serrano, Daniel
  • Villarroel Rodríguez, Francisco Javier
  • Hernández Serrano, Juan|||0000-0001-5225-7404
  • Tocino García, Ángel Andrés
We propose a stochastic model that describes of epidemics over simplicial complex networks (SSCM) in which higher-order unforeseen or random interactions may occur. Its dynamics obeys a stochastic differential equation (SDE) based on the mean field approach of the simplicial social contagion model. In this stochastic regime the only possible equilibrium state is the origin. We give conditions to guarantee global stability and hence that the disease dies out. We partition the parameter space into the instability, the bi-stability and the globally asymptotically stable regions described in terms of appropriate epidemiological parameters. These regimes codify whether the disease will, can or will not disappear. We also present empirical results obtained by running different simulations of the SSCM over several real-world simplicial networks and over a synthetically generated one, which validate the theoretical results presented., D.H.S. is supported by Grant PID2021-128665NB-I00 funded by MCIN/AEI/ 10.13039/501100011033 and, as appropriate, by \ERDF A way of making Eu- rope", Ministerio de Econom a y Competitividad (Spain) under grant MTM2017- 86042-P, the project STAMGAD 18.J445 / 463AC03 by Consejer a de Edu- caci on (GIR, Junta de Castilla y Le on, Spain) and by Universidad de Sala- manca (Spain) under project PIC2-2021-10. J.H.S. is supported by the Span- ish Ministry of Science and Education under the project TCO-RISEBLOCK (PID2019-110224RB-I00), the European Union's H2020 Research and Innova- tion Programme under the Grant Agreement No. 871754 (i3-MARKET), and the Generalitat de Catalunya grant 2017-SGR-00782.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

New privacy practices for blockchain software

  • Bellés Muñoz, Marta
  • Baylina Melé, Jordi
  • Daza Fernández, Vanesa
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The benefits of blockchain technologies for industrial applications are unquestionable. However, it is a considerable challenge to use a transparent system like blockchain and at the same time provide privacy to sensitive data. Privacy technologies permit conducting private transactions about sensitive data over transparent networks, but their inherent complexity has been overwhelming for many developers. Closing the gap between developers and privacy-preserving technologies would help to the full adoption of the privacy by design framework for blockchain software. To this end, in this paper we present the software tools we have implemented to bring complex privacy technologies closer to developers and facilitate the job of implementing privacy-enabled blockchain applications., This research is supported by the Ethereum Foundation Ecosystem Support [9], TCO-RISEBLOCK (PID2019-110224RB-I00), H2020-i3-MARKET, ARPASAT (TEC2015-70197-R), 2014-SGR-1504, RTI2018-102112-B-I00 (AEI/FEDER,UE) and H2020 PRESENT (856879)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Invoice factoring registration based on a public blockchain

  • Mohammadzadeh, Nasibeh|||0000-0001-5950-0964
  • Nogoorani, Sadegh Dorri
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Invoice factoring is a very useful tool for developing businesses that face liquidity problems. The main property that a factoring system needs to fulfill is to prevent an invoice from being factored twice. In order to prevent double factoring, many factoring ecosystems use one or several centralized entities to register factoring agreements. However, this puts a lot of power in the hands of these centralized entities and makes it difficult for users to dispute situations in which factoring data is unavailable, wrongly recorded or manipulated by negligence or on purpose. In this article, we propose an architecture for invoice factoring registration based on a public blockchain. To solve the aforementioned drawbacks, we replace the trusted third parties for factoring registration with a smart contract. Using a smart contract, we record digital evidence of the terms and conditions of factoring agreements in explicit detail, allowing auditability and dispute resolution. Relevant information is highly available on the blockchain while its privacy is protected. The registration is optimal, since it needs only one blockchain transaction and one key-value storage per invoice factoring., This work was supported in part by the TCO-RISEBLOCK under Grant PID2019-110224RB-I00, in part by the H2020-i3-MARKET, and in part by the ARPASAT under Grant TEC2015-70197-R and Grant 2014-SGR-1504, Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Circom: a circuit description language for building zero-knowledge applications

  • Bellés Muñoz, Marta
  • Isabel, Miguel
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
  • Rubio Gimeno, Alberto|||0000-0002-0501-9830
  • Baylina Melé, Jordi
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., A zero-knowledge (ZK) proof guarantees that the result of a computation is correct while keeping part of the computation details private. Some ZK proofs are tiny and can be verified in short time, which makes them one of the most promising technologies for solving two key aspects: the challenge of enabling privacy to public and transparent distributed ledgers and enhancing their scalability limitations. Most practical ZK systems require the computation to be expressed as an arithmetic circuit that is encoded as a set of equations called rank-1 constraint system (R1CS). In this paper, we present Circom , a programming language and a compiler for designing arithmetic circuits that are compiled to R1CS. More precisely, with Circom , programmers can design arithmetic circuits at a constraint level, and the compiler outputs a file with the R1CS description, and WebAssembly and C++ programs to efficiently compute all values of the circuit. We also provide an open-source library called circomlib with multiple circuit templates. Circom can be complemented with snarkjs , a library for generating and validating ZK proofs from R1CS. Altogether, our software tools abstract the complexity of ZK proving mechanisms and provide a unique and friendly interface to model low-level descriptions of arithmetic circuits., This work was supported in part by the Ethereum Foundation Ecosystem Support [68], TCO-RISEBLOCK under Grants PID2019-110224RB-I00, PID2021-128521OB-I00, and PID2021-122830OB-C41, in part by CHAISEErasmus+: blockchain skills for Europe, the Spanish MCIU, AEI and FEDER (EU) project under Grant RTI2018-094403-B-C31, and in part by the CM projects under Grant S2018/TCS-4314 co-funded by EIE Funds of the European Union., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A study of the separating property in Reed-Solomon codes by bounding the minimum distance

  • Fernández Muñoz, Marcel|||0000-0001-7655-135X
  • Jiménez Urroz, Jorge|||0000-0002-2395-4478
The version of record is available online at: http://dx.doi.org/10.1007/s10623-021-00988-z, According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that, if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper, further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property., This work has been supported by the Spanish Government Grant TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO ., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

DA2Wa: un protocolo de emparejamiento seguro entre DApp y wallet para el escenario blockchain

  • Román García, Fernando|||0000-0002-1330-1422
  • Alarcón García-Saavedra, Antonio|||0009-0003-3556-1561
  • Hernández Serrano, Juan|||0000-0001-5225-7404
  • Esparza Martín, Óscar|||0000-0002-2593-0162
Las aplicaciones descentralizadas (decentralized ap-plications - DApps) hacen uso de tecnologías blockchain para operar de forma autónoma y completamente distribuida. La interacción con la blockchain requiere el uso de material criptográfico que se debe proteger y gestionar de forma segura. Precisamente las aplicaciones de billetera o simplemente wallets se encargan de resolver ese reto. Las DApps necesitan, por tanto, conectarse de forma segura a un wallet. En el estado del arte han aparecido diferentes soluciones para realizar esta interconexión, pero hasta ahora o bien relajan las políticas de seguridad o requieren el uso de infraestructura externa. Este artículo resume DA2Wa, un protocolo diseñado para establecer un emparejamiento seguro entre un wallet de criptomonedas y una DApp, ambas funcionando como aplicaciones aisladas en la misma máquina. El protocolo utiliza un mecanismo de intercambio de PIN de seis caracteres, ofreciendo un nivel de seguridad equivalente al del protocolo de emparejamiento de Bluetooth., Esta investigación ha sido financiada por i3-MARKET (H2020-ICT-2019-2, numero de subvención 871754), por el Ministerio de Ciencia y Educación de España bajo el proyecto˜ TCO-RISEBLOCK (PID2019-110224RB-I00) y, finalmente, por la Generalitat de Catalunya bajo la subvención 2021-SGR-00594. Cabe destacar que esta iniciativa se lleva a cabo en el marco de los fondos del Plan de Recuperación, Transformación y Resiliencia, financiado por la Unión Europea (Next Generation), bajo la Cátedra de Ciberseguridad INCIBE llamada CARISMATICA.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Comprehensive IoT-driven fleet management system for industrial vehicles

  • Farahpoor, MohammadaliI
  • Esparza Martín, Óscar|||0000-0002-2593-0162
  • Soriano Ibáñez, Miguel|||0000-0003-0457-8531
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., In the context of fleet management, various challenges, including equipment breakdowns, rising maintenance costs, inefficient resource utilization, and outdated telematics systems, necessitate a transformative approach. Traditional telematics systems encounter limitations such as closed compatibility with specific brands, unique network protocols, and insufficient data analysis and decision-making support. Therefore, these challenges can be addressed by using IoT-driven solutions. This paper introduces an IoT-driven system called the "intelligent dispatching and health monitoring system" (IDHMS), which is designed to enhance fleet operations in industries such as mining, construction, and agriculture while addressing issues related to legacy telematics systems. The architecture of IDHMS is a comprehensive IoT-driven framework that integrates embedded hardware, cloud-based software, and flexible network infrastructure. This system facilitates real-time communication, gathering and analysis of data, and decision-making for fleet management in such industries. The IDHMS addresses the limitations of conventional telematics systems by offering standardized protocols, open APIs, robust security measures, comprehensive data analytics capabilities, and a multipurpose ecosystem. Its data-driven insights empower informed decision-making, drive continuous improvement, and enable strategic resource allocation for cost reduction, increased productivity, and competitiveness in dynamic industries. The practical implementation of IDHMS in significant Middle Eastern mines underscores its compatibility with multiple brands, scalability, and potential adoption in various industries., The authors wish to thank the Shahdab Mining Company for their support during the course of our activities concerned with the presented system. This research has been funded by the Spanish Ministry of Science and Education under the projects TCO-RISEBLOCK (PID2019-110224RB-I00) and by the Generalitat de Catalunya under grants 2021-SGR00594., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Gpu generation of binary 2-separating codes

  • Fernández Muñoz, Marcel|||0000-0001-7655-135X
  • Martínez Zaldívar, Francisco José
  • García Mollá, Víctor Manuel
  • Simarro Haro, María de los Ángeles
  • Livieratos, John
  • González Salvador, Alberto
This paper addresses the generation of binary 2-separating codes and the study of the code rates that can be achieved in practice. In the case of binary 2-separating codes, there exist lower and upper theoretical bounds in the rates that can be achieved. The generation of 2-separating codes has been studied from a theoretical point of view, but, as far as we know, it has not been tackled from a practical point of view. In this paper, we consider and analyze two different generation algorithms. Both algorithms were implemented in CUDA and executed in GPUs, for the sake of efficiency. The first algorithm is inspired by the Moser–Tardos algorithm, which is based on the Local Lovász Lemma. This algorithm has a strong theoretical appeal; codes obtained through this first algorithm can be shown to match the best known lower bound. To generate codes with rates as large as possible, a second algorithm has been implemented. The rates achieved are larger than those achieved with the first algorithm, but they still are very far from the theoretical upper bound. The results obtained suggest that the theoretical upper bound can probably be improved., This work was supported in part by the Spanish Ministery of Science and Innovation under grant PID2021-125736OB-I00 (MCIN/AEI /10.13039/501100011033/, “ERDF A way of making Europe”), and by GVA under grant CIPROM/2022/20. The work of Marcel Fernández has been supported by TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A review of Tactics, Techniques, and Procedures (TTPs) of MITRE Framework for Business Email Compromise (BEC) attacks

  • Kanj Bongard, Sebastien
  • Garcia Villalta, Pau
  • Rosés, Oriol
  • Pegueroles Vallés, Josep R.|||0000-0002-5194-4883
The MITREATT&CK ®frameworkis aglobally recognized repository of adversarial Tactics, Techniques, and Procedures (TTPs) based on real-world cyber threats. It provides a model for analyzing attack behaviors and enhancing incident attribution. Business Email Compromise (BEC) frauds, a growing cyber threat, exploit email communications for financial gain. However, the MITRE framework is not widely used for BEC, as no custom matrix has been developed specifically for these attacks. This study maps the TTPs used by BEC Threat Actors (TA) within the MITRE ATT&CK framework. The methodology included a review of academic literature, Cyber Threat Intelligence (CTI) reports, and real-world incident responsedatafromINCIDEDigitalDataS.L.Atotalof10tactics,34techniques,and46sub-techniqueswere identified, with 5 new sub-techniques proposed to address gaps, particularly in mailbox manipulation and defense evasion. Additionally, Privilege Escalation, Lateral Movement, and Credential Access tactics were merged due to overlapping techniques, while the Execution tactic was excluded as it is not central to BEC attacks. To demonstrate the utility of the framework, we characterized two real-world TAs: Cosmic Lynx, a sophisticated actor targeting multinational organizations, and Chiffon Herring, a smaller-scale attacker employing simpler methods. These case studies highlight the framework’s adaptability for analyzing diverse TA profiles and its potential to support improved incident attribution, detection, and prevention strategies., This research was funded by the Ministerio de Ciencia y Educación of Spain (MICINN) through the project TCO-RISEBLOCK (PID2019-110224RB-I00) and by the Generalitat de Catalunya with the grant 2021 DI 92., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

DEFS - Data exchange with Free Sample Protocol

  • Genés Durán, Rafael|||0000-0003-2456-2625
  • Hernández Serrano, Juan|||0000-0001-5225-7404
  • Esparza Martín, Óscar|||0000-0002-2593-0162
  • Bellés Muñoz, Marta
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
Distrust between data providers and data consumers is one of the main obstacles hampering digital-data commerce to take off. Data providers want to get paid for what they offer, while data consumers want to know exactly what are they paying for before actually paying for it. In this article, we present a protocol that overcomes this obstacle by building trust based on two main ideas. First, a probabilistic verification protocol, where some random samples of the real dataset are shown to buyers in order to allow them to make an assessment before committing any payment; and second a guaranteed, protected payment process, enforced with smart contracts on a public blockchain, that guarantees the payment of the data if and only if the data provided meets the agreed terms, and that refunds honest players otherwise., The architecture presented in this paper is supported and developed in the context of the i3-MARKET project [?]. The i3-MARKET project is an active European H2020 project focused on developing solutions for building an European data market economy by enhancing current marketplace platforms with innovative technologies (call H2020-ICT-2019-2 with grant agreement number 871754). This work is also supported by the TCO-RISEBLOCK (PID2019-110224RBI00), MINECO/FEDER funded project ARPASAT TEC2015-70197-R and by the Generalitat de Catalunya grant 2014-SGR-1504.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

The impact of connectivity and software in Ethereum validator performance

  • Cortes Goicoechea, Mikel
  • Mohandas Daryanani, Tarun
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
  • Bautista Gómez, Leonardo
Modern public blockchains like Ethereum rely on p2p networks to run distributed and censorship-resistant applications. With its wide adoption, it operates as a highly critical public ledger. On its transition to become more scalable and sustainable, shifting to PoS without sacrificing the security and resilience of PoW, Ethereum offers a range of consensus client implementations to participate in the network. In this paper, we present a methodology to measure the performance of the consensus clients based on the latency to receive messages from the p2p network. The paper includes a study that identifies the incentives and limitations that the network experiences, presenting insights about the latency impact derived from running the different consensus implementations at different locations. Our study highlights the need for a holistic approach to node deployment, where hardware, software, and geographic factors have to be carefully considered. Properly dimensioned hardware is essential to mitigate latency-related performance issues and ensure the reliable operation of beacon nodes, especially in geographically distant locations., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work has been supported by the Lido Ecosystem Grant Organization (LEGO), the Ethereum Foundation under the Research Grant FY21-0356, and Protocol Labs under its Ph.D. Fellowship Program FY22-P2P. By the TCO-RISEBLOCK (PID2019-110224RB-I00) and the project CHAISE-Erasmus+: blockchain skills for Europe., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Evaluation of TCP congestion control algorithms with traffic control policies in a PEP-based geosynchronous satellite scenario

  • Ramos López, Daniel
  • Esparza Martín, Óscar|||0000-0002-2593-0162
  • Mata Diaz, Jorge|||0000-0003-4831-0588
  • Alins Delgado, Juan José|||0000-0001-8214-4056
© 2024 Elsevier. This manuscript version is made available under the Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/, Much work has been done in recent years comparing TCP variants in many scenarios, including the satellite one. Some of these studies were carried out with the ns-2 and ns-3 simulators, which may give a good idea of the behavior of these TCP variants, although the results cannot be considered completely realistic. Some of the latest studies use virtualization to derive a variety of measures to test the suitability of Congestion Control Algorithms in a more realistic way. Such studies also take into account new variants of TCP, such as Google’s BBR. However, few of these works have evaluated the behavior of these variants in a scenario based on Performance Enhancing Proxies. Furthermore, no emphasis has been placed on those variants of TCP that try to maximize throughput and minimize delay, which is crucial in many services with low latency requirements. Our paper aims to fill this gap, offering a comparative assessment of the performance of these three TCP flavors: BBR, YeAH and CUBIC. We have created four different approaches to mix these TCP flavors with two traffic control techniques, including Active Queue Management (AQM) policies. To perform the testings, we have developed a TCP-Splitting satellite Emulation Framework (TSEF), a platform that allows us to evaluate the performance of TCP flavors on the forward channel of a geosynchronous satellite scenario based on Performance Enhancing Proxies (PEPs). According to our results, we can conclude that the application of AQM policies and ECN marks on aggressive TCP flavors like CUBIC is mandatory to maximize throughput and minimize delay., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

A protocol for data exchange with free samples using smart contracts

  • Genés Durán, Rafael|||0000-0003-2456-2625
  • Hernández Serrano, Juan|||0000-0001-5225-7404
  • Esparza Martín, Óscar|||0000-0002-2593-0162
  • Soriano Ibáñez, Miguel|||0000-0003-0457-8531
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
  • Bellés Muñoz, Marta
Distrust between data providers and data consumers is one of the main obstacles hampering digitaldata commerce to take off. Data providers want to get paid for what they offer, while data consumers want to know exactly what are they paying for before actually paying for it. In this paper, we summarize a protocol that overcomes this obstacle by building trust based on two main ideas. First, a probabilistic verification protocol, where some random samples of the real dataset are shown to buyers in order to allow them to make an assessment before committing any payment; and second a guaranteed, protected payment process, enforced with smart contracts on a public blockchain, that guarantees the payment of the data if and only if the data provided meets the agreed terms, and that refunds honest players otherwise., This research has been funded by i3Market (H2020- ICT-2019-2 grant number 871754). This work is also supported by the TCO-RISEBLOCK (PID2019-110224RBI00), ARPASAT (TEC2015-70197-R), Project RTI2018- 102112-B-I00 (AEI/FEDER,UE) and by the Generalitat de Catalunya grant 2014-SGR-1504
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Vulnerabilidades del mecanismo de posicionamiento Wi-Fi RTT

  • León Abarca, Olga|||0000-0003-2869-051X
  • Zola, Enrica Valeria|||0000-0001-6067-729X
El mecanismo de posicionamiento Wi-Fi RTT es uno de los principales candidatos para posicionamiento en interiores desde que Google ha apostado por integrarlo en sus terminales a partir de Android 9. Considerada la elevada penetración de la tecnología Wi-Fi, el uso de la misma para posicionamiento permite ofrecer una solución de bajo coste en múltiples entornos. Además, muchos estudios avalan su elevada precisión en la mayoría de los escenarios contemplados. Es por ello que, recientemente, se ha considerado su uso también en entornos sanitarios, integrándolo en dispositivos IoT. Sin embargo, este mecanismo prevé el envío de mensajes en claro entre dispositivos que no se han tenido que autenticar en la red, lo que abre una brecha para que usuarios malintencionados hagan uso de ello de manera fraudulenta. Este artículo analiza la seguridad de Wi-Fi RTT y discute algunas posibles contramedidas., Este trabajo ha sido co-financiado con los fondos del Plan de Recuperacion, Transformación y Resiliencia, financiado por la Unión Europea (Next Generation), bajo el auspicio de la Cátedra INCIBE de Ciberseguridad denominada CARISMATICA; por el Ministerio de Ciencia y Educación con el proyecto TCO-RISEBLOCK (PID2019-110224RB-I00); y por la Generalitat de Catalunya con la subvención 2021-SGR-00594.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Técnicas de Machine Learning para la detección de ciberataques en redes IoT médicas

  • Alarcón García-Saavedra, Antonio|||0009-0003-3556-1561
  • León Abarca, Olga|||0000-0003-2869-051X
  • Pegueroles Vallés, Josep R.|||0000-0002-5194-4883
  • Doménech Fons, Jordi|||0000-0002-2977-7265
Los dispositivos del Internet de las Cosas Médicas (en inglés Internet of Medical Things – IoMT), supervisan en tiempo real el estado de salud, incluyendo en algunos casos el suministro terapéutico. Estos dispositivos presentan vulnerabilidades críticas que suponen una amenaza para la privacidad de los datos y la integridad física de los pacientes. En este trabajo se presenta cómo las técnicas de ML son eficientes para la detección de ciberataques en redes de Internet de las Cosas Médicas. A partir de un dataset público de tráfico de red IoMT se han entrenado algoritmos conocidos de ML para evaluar su eficiencia y requerimientos computacionales y temporales. Se concluye que, para este tipo de redes, las técnicas sencillas de ML son herramientas útiles para el diseño de sistemas de detección de intrusión ligeros. El trabajo propone una matriz de asignación para distintos ataques y técnicas ML, dadas unas restricciones de eficiencia mínimas., Cabe destacar que esta iniciativa se lleva a cabo en el marco de los fondos del Plan de Recuperación, Transformación y Resiliencia financiado por la Unión Europea (Next Generation), bajo el auspicio de la Cátedra INCIBE de Ciberseguridad denominada CARISMATICA, así como el proyecto TCO-RISEBLOCK (PID2019-110224RB-I00) del ministerio de ciencia e innovación (MICINN)
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Decentralized factoring for self-sovereign identities

  • Mohammadzadeh, Nasibeh|||0000-0001-5950-0964
  • Nogoorani, Sadegh Dorri
  • Muñoz Tapia, José Luis|||0000-0001-6442-437X
Invoice factoring is a handy tool for developing businesses that face liq- uidity problems. The main property that a factoring system needs to fulfill is to prevent an invoice from being factored twice. Distributed ledger tech- nology is suitable for implementing the platform to register invoice factor- ing agreements and prevent double-factoring. Several works have been proposed to use this technology for invoice factoring. However, current proposals lack in one or several aspects such as decentralization and secu- rity against corruption, protecting business and personally identifiable in- formation (PII), providing non-repudiation for handling disputes, Know- Your-Customer (KYC) compliance, easy user on-boarding, and being cost- efficient. In this article, a factoring registration protocol is proposed for invoice factoring registration based on a public distributed ledger which adheres to the before-mentioned requirements. We include a relayer in our architecture to address the entry barrier that the users have due to the need of managing cryptocurrencies for interacting with the public ledger. Moreover, we leverage the concept of Verifiable Credentials (VCs) for KYC compliance, and allow parties to implement their self-sovereign identities by using decentralized identifiers (DIDs). DIDs enable us to relay on the DIDComm protocol for asynchronous and secure off-chain communica- tions. We analyze our protocol from several security aspects, compare it to the related work, and study a possible business use case. Our evalu- ations demonstrate that our proposal is secure and efficient, and covers requirements not addressed by existing related work., This research has been funded by i3Market (H2020-ICT-2019-2 grant number 871754). This work is also supported by the TCO-RISEBLOCK (PID2019-110224RB-I00), ARPASAT (TEC2015- 70197-R), and by the Generalitat de Catalunya grant 2014-SGR-1504., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Frameproof codes, separable codes and B2 codes: bounds and constructions

  • Fernández Muñoz, Marcel|||0000-0001-7655-135X
  • Livieratos, John
  • Martín Mollevi, Sebastià|||0000-0002-9799-6793
In this paper, constructions of frameproof codes, separable codes, and B2 codes are obtained. For each family of codes, the Lovász Local Lemmais used to establish lower bounds for the codes. The obtained bounds match all best known bounds in the literature. Our strategy allows us to present constructions of the aforementioned codes, by using the variable framework for the Lovász Local Lemma., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. The work of Marcel Fernández has been supported by TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO. The work of Sebastiá Martín has been supported by Ministerio de Ciencia e Innovación, PID2019-109379RB-I00., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

XSS vulnerability test enhancement for Progressive Web Applications

  • Pegueroles Vallés, Josep R.|||0000-0002-5194-4883
  • Kanj Bongard, Sebastien
  • Estebanell Castellví, Arnau
Progressive Web Applications produce false negative results when scanned with security vulnerability scanners. In this paper the author will investigate the causes behind vulnerability scanners missing simple vulnerabilities when being used on Progressive Web Applications (PWAs). Moreover, an analysis of the caveats of only having fully automated vulnerability scans and manual pentests, without a semi-automatic tool covering the gap between the two, will be performed. An explanation of how such tool has been built will be delivered at the end of the paper., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Análisis forense de la herramienta de tunelado de puertos Ngrok

  • Kanj Bongard, Sebastien
  • Navarro, Carlos
  • Pasamar, Abraham
  • Rosés, Oriol
  • Pegueroles Vallés, Josep R.|||0000-0002-5194-4883
Las herramientas de tunelado, como Ngrok, permiten publicar a Internet puertos de interés camuflados en protocolos frecuentes y habitualmente permitidos en infraestructuras corporativas. Usando servidores proxy se evita realizar acciones en sistemas de red perimetrales y configuraciones adicionales en equipos finales. Esta funcionalidad es aprovechada porThreat Actors de ransomware para usar protocolos de control remoto, comoRDP, o protocolos de exfiltración, como FTP, en sus ataques, evadiendo las políticas de seguridad de red. En este artículo se realiza una investigación de los rastros que esta técnica evasiva deja en los equipos a fin de mejorar el análisis forense de incidentes de ransomware, proponiendo mecanismos de identificación y subrayando los artefactos útiles para su análisis, Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Circom: a circuit description language for building zero-knowledge applications

  • Bellés Muñoz, Marta
  • Isabel, Miguel
  • Muñoz Tapia, José Luis
  • Rubio Gimeno, Alberto
  • Baylina Melé, Jordi
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., A zero-knowledge (ZK) proof guarantees that the result of a computation is correct while keeping part of the computation details private. Some ZK proofs are tiny and can be verified in short time, which makes them one of the most promising technologies for solving two key aspects: the challenge of enabling privacy to public and transparent distributed ledgers and enhancing their scalability limitations. Most practical ZK systems require the computation to be expressed as an arithmetic circuit that is encoded as a set of equations called rank-1 constraint system (R1CS). In this paper, we present Circom , a programming language and a compiler for designing arithmetic circuits that are compiled to R1CS. More precisely, with Circom , programmers can design arithmetic circuits at a constraint level, and the compiler outputs a file with the R1CS description, and WebAssembly and C++ programs to efficiently compute all values of the circuit. We also provide an open-source library called circomlib with multiple circuit templates. Circom can be complemented with snarkjs , a library for generating and validating ZK proofs from R1CS. Altogether, our software tools abstract the complexity of ZK proving mechanisms and provide a unique and friendly interface to model low-level descriptions of arithmetic circuits., This work was supported in part by the Ethereum Foundation Ecosystem Support [68], TCO-RISEBLOCK under Grants PID2019-110224RB-I00, PID2021-128521OB-I00, and PID2021-122830OB-C41, in part by CHAISEErasmus+: blockchain skills for Europe, the Spanish MCIU, AEI and FEDER (EU) project under Grant RTI2018-094403-B-C31, and in part by the CM projects under Grant S2018/TCS-4314 co-funded by EIE Funds of the European Union., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

XSS vulnerability test enhancement for Progressive Web Applications

  • Pegueroles Vallés, Josep R.
  • Kanj Bongard, Sebastien
  • Estebanell Castellví, Arnau
Progressive Web Applications produce false negative results when scanned with security vulnerability scanners. In this paper the author will investigate the causes behind vulnerability scanners missing simple vulnerabilities when being used on Progressive Web Applications (PWAs). Moreover, an analysis of the caveats of only having fully automated vulnerability scans and manual pentests, without a semi-automatic tool covering the gap between the two, will be performed. An explanation of how such tool has been built will be delivered at the end of the paper., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

New privacy practices for blockchain software

  • Bellés Muñoz, Marta
  • Baylina Melé, Jordi
  • Daza Fernández, Vanesa
  • Muñoz Tapia, José Luis
© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., The benefits of blockchain technologies for industrial applications are unquestionable. However, it is a considerable challenge to use a transparent system like blockchain and at the same time provide privacy to sensitive data. Privacy technologies permit conducting private transactions about sensitive data over transparent networks, but their inherent complexity has been overwhelming for many developers. Closing the gap between developers and privacy-preserving technologies would help to the full adoption of the privacy by design framework for blockchain software. To this end, in this paper we present the software tools we have implemented to bring complex privacy technologies closer to developers and facilitate the job of implementing privacy-enabled blockchain applications., This research is supported by the Ethereum Foundation Ecosystem Support [9], TCO-RISEBLOCK (PID2019-110224RB-I00), H2020-i3-MARKET, ARPASAT (TEC2015-70197-R), 2014-SGR-1504, RTI2018-102112-B-I00 (AEI/FEDER,UE) and H2020 PRESENT (856879)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The impact of connectivity and software in Ethereum validator performance

  • Cortes Goicoechea, Mikel
  • Mohandas Daryanani, Tarun
  • Muñoz Tapia, José Luis
  • Bautista Gómez, Leonardo
Modern public blockchains like Ethereum rely on p2p networks to run distributed and censorship-resistant applications. With its wide adoption, it operates as a highly critical public ledger. On its transition to become more scalable and sustainable, shifting to PoS without sacrificing the security and resilience of PoW, Ethereum offers a range of consensus client implementations to participate in the network. In this paper, we present a methodology to measure the performance of the consensus clients based on the latency to receive messages from the p2p network. The paper includes a study that identifies the incentives and limitations that the network experiences, presenting insights about the latency impact derived from running the different consensus implementations at different locations. Our study highlights the need for a holistic approach to node deployment, where hardware, software, and geographic factors have to be carefully considered. Properly dimensioned hardware is essential to mitigate latency-related performance issues and ensure the reliable operation of beacon nodes, especially in geographically distant locations., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work has been supported by the Lido Ecosystem Grant Organization (LEGO), the Ethereum Foundation under the Research Grant FY21-0356, and Protocol Labs under its Ph.D. Fellowship Program FY22-P2P. By the TCO-RISEBLOCK (PID2019-110224RB-I00) and the project CHAISE-Erasmus+: blockchain skills for Europe., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Evaluation of TCP congestion control algorithms with traffic control policies in a PEP-based geosynchronous satellite scenario

  • Ramos López, Daniel
  • Esparza Martín, Óscar
  • Mata Diaz, Jorge
  • Alins Delgado, Juan José
© 2024 Elsevier. This manuscript version is made available under the Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/, Much work has been done in recent years comparing TCP variants in many scenarios, including the satellite one. Some of these studies were carried out with the ns-2 and ns-3 simulators, which may give a good idea of the behavior of these TCP variants, although the results cannot be considered completely realistic. Some of the latest studies use virtualization to derive a variety of measures to test the suitability of Congestion Control Algorithms in a more realistic way. Such studies also take into account new variants of TCP, such as Google’s BBR. However, few of these works have evaluated the behavior of these variants in a scenario based on Performance Enhancing Proxies. Furthermore, no emphasis has been placed on those variants of TCP that try to maximize throughput and minimize delay, which is crucial in many services with low latency requirements. Our paper aims to fill this gap, offering a comparative assessment of the performance of these three TCP flavors: BBR, YeAH and CUBIC. We have created four different approaches to mix these TCP flavors with two traffic control techniques, including Active Queue Management (AQM) policies. To perform the testings, we have developed a TCP-Splitting satellite Emulation Framework (TSEF), a platform that allows us to evaluate the performance of TCP flavors on the forward channel of a geosynchronous satellite scenario based on Performance Enhancing Proxies (PEPs). According to our results, we can conclude that the application of AQM policies and ECN marks on aggressive TCP flavors like CUBIC is mandatory to maximize throughput and minimize delay., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Comprehensive IoT-driven fleet management system for industrial vehicles

  • Farahpoor, MohammadaliI
  • Esparza Martín, Óscar
  • Soriano Ibáñez, Miguel
© 2023 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., In the context of fleet management, various challenges, including equipment breakdowns, rising maintenance costs, inefficient resource utilization, and outdated telematics systems, necessitate a transformative approach. Traditional telematics systems encounter limitations such as closed compatibility with specific brands, unique network protocols, and insufficient data analysis and decision-making support. Therefore, these challenges can be addressed by using IoT-driven solutions. This paper introduces an IoT-driven system called the "intelligent dispatching and health monitoring system" (IDHMS), which is designed to enhance fleet operations in industries such as mining, construction, and agriculture while addressing issues related to legacy telematics systems. The architecture of IDHMS is a comprehensive IoT-driven framework that integrates embedded hardware, cloud-based software, and flexible network infrastructure. This system facilitates real-time communication, gathering and analysis of data, and decision-making for fleet management in such industries. The IDHMS addresses the limitations of conventional telematics systems by offering standardized protocols, open APIs, robust security measures, comprehensive data analytics capabilities, and a multipurpose ecosystem. Its data-driven insights empower informed decision-making, drive continuous improvement, and enable strategic resource allocation for cost reduction, increased productivity, and competitiveness in dynamic industries. The practical implementation of IDHMS in significant Middle Eastern mines underscores its compatibility with multiple brands, scalability, and potential adoption in various industries., The authors wish to thank the Shahdab Mining Company for their support during the course of our activities concerned with the presented system. This research has been funded by the Spanish Ministry of Science and Education under the projects TCO-RISEBLOCK (PID2019-110224RB-I00) and by the Generalitat de Catalunya under grants 2021-SGR00594., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

A protocol for data exchange with free samples using smart contracts

  • Genés Durán, Rafael
  • Hernández Serrano, Juan
  • Esparza Martín, Óscar
  • Soriano Ibáñez, Miguel
  • Muñoz Tapia, José Luis
  • Bellés Muñoz, Marta
Distrust between data providers and data consumers is one of the main obstacles hampering digitaldata commerce to take off. Data providers want to get paid for what they offer, while data consumers want to know exactly what are they paying for before actually paying for it. In this paper, we summarize a protocol that overcomes this obstacle by building trust based on two main ideas. First, a probabilistic verification protocol, where some random samples of the real dataset are shown to buyers in order to allow them to make an assessment before committing any payment; and second a guaranteed, protected payment process, enforced with smart contracts on a public blockchain, that guarantees the payment of the data if and only if the data provided meets the agreed terms, and that refunds honest players otherwise., This research has been funded by i3Market (H2020- ICT-2019-2 grant number 871754). This work is also supported by the TCO-RISEBLOCK (PID2019-110224RBI00), ARPASAT (TEC2015-70197-R), Project RTI2018- 102112-B-I00 (AEI/FEDER,UE) and by the Generalitat de Catalunya grant 2014-SGR-1504, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Invoice factoring registration based on a public blockchain

  • Mohammadzadeh, Nasibeh
  • Nogoorani, Sadegh Dorri
  • Muñoz Tapia, José Luis
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works., Invoice factoring is a very useful tool for developing businesses that face liquidity problems. The main property that a factoring system needs to fulfill is to prevent an invoice from being factored twice. In order to prevent double factoring, many factoring ecosystems use one or several centralized entities to register factoring agreements. However, this puts a lot of power in the hands of these centralized entities and makes it difficult for users to dispute situations in which factoring data is unavailable, wrongly recorded or manipulated by negligence or on purpose. In this article, we propose an architecture for invoice factoring registration based on a public blockchain. To solve the aforementioned drawbacks, we replace the trusted third parties for factoring registration with a smart contract. Using a smart contract, we record digital evidence of the terms and conditions of factoring agreements in explicit detail, allowing auditability and dispute resolution. Relevant information is highly available on the blockchain while its privacy is protected. The registration is optimal, since it needs only one blockchain transaction and one key-value storage per invoice factoring., This work was supported in part by the TCO-RISEBLOCK under Grant PID2019-110224RB-I00, in part by the H2020-i3-MARKET, and in part by the ARPASAT under Grant TEC2015-70197-R and Grant 2014-SGR-1504, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Can we run our Ethereum nodes at home?

  • Cortes Goicoechea, Mikel
  • Mohandas Daryanani, Tarun
  • Muñoz Tapia, José Luis
  • Bautista Gómez, Leonardo
Scalability is a common issue among the most used permissionless blockchains, and several approaches have been proposed to solve it. However, tackling scalability while preserving the security and decentralization of the network is a significant challenge. To deliver effective scaling solutions, Ethereum achieved a significant protocol improvement, including a change in the consensus mechanism towards Proof of Stake. This improvement greatly reduced the hardware requirements to run a node, leading to significant sustainability benefits with a lower network energy consumption. This work analyzes the resource usage behaviour of different clients running as Ethereum consensus nodes, comparing their performance under different configurations and analyzing their differences. Our results show higher requirements than initially claimed and show how different clients react to network perturbations. Furthermore, we discuss the differences between the consensus clients, including their strong points and limitations., This work was supported in part by the Lido Ecosystem Grant Organization (LEGO), in part by Spanish TCO-RISEBLOCK Project under Grant PID2019-110224RB-I00, in part by the Ethereum Foundation under the Research Grant FY21-0356, and in part by Protocol Labs under its Ph.D. Fellowship Program under Grant FY22-P2P., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Frameproof codes, separable codes and B2 codes: bounds and constructions

  • Fernández Muñoz, Marcel
  • Livieratos, John
  • Martín Mollevi, Sebastià
In this paper, constructions of frameproof codes, separable codes, and B2 codes are obtained. For each family of codes, the Lovász Local Lemmais used to establish lower bounds for the codes. The obtained bounds match all best known bounds in the literature. Our strategy allows us to present constructions of the aforementioned codes, by using the variable framework for the Lovász Local Lemma., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. The work of Marcel Fernández has been supported by TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO. The work of Sebastiá Martín has been supported by Ministerio de Ciencia e Innovación, PID2019-109379RB-I00., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Vulnerabilidades del mecanismo de posicionamiento Wi-Fi RTT

  • León Abarca, Olga
  • Zola, Enrica Valeria
El mecanismo de posicionamiento Wi-Fi RTT es uno de los principales candidatos para posicionamiento en interiores desde que Google ha apostado por integrarlo en sus terminales a partir de Android 9. Considerada la elevada penetración de la tecnología Wi-Fi, el uso de la misma para posicionamiento permite ofrecer una solución de bajo coste en múltiples entornos. Además, muchos estudios avalan su elevada precisión en la mayoría de los escenarios contemplados. Es por ello que, recientemente, se ha considerado su uso también en entornos sanitarios, integrándolo en dispositivos IoT. Sin embargo, este mecanismo prevé el envío de mensajes en claro entre dispositivos que no se han tenido que autenticar en la red, lo que abre una brecha para que usuarios malintencionados hagan uso de ello de manera fraudulenta. Este artículo analiza la seguridad de Wi-Fi RTT y discute algunas posibles contramedidas., Este trabajo ha sido co-financiado con los fondos del Plan de Recuperacion, Transformación y Resiliencia, financiado por la Unión Europea (Next Generation), bajo el auspicio de la Cátedra INCIBE de Ciberseguridad denominada CARISMATICA; por el Ministerio de Ciencia y Educación con el proyecto TCO-RISEBLOCK (PID2019-110224RB-I00); y por la Generalitat de Catalunya con la subvención 2021-SGR-00594., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

DEFS - Data exchange with Free Sample Protocol

  • Genés Durán, Rafael
  • Hernández Serrano, Juan
  • Esparza Martín, Óscar
  • Bellés Muñoz, Marta
  • Muñoz Tapia, José Luis
Distrust between data providers and data consumers is one of the main obstacles hampering digital-data commerce to take off. Data providers want to get paid for what they offer, while data consumers want to know exactly what are they paying for before actually paying for it. In this article, we present a protocol that overcomes this obstacle by building trust based on two main ideas. First, a probabilistic verification protocol, where some random samples of the real dataset are shown to buyers in order to allow them to make an assessment before committing any payment; and second a guaranteed, protected payment process, enforced with smart contracts on a public blockchain, that guarantees the payment of the data if and only if the data provided meets the agreed terms, and that refunds honest players otherwise., The architecture presented in this paper is supported and developed in the context of the i3-MARKET project [?]. The i3-MARKET project is an active European H2020 project focused on developing solutions for building an European data market economy by enhancing current marketplace platforms with innovative technologies (call H2020-ICT-2019-2 with grant agreement number 871754). This work is also supported by the TCO-RISEBLOCK (PID2019-110224RBI00), MINECO/FEDER funded project ARPASAT TEC2015-70197-R and by the Generalitat de Catalunya grant 2014-SGR-1504., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A review of Tactics, Techniques, and Procedures (TTPs) of MITRE Framework for Business Email Compromise (BEC) attacks

  • Kanj Bongard, Sebastien
  • Garcia Villalta, Pau
  • Rosés, Oriol
  • Pegueroles Vallés, Josep R.
The MITREATT&CK ®frameworkis aglobally recognized repository of adversarial Tactics, Techniques, and Procedures (TTPs) based on real-world cyber threats. It provides a model for analyzing attack behaviors and enhancing incident attribution. Business Email Compromise (BEC) frauds, a growing cyber threat, exploit email communications for financial gain. However, the MITRE framework is not widely used for BEC, as no custom matrix has been developed specifically for these attacks. This study maps the TTPs used by BEC Threat Actors (TA) within the MITRE ATT&CK framework. The methodology included a review of academic literature, Cyber Threat Intelligence (CTI) reports, and real-world incident responsedatafromINCIDEDigitalDataS.L.Atotalof10tactics,34techniques,and46sub-techniqueswere identified, with 5 new sub-techniques proposed to address gaps, particularly in mailbox manipulation and defense evasion. Additionally, Privilege Escalation, Lateral Movement, and Credential Access tactics were merged due to overlapping techniques, while the Execution tactic was excluded as it is not central to BEC attacks. To demonstrate the utility of the framework, we characterized two real-world TAs: Cosmic Lynx, a sophisticated actor targeting multinational organizations, and Chiffon Herring, a smaller-scale attacker employing simpler methods. These case studies highlight the framework’s adaptability for analyzing diverse TA profiles and its potential to support improved incident attribution, detection, and prevention strategies., This research was funded by the Ministerio de Ciencia y Educación of Spain (MICINN) through the project TCO-RISEBLOCK (PID2019-110224RB-I00) and by the Generalitat de Catalunya with the grant 2021 DI 92., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Análisis forense de la herramienta de tunelado de puertos Ngrok

  • Kanj Bongard, Sebastien
  • Navarro, Carlos
  • Pasamar, Abraham
  • Rosés, Oriol
  • Pegueroles Vallés, Josep R.
Las herramientas de tunelado, como Ngrok, permiten publicar a Internet puertos de interés camuflados en protocolos frecuentes y habitualmente permitidos en infraestructuras corporativas. Usando servidores proxy se evita realizar acciones en sistemas de red perimetrales y configuraciones adicionales en equipos finales. Esta funcionalidad es aprovechada porThreat Actors de ransomware para usar protocolos de control remoto, comoRDP, o protocolos de exfiltración, como FTP, en sus ataques, evadiendo las políticas de seguridad de red. En este artículo se realiza una investigación de los rastros que esta técnica evasiva deja en los equipos a fin de mejorar el análisis forense de incidentes de ransomware, proponiendo mecanismos de identificación y subrayando los artefactos útiles para su análisis, Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Gpu generation of binary 2-separating codes

  • Fernández Muñoz, Marcel
  • Martínez Zaldívar, Francisco José
  • García Mollá, Víctor Manuel
  • Simarro Haro, María de los Ángeles
  • Livieratos, John
  • González Salvador, Alberto
This paper addresses the generation of binary 2-separating codes and the study of the code rates that can be achieved in practice. In the case of binary 2-separating codes, there exist lower and upper theoretical bounds in the rates that can be achieved. The generation of 2-separating codes has been studied from a theoretical point of view, but, as far as we know, it has not been tackled from a practical point of view. In this paper, we consider and analyze two different generation algorithms. Both algorithms were implemented in CUDA and executed in GPUs, for the sake of efficiency. The first algorithm is inspired by the Moser–Tardos algorithm, which is based on the Local Lovász Lemma. This algorithm has a strong theoretical appeal; codes obtained through this first algorithm can be shown to match the best known lower bound. To generate codes with rates as large as possible, a second algorithm has been implemented. The rates achieved are larger than those achieved with the first algorithm, but they still are very far from the theoretical upper bound. The results obtained suggest that the theoretical upper bound can probably be improved., This work was supported in part by the Spanish Ministery of Science and Innovation under grant PID2021-125736OB-I00 (MCIN/AEI /10.13039/501100011033/, “ERDF A way of making Europe”), and by GVA under grant CIPROM/2022/20. The work of Marcel Fernández has been supported by TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A study of the separating property in Reed-Solomon codes by bounding the minimum distance

  • Fernández Muñoz, Marcel
  • Jiménez Urroz, Jorge
The version of record is available online at: http://dx.doi.org/10.1007/s10623-021-00988-z, According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that, if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper, further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property., This work has been supported by the Spanish Government Grant TCO-RISEBLOCK (PID2019-110224RB-I00) MINECO ., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Stochastic simplicial contagion model

  • Hernández Serrano, Daniel
  • Villarroel Rodríguez, Francisco Javier
  • Hernández Serrano, Juan
  • Tocino García, Ángel Andrés
We propose a stochastic model that describes of epidemics over simplicial complex networks (SSCM) in which higher-order unforeseen or random interactions may occur. Its dynamics obeys a stochastic differential equation (SDE) based on the mean field approach of the simplicial social contagion model. In this stochastic regime the only possible equilibrium state is the origin. We give conditions to guarantee global stability and hence that the disease dies out. We partition the parameter space into the instability, the bi-stability and the globally asymptotically stable regions described in terms of appropriate epidemiological parameters. These regimes codify whether the disease will, can or will not disappear. We also present empirical results obtained by running different simulations of the SSCM over several real-world simplicial networks and over a synthetically generated one, which validate the theoretical results presented., D.H.S. is supported by Grant PID2021-128665NB-I00 funded by MCIN/AEI/ 10.13039/501100011033 and, as appropriate, by \ERDF A way of making Eu- rope", Ministerio de Econom a y Competitividad (Spain) under grant MTM2017- 86042-P, the project STAMGAD 18.J445 / 463AC03 by Consejer a de Edu- caci on (GIR, Junta de Castilla y Le on, Spain) and by Universidad de Sala- manca (Spain) under project PIC2-2021-10. J.H.S. is supported by the Span- ish Ministry of Science and Education under the project TCO-RISEBLOCK (PID2019-110224RB-I00), the European Union's H2020 Research and Innova- tion Programme under the Grant Agreement No. 871754 (i3-MARKET), and the Generalitat de Catalunya grant 2017-SGR-00782., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Técnicas de Machine Learning para la detección de ciberataques en redes IoT médicas

  • Alarcón García-Saavedra, Antonio
  • León Abarca, Olga
  • Pegueroles Vallés, Josep R.
  • Doménech Fons, Jordi
Los dispositivos del Internet de las Cosas Médicas (en inglés Internet of Medical Things – IoMT), supervisan en tiempo real el estado de salud, incluyendo en algunos casos el suministro terapéutico. Estos dispositivos presentan vulnerabilidades críticas que suponen una amenaza para la privacidad de los datos y la integridad física de los pacientes. En este trabajo se presenta cómo las técnicas de ML son eficientes para la detección de ciberataques en redes de Internet de las Cosas Médicas. A partir de un dataset público de tráfico de red IoMT se han entrenado algoritmos conocidos de ML para evaluar su eficiencia y requerimientos computacionales y temporales. Se concluye que, para este tipo de redes, las técnicas sencillas de ML son herramientas útiles para el diseño de sistemas de detección de intrusión ligeros. El trabajo propone una matriz de asignación para distintos ataques y técnicas ML, dadas unas restricciones de eficiencia mínimas., Cabe destacar que esta iniciativa se lleva a cabo en el marco de los fondos del Plan de Recuperación, Transformación y Resiliencia financiado por la Unión Europea (Next Generation), bajo el auspicio de la Cátedra INCIBE de Ciberseguridad denominada CARISMATICA, así como el proyecto TCO-RISEBLOCK (PID2019-110224RB-I00) del ministerio de ciencia e innovación (MICINN), Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

An algorithmic construction of union-intersection-bounded families

  • Fernández Muñoz, Marcel
  • Livieratos, John
  • Martín Mollevi, Sebastià
© 2024 Elsevier. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/, In this paper, we present lower bounds and algorithmic constructions of union-intersection-bounded families of sets. The lower bound is established using the Lovász Local Lemma. This bound matches the best known bound for the size of union-intersection-bounded families of sets. We then use the variable framework for the Lovász Local Lemma, to discuss an algorithm that outputs explicit constructions that attain the lower bound. The algorithm has polynomial complexity in the number of points in the family., The authors declare the following financial interests/personal relationships which may be considered as potential competing interests: Sebastia Martin reports financial support was provided by Spain Ministry of Science and Innovation (PID2019-109379RB-I00). Marcel Fernandez reports financial support was provided by Government of Spain Ministry of Finance and Public Administration (PID2019-110224RB-I00)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

DA2Wa: un protocolo de emparejamiento seguro entre DApp y wallet para el escenario blockchain

  • Román García, Fernando
  • Alarcón García-Saavedra, Antonio
  • Hernández Serrano, Juan
  • Esparza Martín, Óscar
Las aplicaciones descentralizadas (decentralized ap-plications - DApps) hacen uso de tecnologías blockchain para operar de forma autónoma y completamente distribuida. La interacción con la blockchain requiere el uso de material criptográfico que se debe proteger y gestionar de forma segura. Precisamente las aplicaciones de billetera o simplemente wallets se encargan de resolver ese reto. Las DApps necesitan, por tanto, conectarse de forma segura a un wallet. En el estado del arte han aparecido diferentes soluciones para realizar esta interconexión, pero hasta ahora o bien relajan las políticas de seguridad o requieren el uso de infraestructura externa. Este artículo resume DA2Wa, un protocolo diseñado para establecer un emparejamiento seguro entre un wallet de criptomonedas y una DApp, ambas funcionando como aplicaciones aisladas en la misma máquina. El protocolo utiliza un mecanismo de intercambio de PIN de seis caracteres, ofreciendo un nivel de seguridad equivalente al del protocolo de emparejamiento de Bluetooth., Esta investigación ha sido financiada por i3-MARKET (H2020-ICT-2019-2, numero de subvención 871754), por el Ministerio de Ciencia y Educación de España bajo el proyecto˜ TCO-RISEBLOCK (PID2019-110224RB-I00) y, finalmente, por la Generalitat de Catalunya bajo la subvención 2021-SGR-00594. Cabe destacar que esta iniciativa se lleva a cabo en el marco de los fondos del Plan de Recuperación, Transformación y Resiliencia, financiado por la Unión Europea (Next Generation), bajo la Cátedra de Ciberseguridad INCIBE llamada CARISMATICA., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Decentralized factoring for self-sovereign identities

  • Mohammadzadeh, Nasibeh
  • Nogoorani, Sadegh Dorri
  • Muñoz Tapia, José Luis
Invoice factoring is a handy tool for developing businesses that face liq- uidity problems. The main property that a factoring system needs to fulfill is to prevent an invoice from being factored twice. Distributed ledger tech- nology is suitable for implementing the platform to register invoice factor- ing agreements and prevent double-factoring. Several works have been proposed to use this technology for invoice factoring. However, current proposals lack in one or several aspects such as decentralization and secu- rity against corruption, protecting business and personally identifiable in- formation (PII), providing non-repudiation for handling disputes, Know- Your-Customer (KYC) compliance, easy user on-boarding, and being cost- efficient. In this article, a factoring registration protocol is proposed for invoice factoring registration based on a public distributed ledger which adheres to the before-mentioned requirements. We include a relayer in our architecture to address the entry barrier that the users have due to the need of managing cryptocurrencies for interacting with the public ledger. Moreover, we leverage the concept of Verifiable Credentials (VCs) for KYC compliance, and allow parties to implement their self-sovereign identities by using decentralized identifiers (DIDs). DIDs enable us to relay on the DIDComm protocol for asynchronous and secure off-chain communica- tions. We analyze our protocol from several security aspects, compare it to the related work, and study a possible business use case. Our evalu- ations demonstrate that our proposal is secure and efficient, and covers requirements not addressed by existing related work., This research has been funded by i3Market (H2020-ICT-2019-2 grant number 871754). This work is also supported by the TCO-RISEBLOCK (PID2019-110224RB-I00), ARPASAT (TEC2015- 70197-R), and by the Generalitat de Catalunya grant 2014-SGR-1504., Peer Reviewed, Postprint (published version)