Pasar al contenido principal

Resultados relacionados

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

Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Efficient TFHE bootstrapping in the multiparty setting

  • Park, Jeongeun
  • Rovira, Sergi
TFHE is a practical fully homomorphic encryption scheme (FHE) capable of computing any boolean gate or non-linear function. The scheme was originally designed to work for the single key setting. To implement realistic application scenarios, it is necessary to extend it to handle multiple users. In this paper, we introduce a new approach to generate TFHE bootstrapping keys for (predefined) multiple users. Hence, a fixed number of users can enjoy the same level of efficiency as in the single key setting, keeping their individual input privacy. Our construction relies on a novel algorithm called homomorphic indicator, which can be of independent interest. We provide a detailed analysis of the noise growth and a set of secure parameters suitable to be used in practice. Moreover, we compare the complexity of our technique with other state-of-the-art constructions and show which method performs better depending on the parameter sets. We also provide a prototype implementation of our technique. To the best of our knowledge, this is the first implementation of TFHE in the multiparty setting., CyberSecurity Research Flanders (Grant Number: VR20192203), 10.13039/501100003329-Spanish Ministry of Economy and Competitiveness (Grant Number: RTI2018-102112-B-I00).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

SoK: network-level attacks on the bitcoin P2P network

  • Franzoni, Federico
  • Daza, Vanesa
Over the last decade, Bitcoin has revolutionized the global economic and technological landscape, inspiring a new generation of blockchain-based technologies. Its protocol is today among the most influential for cryptocurrencies and distributed networks. In particular, the P2P layer represents a reference point for all permissionless blockchains, which often implement its solutions in their network layer. Unfortunately, the Bitcoin network protocol lacks a strong security model, leaving it exposed to several threats. Attacks at this level can affect the reliability and trustworthiness of the consensus layer, mining the credibility of the whole system. It is therefore of utmost importance to properly understand and address the security of the Bitcoin P2P protocol. In this paper, we give a comprehensive and detailed overview of known network-level attacks in Bitcoin, as well as the countermeasures that have been implemented in the protocol. We propose a generic network adversary model, and propose an objective-based taxonomy of the attacks. Finally, we identify the core weaknesses of the protocol and study the relationship between different types of attack. We believe our contribution can help both new and experienced researchers have a broader and deeper understanding of the Bitcoin P2P network and its threats, and allow for a better modeling of its security properties., This work was supported in part by AEI/FEDER, UE, under Project RTI2018-102112-B-I00.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Linear interference cancellation for the cell-free C-RAN uplink

  • Mosayebi, Reza
  • Mojahedian, Mohammad Mahdi
  • Lozano Solsona, Angel
Drawing on the notion of parallel interference cancellation, this paper formulates a one-shot linear receiver for the uplink of centralized, possibly cloud-based, radio access networks (C-RANs) operating in a cell-free fashion. This receiver exhibits substantial interference rejection abilities, yet it does not involve any matrix inversions; rather, its structure hinges on the pairwise projections of the users' channel vectors. Its performance is markedly superior to that of matched-filter beamforming, while the computational cost is decidedly inferior to that of an MMSE filter, altogether constituting an attractive alternative in terms of performance vs cost. Furthermore, with a proper sparsification of the channel matrix that it estimates and processes, the proposed receiver can be rendered scalable in the sense of its computational cost per access point not growing with size of the network. Uplink power control is also readily accommodated., The authors are with Univ. Pompeu Fabra, 08018 Barcelona and their work is supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, by MINECO’s Projects RTI2018-102112 and RTI2018-101040, and by the ICREA academia program.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

SANS: self-Sovereign authentication for network slices

  • Salleras, Xavier
  • Daza, Vanesa
