Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
About

About

João P. Vilela is a professor at the Department of Computer Science of the University of Porto and a senior researcher at INESC TEC and CISUC. He was previously a professor at the Department of Informatics Engineering of the University of Coimbra, after receiving the Ph.D. in Computer Science in 2011 from the University of Porto, Portugal. He was a visiting researcher at Georgia Tech, working on physical-layer security, and at MIT, working on security for network coding. In recent years, Dr. Vilela has been coordinator and team member of several national, bilateral, and European-funded projects in security and privacy. His main research interests are in security and privacy of computer and communication systems, with applications such as wireless networks, Internet of Things and mobile devices. Specific research topics include wireless physical-layer security, security of next-generation networks, privacy-preserving data mining, location privacy and automated privacy protection. https://www.dcc.fc.up.pt/~joaovilela/

Interest
Topics
Details

Details

Publications

2021

SDR Proof-of-Concept of Full-Duplex Jamming for Enhanced Physical Layer Security

Authors
Silva, A; Gomes, M; Vilela, JP; Harrison, WK;

Publication
SENSORS

Abstract
In order to secure wireless communications, we consider the usage of physical-layer security (PLS) mechanisms (i.e., coding for secrecy mechanisms) combined with self-interference generation. We present a prototype implementation of a scrambled coding for secrecy mechanisms with interference generation by the legitimate receiver and the cancellation of the effect of self-interference (SI). Regarding the SI cancellation, four state-of-the-art algorithms were considered: Least mean square (LMS), normalized least mean square (NLMS), recursive least squares (RLS) and QR decomposition recursive least squares (QRDRLS). The prototype implementation is performed in real-world software-defined radio (SDR) devices using GNU-Radio, showing that the LMS outperforms all other algorithms considered (NLMS, RLS and QRDRLS), being the best choice to use in this situation (SI cancellation). It was also shown that it is possible to secure communication using only noise generation by the legitimate receiver, though a variation of the packet loss rate (PLR) and the bit error rate (BER) gaps is observed when moving from the fairest to an advantageous or a disadvantageous scenario. Finally, when noise generation was combined with the adapted scrambled coding for secrecy with a hidden key scheme, a noteworthy security improvement was observed resulting in an increased BER for Eve with minor interference to Bob.

2021

A survey of privacy-preserving mechanisms for heterogeneous data types

Authors
Cunha, M; Mendes, R; Vilela, JP;

Publication
Computer Science Review

Abstract

2021

Efficient Privacy Preserving Distributed K-Means for Non-IID Data

Authors
Brandao, A; Mendes, R; Vilela, JP;

Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Abstract
Privacy is becoming a crucial requirement in many machine learning systems. In this paper we introduce an efficient and secure distributed K-Means algorithm, that is robust to non-IID data. The base idea of our proposal consists in each client computing the K-Means algorithm locally, with a variable number of clusters. The server will use the resultant centroids to apply the K-Means algorithm again, discovering the global centroids. To maintain the client’s privacy, homomorphic encryption and secure aggregation is used in the process of learning the global centroids. This algorithm is efficient and reduces transmission costs, since only the local centroids are used to find the global centroids. In our experimental evaluation, we demonstrate that our strategy achieves a similar performance to the centralized version even in cases where the data follows an extreme non-IID form. © 2021, Springer Nature Switzerland AG.

2021

On the Secure Spectral Efficiency of URLLC With Randomly Located Colluding Eavesdroppers

Authors
Farhat, J; Brante, G; Souza, RD; Vilela, JP;

Publication
IEEE INTERNET OF THINGS JOURNAL

Abstract
In this article, we investigate the secure spectral efficiency of an ultrareliable low-latency communication system, where communications occur with short packets due to delay constraints, so that a finite blocklength formulation is considered. In addition, we assume that no feedback channel is available to implement automatic repeat request schemes, so that packet replication (PR) and interface diversity (ID) strategies are used to improve performance, which are then compared in terms of physical-layer security while considering a Nakagami-m fading channel. Furthermore, we assume no knowledge of the instantaneous channel state information at Alice, neither with respect to Bob nor Eves, while the position of multiple colluding eavesdroppers are specified according to a Poisson point process. Numerical results show that the joint optimization of the blocklength, the transmit power, and the amount of information bits per codeword are crucial to maximize the secure spectral efficiency. In addition, we also show that ID outperforms the PR strategy in most scenarios when the number of replications/interfaces increases.

2021

Keyed Polar Coding for Physical-Layer Security without Channel State Information

Authors
Pinto, TMS; Vilela, JP; Gomes, MAC; Harrison, WK;

Publication
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021)

Abstract
Polar codes have been shown to provide an effective mechanism for achieving physical-layer security over various wiretap channels. A majority of these schemes require channel state information (CSI) at the encoder for both intended receivers and eavesdroppers. In this paper, we consider a polar coding scheme for secrecy over a Gaussian wiretap channel when no CSI is available. We show that the availability of a shared keystream between friendly parties allows polar codes to be used for both secure and reliable communications, even when the eavesdropper knows a large fraction of the keystream. The scheme relies on a predetermined strategy for partitioning the bits to be encoded into a set of frozen bits and a set of information bits. The frozen bits are filled with bits from the keystream, and we evaluate the security gap when the cyclic redundancy check-aided successive cancellation list decoder is used at both receivers in the wiretap channel model.

Supervised
thesis

2021

Privacy Awareness for Mobile Devices

Author
Miguel António de Kermenguy Serpa Pimentel Ramos

Institution
UP-FCUP

2021

Prediction of Privacy Preferences with User Profiles: A Federated Learning Approach

Author
André Xavier Ribeiro de Almeida Brandão

Institution
UP-FCUP

2021

Privacy-Preserving Mechanisms for Heterogeneous Data Types

Author
Mariana da Cruz Cunha

Institution
UP-FCUP

2020

Privacy-Preserving Mechanisms for Heterogeneous Data Types

Author
Mariana da Cruz Cunha

Institution
UP-FCUP