5G communications proposed significant improvements over 4G in terms of efficiency and security. Among these novelties, the 5G network slicing seems to have a prominent role: deploy multiple virtual network slices, each providing a different service with different needs and features. Like this, a Slice Operator (SO) ruling a specific slice may want to offer a service for users meeting some requirements. It is of paramount importance to provide a robust authentication protocol, able to ensure that users meet the requirements, providing at the same time a privacy-by-design architecture. This makes even more sense having a growing density of Internet of Things (IoT) devices exchanging private information over the network. In this paper, we improve the 5G network slicing authentication using a Self-Sovereign Identity (SSI) scheme: granting users full control over their data. We introduce an approach to allow a user to prove his right to access a specific service without leaking any information about him. Such an approach is SANS, a protocol that provides nonlinkable protection for any issued information, preventing an SO or an eavesdropper from tracking users’ activity and relating it to their real identities. Furthermore, our protocol is scalable and can be taken as a framework for improving related technologies in similar scenarios, like authentication in the 5G Radio Access Network (RAN) or other wireless networks and services. Such features can be achieved using cryptographic primitives called Zero-Knowledge Proofs (ZKPs). Upon implementing our solution using a state-of-the-art ZKP library and performing several experiments, we provide benchmarks demonstrating that our approach is affordable in speed and memory consumption., The authors were supported by Project RTI2018-102112-B-100 (AEI/FEDER, UE).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

New privacy practices for blockchain software

  • Bellés-Muñoz, Marta
  • Baylina, Jordi
  • Daza, Vanesa
  • Muñoz-Tapia, José L.
In this article, we present the software tools we have implemented to bring complex privacy technologies closer to developers and to facilitate the implementation of privacyenabled blockchain applications., This research is supported by the Ethereum Foundation Ecosystem Support, privacy and security in blockchain (RISEBLOCK, Id: PID2019-110224RB-I00), intelligent, interoperable, integrative and deployable open source MARKETplace with trusted and secure software tools for incentivizing the industry data economy (i3-MARKET, European Commission, H2020, Id: 871754), a software architecture for rate-control over integrated satellite-terrestrial networks (ARPASAT, Id: TEC2015-70197-R), Information Security Group (ISG, Id: 2014-SGR-1504), Photoreal REaltime Sentient ENTity (PRESENT, European Commission, H2020, Id: 856879), and Técnicas avanzadas de cadenas de bloques para la internet de las cosas (Id: RTI2018-102112-B-I00).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

ZPiE: Zero-knowledge proofs in embedded systems

  • Salleras, Xavier
  • Daza, Vanesa
Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove to another party that the former knows some information while keeping it secret. Such a premise can lead to the development of numerous privacy-preserving protocols in different scenarios, like proving knowledge of some credentials to a server without leaking the identity of the user. Even when the applications of ZKPs were endless, they were not exploited in the wild for a couple of decades due to the fact that computing and verifying proofs was too computationally expensive. However, the advent of efficient schemes (in particular, zk-SNARKs) made this primitive to break into the scene in fields like cryptocurrencies, smart-contracts, and more recently, self-sovereign scenarios: private-by design identity management and authentication. Nevertheless, its adoption in environments like the Internet of Things (IoT) remains unexplored due to the computational limitations of embedded systems. In this paper, we introduce ZPiE, a C library intended to create ZKP applications to be executed in embedded systems. Its main feature is portability: it can be compiled, executed, and used out-of-the-box in a wide variety of devices. Moreover, our proof-of-concept has been proved to work smoothly in different devices with limited resources, which can execute state-of-the-art ZKP authentication protocols., This research was funded by Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT Grant Agreement Nº 856879.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Unsupervised learning for cellular power control

  • Nikbakht Silab, Rasoul
  • Jonsson, Anders, 1973-
  • Lozano Solsona, Angel
This letter applies a feedforward neural network trained in an unsupervised fashion to the problem of optimizing the transmit powers in cellular wireless systems. Both uplink and downlink are considered, with either centralized or distributed power control. Various objectives are entertained, all of them such that the problem can be cast in convex form. The performance of the proposed procedure is very satisfactory and, in terms of computational cost, the scalability with the system dimensionality is markedly superior to that of convex solvers. Moreover, the optimization relies on directly measurable channel gains, with no need for user location information., This work was supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, by the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502) as well as by MINECO’s Projects RTI2018-102112 and RTI2018-101040, and by the ICREA Academia Program.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Subset MMSE receivers for cell-free networks

  • Attarifar, Masoud
  • Abbasfar, Aliazam
  • Lozano Solsona, Angel
This paper formulates linear MMSE receivers that are both network- and user-centric for the uplink of cell-free wireless networks with centralized processing. Precisely, every user’s reception involves a distinct subset of access points (APs) while every AP participates in the reception of a distinct subset of users, hence the moniker subset MMSE receivers . These subsets, defined on the basis of the large-scale channel gains between users and APs, capture the most relevant signal and interference contributions while disregarding those whose processing is cost-ineffective and whose associated channel estimations would incur unnecessary overheads. With that, subset reception approaches the performance of network-wide MMSE reception, offering a multiple-fold improvement over cellular and matched-filtering counterparts, while being scalable in terms of cost and channel estimation. Moreover, because the subsets overlap considerably, they can sometimes be advantageously combined and the computation of the corresponding receivers can share a hefty amount of processing., M. Attarifar and A. Abbasfar are with the University of Tehran, North Kargar St., Tehran, Iran (e-mail: m.attarifar@ut.ac.ir; abbasfar@ut.ac.ir). Their work is supported by the Iranian National Science Foundation (INSF) Grant #98012057. A. Lozano is with Univ. Pompeu Fabra, 08018 Barcelona (e-mail: angel.lozano@upf.edu). His work is supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, and by MINECO’s Projects RTI2018-102112 and RTI2018-101040.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Simulation extractable versions of Groth's zk-SNARK revisited

  • Amine, Oussama
  • Baghery, Karim
  • Pindado, Zaira
  • Ràfols, Carla
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are the most efficient proof systems in terms of proof size and verification. Currently, Groth's scheme from EUROCRYPT 2016, Groth16 , is the state-of-the-art and is widely deployed in practice. Groth16 is originally proven to achieve knowledge soundness, which does not guarantee the non-malleability of proofs. There has been considerable progress in presenting new zk-SNARKs or modifying Groth16 to efficiently achieve strong Simulation extractability, which is shown to be a necessary requirement in some applications. In this paper, we revise the Random oracle based variant of Groth16 proposed by Bowe and Gabizon, BG18, the most efficient one in terms of prover efficiency and CRS size among the candidates, and present a more efficient variant that saves 2 pairings in the verification and 1 group element in the proof. This supersedes our preliminary construction, presented in CANS 2020 (Baghery et al. in CANS 20, volume 12579 of LNCS, Springer, Heidelberg. pp 453-461, 2020), which saved 1 pairing in the verification, and was proven in the generic group model. Our new construction also improves on BG18 in that our proofs are in the algebraic group model with Random Oracles and reduces security to standard computational assumptions in bilinear groups (as opposed to using the full power of the generic group model (GGM)). We implement our proposed simulation extractable zk-SNARK (SE zk-SNARK) along with BG18 in the Arkworks library, and compare the efficiency of our scheme with some related works. Our empirical experiences confirm that our SE zk-SNARK is more efficient than all previous simulation extractable (SE) schemes in most dimensions and it has very close efficiency to the original Groth16 ., We thank Alonso González for his helpful discussions and the reviewers for their valuable comments. Karim Baghery has been supported in part by the Defense Advanced Research Projects Agency (DARPA) under contract No. HR001120C0085, by the FWO under an Odysseus project GOH9718N, and by CyberSecurity Research Flanders with reference number VR20192203. Carla Ràfols was partially supported by Project RTI2018-102112-B-I00 (AEI / FEDER, UE).
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Reconfigurable ULAs for line-of-sight MIMO transmission

  • Do, Heedong
  • Lozano Solsona, Angel
This paper establishes an upper bound on the capacity of line-of-sight multiantenna channels over all possible antenna arrangements and shows that uniform linear arrays (ULAs) with an SNR-dependent rotation of transmitter and/or receiver can closely approach such capacity-and in fact achieve it at low and high SNR, and asymptotically in the numbers of antennas. Then, as an alternative to mechanically rotating ULAs, we propose to electronically select among multiple ULAs having a radial disposition at either transmitter or receiver, and we bound the shortfall from capacity as a function of the number of such ULAs. With only three ULAs, properly angled, 96% of the capacity can be achieved. Finally, we further introduce reduced-complexity precoders and linear receivers that capitalize on the structure of the channels spawned by these configurable ULA architectures., The work of Heedong Do and Namyoon Lee was supported in part by the Samsung Research Funding and Incubation Center of Samsung Electronics under Project SRFC-IT1702-04, in part by the National Research Foundation of Korea (NRF) Grant funded by the Korea Government (MSIT) under Grant 2020R1C1C1013381, and in part by the BK21Plus Program. The work of Angel Lozano was supported in part by the European Research Council through the H2020 Framework Programme/ERC under Grant 694974, in part by the MINECO’s under Project RTI2018-102112 and Project RTI2018-101040, and in part by the ICREA.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

FORT: right-proving and attribute-blinding self-sovereign authentication

  • Salleras, Xavier
  • Rovira, Sergi
  • Daza, Vanesa
Nowadays, there are a plethora of services that are provided and paid for online, such as video streaming subscriptions, car-share, vehicle parking, purchasing tickets for events, etc. Online services usually issue tokens that are directly related to the identities of their users after they sign up to a platform; users need to authenticate themselves by using the same credentials each time they use the service. Likewise, when using in-person services, such as going to a concert, after paying for this service, the user usually receives a ticket, which proves that he/she has the right to use that service. In both scenarios, the main concerns surround the centralization of these systems and that they do not ensure customers’ privacy. The involved service providers are trusted third parties—authorities that offer services and handle private data about users. In this paper, we designed and implemented FORT, a decentralized system that allows customers to prove their rights to use specific services (either online or in-person) without revealing sensitive information. To achieve decentralization, we proposed a solution where all of the data are handled by a blockchain. We describe and uniquely identify users’ rights using non-fungible tokens (NFTs), and possession of these rights is demonstrated by using zero-knowledge proofs—cryptographic primitives that allow us to guarantee customers’ privacy. Furthermore, we provide benchmarks of FORT, which show that our protocol is efficient enough to be used in devices with low computing resources, such as smartphones or smartwatches, which are devices commonly used in our use case scenario, Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT grant agreement no. 856879.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Unsupervised learning for parametric optimization

  • Nikbakht Silab, Rasoul
  • Jonsson, Anders, 1973-
  • Lozano Solsona, Angel
This letter proposes the unsupervised training of a feedforward neural network to solve parametric optimization problems involving large numbers of parameters. Such unsupervised training, which consists in repeatedly sampling parameter values and performing stochastic gradient descent, foregoes the taxing precomputation of labeled training data that supervised learning necessitates. As an example of application, we put this technique to use on a rather general constrained quadratic program. Follow-up letters subsequently apply it to more specialized wireless communication problems, some of them nonconvex in nature. In all cases, the performance of the proposed procedure is very satisfactory and, in terms of computational cost, its scalability with the problem dimensionality is superior to that of convex solvers., This work was supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, by the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502) as well as by MINECO’s Projects RTI2018-102112 and RTI2018-101040, and by the ICREA Academia program.
Repositorio Digital de la UPF
Publicación Artículo científico (JournalArticle)

Uplink fractional power control and downlink power allocation for cell-free networks

  • Nikbakht Silab, Rasoul
  • Mosayebi, Reza
  • Lozano Solsona, Angel
This letter proposes respective policies for uplink power control and downlink power allocation in cell-free wireless networks. Both policies rely only on large-scale quantities and are expressed in closed form, being therefore scalable. The uplink policy, which generalizes the fractional power control employed extensively in cellular networks, features a single parameter; by adjusting this parameter, the SIR distribution experienced by the users can be compressed or expanded, trading average performance for fairness. The downlink policy dualizes the uplink solution, featuring two parameters that again allow effecting a tradeoff between average performance and fairness., The authors are with Univ. Pompeu Fabra, 08018 Barcelona (e-mail: angel.lozano@upf.edu). Their work is supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, and by MINECO’s Projects RTI2018-102112 and RTI2018-101040. Parts of this paper were presented at the 2019 IEEE Int’l Conf. Commun.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Linear interference cancellation for the cell-free C-RAN uplink

  • Mosayebi, Reza
  • Mojahedian, Mohammad Mahdi
  • Lozano Solsona, Angel
Drawing on the notion of parallel interference cancellation, this paper formulates a one-shot linear receiver for the uplink of centralized, possibly cloud-based, radio access networks (C-RANs) operating in a cell-free fashion. This receiver exhibits substantial interference rejection abilities, yet it does not involve any matrix inversions; rather, its structure hinges on the pairwise projections of the users' channel vectors. Its performance is markedly superior to that of matched-filter beamforming, while the computational cost is decidedly inferior to that of an MMSE filter, altogether constituting an attractive alternative in terms of performance vs cost. Furthermore, with a proper sparsification of the channel matrix that it estimates and processes, the proposed receiver can be rendered scalable in the sense of its computational cost per access point not growing with size of the network. Uplink power control is also readily accommodated., The authors are with Univ. Pompeu Fabra, 08018 Barcelona and their work is supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, by MINECO’s Projects RTI2018-102112 and RTI2018-101040, and by the ICREA academia program.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

SANS: self-Sovereign authentication for network slices

  • Salleras, Xavier
  • Daza, Vanesa
5G communications proposed significant improvements over 4G in terms of efficiency and security. Among these novelties, the 5G network slicing seems to have a prominent role: deploy multiple virtual network slices, each providing a different service with different needs and features. Like this, a Slice Operator (SO) ruling a specific slice may want to offer a service for users meeting some requirements. It is of paramount importance to provide a robust authentication protocol, able to ensure that users meet the requirements, providing at the same time a privacy-by-design architecture. This makes even more sense having a growing density of Internet of Things (IoT) devices exchanging private information over the network. In this paper, we improve the 5G network slicing authentication using a Self-Sovereign Identity (SSI) scheme: granting users full control over their data. We introduce an approach to allow a user to prove his right to access a specific service without leaking any information about him. Such an approach is SANS, a protocol that provides nonlinkable protection for any issued information, preventing an SO or an eavesdropper from tracking users’ activity and relating it to their real identities. Furthermore, our protocol is scalable and can be taken as a framework for improving related technologies in similar scenarios, like authentication in the 5G Radio Access Network (RAN) or other wireless networks and services. Such features can be achieved using cryptographic primitives called Zero-Knowledge Proofs (ZKPs). Upon implementing our solution using a state-of-the-art ZKP library and performing several experiments, we provide benchmarks demonstrating that our approach is affordable in speed and memory consumption., The authors were supported by Project RTI2018-102112-B-100 (AEI/FEDER, UE).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

FORT: right-proving and attribute-blinding self-sovereign authentication

  • Salleras, Xavier
  • Rovira, Sergi
  • Daza, Vanesa
Nowadays, there are a plethora of services that are provided and paid for online, such as video streaming subscriptions, car-share, vehicle parking, purchasing tickets for events, etc. Online services usually issue tokens that are directly related to the identities of their users after they sign up to a platform; users need to authenticate themselves by using the same credentials each time they use the service. Likewise, when using in-person services, such as going to a concert, after paying for this service, the user usually receives a ticket, which proves that he/she has the right to use that service. In both scenarios, the main concerns surround the centralization of these systems and that they do not ensure customers’ privacy. The involved service providers are trusted third parties—authorities that offer services and handle private data about users. In this paper, we designed and implemented FORT, a decentralized system that allows customers to prove their rights to use specific services (either online or in-person) without revealing sensitive information. To achieve decentralization, we proposed a solution where all of the data are handled by a blockchain. We describe and uniquely identify users’ rights using non-fungible tokens (NFTs), and possession of these rights is demonstrated by using zero-knowledge proofs—cryptographic primitives that allow us to guarantee customers’ privacy. Furthermore, we provide benchmarks of FORT, which show that our protocol is efficient enough to be used in devices with low computing resources, such as smartphones or smartwatches, which are devices commonly used in our use case scenario, Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT grant agreement no. 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

SoK: network-level attacks on the bitcoin P2P network

  • Franzoni, Federico
  • Daza, Vanesa
Over the last decade, Bitcoin has revolutionized the global economic and technological landscape, inspiring a new generation of blockchain-based technologies. Its protocol is today among the most influential for cryptocurrencies and distributed networks. In particular, the P2P layer represents a reference point for all permissionless blockchains, which often implement its solutions in their network layer. Unfortunately, the Bitcoin network protocol lacks a strong security model, leaving it exposed to several threats. Attacks at this level can affect the reliability and trustworthiness of the consensus layer, mining the credibility of the whole system. It is therefore of utmost importance to properly understand and address the security of the Bitcoin P2P protocol. In this paper, we give a comprehensive and detailed overview of known network-level attacks in Bitcoin, as well as the countermeasures that have been implemented in the protocol. We propose a generic network adversary model, and propose an objective-based taxonomy of the attacks. Finally, we identify the core weaknesses of the protocol and study the relationship between different types of attack. We believe our contribution can help both new and experienced researchers have a broader and deeper understanding of the Bitcoin P2P network and its threats, and allow for a better modeling of its security properties., This work was supported in part by AEI/FEDER, UE, under Project RTI2018-102112-B-I00.
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, Jordi
  • Daza, Vanesa
  • Muñoz-Tapia, José L.
In this article, we present the software tools we have implemented to bring complex privacy technologies closer to developers and to facilitate the implementation of privacyenabled blockchain applications., This research is supported by the Ethereum Foundation Ecosystem Support, privacy and security in blockchain (RISEBLOCK, Id: PID2019-110224RB-I00), intelligent, interoperable, integrative and deployable open source MARKETplace with trusted and secure software tools for incentivizing the industry data economy (i3-MARKET, European Commission, H2020, Id: 871754), a software architecture for rate-control over integrated satellite-terrestrial networks (ARPASAT, Id: TEC2015-70197-R), Information Security Group (ISG, Id: 2014-SGR-1504), Photoreal REaltime Sentient ENTity (PRESENT, European Commission, H2020, Id: 856879), and Técnicas avanzadas de cadenas de bloques para la internet de las cosas (Id: RTI2018-102112-B-I00).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Uplink fractional power control and downlink power allocation for cell-free networks

  • Nikbakht Silab, Rasoul
  • Mosayebi, Reza
  • Lozano Solsona, Angel
This letter proposes respective policies for uplink power control and downlink power allocation in cell-free wireless networks. Both policies rely only on large-scale quantities and are expressed in closed form, being therefore scalable. The uplink policy, which generalizes the fractional power control employed extensively in cellular networks, features a single parameter; by adjusting this parameter, the SIR distribution experienced by the users can be compressed or expanded, trading average performance for fairness. The downlink policy dualizes the uplink solution, featuring two parameters that again allow effecting a tradeoff between average performance and fairness., The authors are with Univ. Pompeu Fabra, 08018 Barcelona (e-mail: angel.lozano@upf.edu). Their work is supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, and by MINECO’s Projects RTI2018-102112 and RTI2018-101040. Parts of this paper were presented at the 2019 IEEE Int’l Conf. Commun.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Efficient TFHE bootstrapping in the multiparty setting

  • Park, Jeongeun
  • Rovira, Sergi
TFHE is a practical fully homomorphic encryption scheme (FHE) capable of computing any boolean gate or non-linear function. The scheme was originally designed to work for the single key setting. To implement realistic application scenarios, it is necessary to extend it to handle multiple users. In this paper, we introduce a new approach to generate TFHE bootstrapping keys for (predefined) multiple users. Hence, a fixed number of users can enjoy the same level of efficiency as in the single key setting, keeping their individual input privacy. Our construction relies on a novel algorithm called homomorphic indicator, which can be of independent interest. We provide a detailed analysis of the noise growth and a set of secure parameters suitable to be used in practice. Moreover, we compare the complexity of our technique with other state-of-the-art constructions and show which method performs better depending on the parameter sets. We also provide a prototype implementation of our technique. To the best of our knowledge, this is the first implementation of TFHE in the multiparty setting., CyberSecurity Research Flanders (Grant Number: VR20192203), 10.13039/501100003329-Spanish Ministry of Economy and Competitiveness (Grant Number: RTI2018-102112-B-I00).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

ZPiE: Zero-knowledge proofs in embedded systems

  • Salleras, Xavier
  • Daza, Vanesa
Zero-Knowledge Proofs (ZKPs) are cryptographic primitives allowing a party to prove to another party that the former knows some information while keeping it secret. Such a premise can lead to the development of numerous privacy-preserving protocols in different scenarios, like proving knowledge of some credentials to a server without leaking the identity of the user. Even when the applications of ZKPs were endless, they were not exploited in the wild for a couple of decades due to the fact that computing and verifying proofs was too computationally expensive. However, the advent of efficient schemes (in particular, zk-SNARKs) made this primitive to break into the scene in fields like cryptocurrencies, smart-contracts, and more recently, self-sovereign scenarios: private-by design identity management and authentication. Nevertheless, its adoption in environments like the Internet of Things (IoT) remains unexplored due to the computational limitations of embedded systems. In this paper, we introduce ZPiE, a C library intended to create ZKP applications to be executed in embedded systems. Its main feature is portability: it can be compiled, executed, and used out-of-the-box in a wide variety of devices. Moreover, our proof-of-concept has been proved to work smoothly in different devices with limited resources, which can execute state-of-the-art ZKP authentication protocols., This research was funded by Project RTI2018-102112-B-100 (AEI/FEDER, UE) and H2020 PRESENT Grant Agreement Nº 856879.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Simulation extractable versions of Groth's zk-SNARK revisited

  • Amine, Oussama
  • Baghery, Karim
  • Pindado, Zaira
  • Ràfols, Carla
Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are the most efficient proof systems in terms of proof size and verification. Currently, Groth's scheme from EUROCRYPT 2016, Groth16 , is the state-of-the-art and is widely deployed in practice. Groth16 is originally proven to achieve knowledge soundness, which does not guarantee the non-malleability of proofs. There has been considerable progress in presenting new zk-SNARKs or modifying Groth16 to efficiently achieve strong Simulation extractability, which is shown to be a necessary requirement in some applications. In this paper, we revise the Random oracle based variant of Groth16 proposed by Bowe and Gabizon, BG18, the most efficient one in terms of prover efficiency and CRS size among the candidates, and present a more efficient variant that saves 2 pairings in the verification and 1 group element in the proof. This supersedes our preliminary construction, presented in CANS 2020 (Baghery et al. in CANS 20, volume 12579 of LNCS, Springer, Heidelberg. pp 453-461, 2020), which saved 1 pairing in the verification, and was proven in the generic group model. Our new construction also improves on BG18 in that our proofs are in the algebraic group model with Random Oracles and reduces security to standard computational assumptions in bilinear groups (as opposed to using the full power of the generic group model (GGM)). We implement our proposed simulation extractable zk-SNARK (SE zk-SNARK) along with BG18 in the Arkworks library, and compare the efficiency of our scheme with some related works. Our empirical experiences confirm that our SE zk-SNARK is more efficient than all previous simulation extractable (SE) schemes in most dimensions and it has very close efficiency to the original Groth16 ., We thank Alonso González for his helpful discussions and the reviewers for their valuable comments. Karim Baghery has been supported in part by the Defense Advanced Research Projects Agency (DARPA) under contract No. HR001120C0085, by the FWO under an Odysseus project GOH9718N, and by CyberSecurity Research Flanders with reference number VR20192203. Carla Ràfols was partially supported by Project RTI2018-102112-B-I00 (AEI / FEDER, UE).
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Unsupervised learning for parametric optimization

  • Nikbakht Silab, Rasoul
  • Jonsson, Anders, 1973-
  • Lozano Solsona, Angel
This letter proposes the unsupervised training of a feedforward neural network to solve parametric optimization problems involving large numbers of parameters. Such unsupervised training, which consists in repeatedly sampling parameter values and performing stochastic gradient descent, foregoes the taxing precomputation of labeled training data that supervised learning necessitates. As an example of application, we put this technique to use on a rather general constrained quadratic program. Follow-up letters subsequently apply it to more specialized wireless communication problems, some of them nonconvex in nature. In all cases, the performance of the proposed procedure is very satisfactory and, in terms of computational cost, its scalability with the problem dimensionality is superior to that of convex solvers., This work was supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, by the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502) as well as by MINECO’s Projects RTI2018-102112 and RTI2018-101040, and by the ICREA Academia program.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Subset MMSE receivers for cell-free networks

  • Attarifar, Masoud
  • Abbasfar, Aliazam
  • Lozano Solsona, Angel
This paper formulates linear MMSE receivers that are both network- and user-centric for the uplink of cell-free wireless networks with centralized processing. Precisely, every user’s reception involves a distinct subset of access points (APs) while every AP participates in the reception of a distinct subset of users, hence the moniker subset MMSE receivers . These subsets, defined on the basis of the large-scale channel gains between users and APs, capture the most relevant signal and interference contributions while disregarding those whose processing is cost-ineffective and whose associated channel estimations would incur unnecessary overheads. With that, subset reception approaches the performance of network-wide MMSE reception, offering a multiple-fold improvement over cellular and matched-filtering counterparts, while being scalable in terms of cost and channel estimation. Moreover, because the subsets overlap considerably, they can sometimes be advantageously combined and the computation of the corresponding receivers can share a hefty amount of processing., M. Attarifar and A. Abbasfar are with the University of Tehran, North Kargar St., Tehran, Iran (e-mail: m.attarifar@ut.ac.ir; abbasfar@ut.ac.ir). Their work is supported by the Iranian National Science Foundation (INSF) Grant #98012057. A. Lozano is with Univ. Pompeu Fabra, 08018 Barcelona (e-mail: angel.lozano@upf.edu). His work is supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, and by MINECO’s Projects RTI2018-102112 and RTI2018-101040.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Reconfigurable ULAs for line-of-sight MIMO transmission

  • Do, Heedong
  • Lozano Solsona, Angel
This paper establishes an upper bound on the capacity of line-of-sight multiantenna channels over all possible antenna arrangements and shows that uniform linear arrays (ULAs) with an SNR-dependent rotation of transmitter and/or receiver can closely approach such capacity-and in fact achieve it at low and high SNR, and asymptotically in the numbers of antennas. Then, as an alternative to mechanically rotating ULAs, we propose to electronically select among multiple ULAs having a radial disposition at either transmitter or receiver, and we bound the shortfall from capacity as a function of the number of such ULAs. With only three ULAs, properly angled, 96% of the capacity can be achieved. Finally, we further introduce reduced-complexity precoders and linear receivers that capitalize on the structure of the channels spawned by these configurable ULA architectures., The work of Heedong Do and Namyoon Lee was supported in part by the Samsung Research Funding and Incubation Center of Samsung Electronics under Project SRFC-IT1702-04, in part by the National Research Foundation of Korea (NRF) Grant funded by the Korea Government (MSIT) under Grant 2020R1C1C1013381, and in part by the BK21Plus Program. The work of Angel Lozano was supported in part by the European Research Council through the H2020 Framework Programme/ERC under Grant 694974, in part by the MINECO’s under Project RTI2018-102112 and Project RTI2018-101040, and in part by the ICREA.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Unsupervised learning for cellular power control

  • Nikbakht Silab, Rasoul
  • Jonsson, Anders, 1973-
  • Lozano Solsona, Angel
This letter applies a feedforward neural network trained in an unsupervised fashion to the problem of optimizing the transmit powers in cellular wireless systems. Both uplink and downlink are considered, with either centralized or distributed power control. Various objectives are entertained, all of them such that the problem can be cast in convex form. The performance of the proposed procedure is very satisfactory and, in terms of computational cost, the scalability with the system dimensionality is markedly superior to that of convex solvers. Moreover, the optimization relies on directly measurable channel gains, with no need for user location information., This work was supported by the European Research Council under the H2020 Framework Programme/ERC grant agreement 694974, by the Maria de Maeztu Units of Excellence Programme (MDM-2015-0502) as well as by MINECO’s Projects RTI2018-102112 and RTI2018-101040, and by the ICREA Academia Program.