Rafael Gregorio Lucas D'Oliveira

Rafael Gregorio Lucas D'Oliveira

Auto-generated profile, based on publicly available information

Rafael Gregorio Lucas D'Oliveira

School of Mathematical and Statistical Sciences, Clemson University, SC, USA

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
20 February 2020 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
RDRafael G. L. D'OLiveira
Rafael G. L. D'OLiveira
SRSalim El Rouayheb
Salim El Rouayheb
DKDavid Karpuk
David Karpuk
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a combinatorial problem on a special type of addition table, which we call the degree table. The codes are based on arithmetic progressions, and are thus named GASP (Gap Additive Secure Polynomial) Codes. GASP Codes are shown to outperform all previously known polynomial codes for secure distributed matrix multiplication in terms of download rate.

26 January 2021 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
ACAlejandro Cohen
Alejandro Cohen
RDRafael G. L. D'OLiveira
Rafael G. L. D'OLiveira
SSSalman Salamatian
Salman Salamatian
MMMuriel Medard
Muriel Medard
We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain secure post-quantum cryptography at high communication rates. The secure network-coding scheme we offer is hybrid in the sense that it combines information-theoretic security with public-key cryptography. In addition, the scheme is general and can be applied to any communication network, and to any public-key cryptosystem. Our hybrid scheme is based on the information theoretic notion of individual secrecy, which traditionally relies on the assumption that an eavesdropper can only observe a subset of the communication links between the trusted parties – an assumption that is often challenging to enforce. For this setting, several code constructions have been developed, where the messages are linearly mixed before transmission over each of the paths in a way that guarantees that an adversary which observes only a subset has sufficient uncertainty about each individual message. Instead, in this paper, we take a computational viewpoint, and construct a coding scheme in which an arbitrary secure cryptosystem is utilized on a subset of the links, while a pre-processing similar to the one in individual security is utilized. Under this scheme, we demonstrate 1) a computational security guarantee for an adversary which observes the entirety of the links 2) an information theoretic security guarantee for an adversary which observes a subset of the links, and 3) information rates which approach the capacity of the network and greatly improve upon the current solutions. A perhaps surprising consequence of our scheme is that, to guarantee a computational security level b, it is sufficient to encrypt a single link using a computational post-quantum scheme. That is, using HUNCC, we can ensure post-quantum security in networks where it is not possible to use public-key encryption over all the links in the network. In addition, the information rate approaches 1 as the number of communication links increases. As a concrete example, in a multipath network with three links, using a 128-bit computationally secure McEliece cryptosystem only over one link, we obtain a 128-bit individually computationally secure level over all paths with a total information rate of 0.91 in the network.

6 August 2021 in IEEE Journal on Selected Areas in Information Theory
Verified
Journal Article
Closed access
RDRafael G. L. D'OLiveira
Rafael G. L. D'OLiveira
SRSalim El Rouayheb
Salim El Rouayheb
DHDaniel Heinlein
Daniel Heinlein
DKDavid Karpuk
David Karpuk
We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. We construct polynomial codes for SDMM by studying a recently introduced combinatorial tool called the degree table. For a fixed partitioning, minimizing the total communication cost of a polynomial code for SDMM is equivalent to minimizing $N$ , the number of distinct elements in the corresponding degree table. We propose new constructions of degree tables with a low number of distinct elements. These new constructions lead to a general family of polynomial codes for SDMM, which we call $\mathsf {GASP}_{r}$ (Gap Additive Secure Polynomial codes) parameterized by an integer $r$ . $\mathsf {GASP}_{r}$ outperforms all previously known polynomial codes for SDMM under an outer product partitioning. We also present lower bounds on $N$ and prove the optimality or asymptotic optimality of our constructions for certain regimes. Moreover, we formulate the construction of optimal degree tables as an integer linear program and use it to prove the optimality of $\mathsf {GASP}_{r}$ for all the system parameters that we were able to test.

12 June 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
ACAlejandro Cohen
Alejandro Cohen
RDRafael G. L. D’oLiveira
Rafael G. L. D’oLiveira
KDKen R. Duffy
Ken R. Duffy
JWJongchan Woo
Jongchan Woo
MMMuriel Medard
Muriel Medard
In this paper, we show that the Advanced Encryption Standard (AES) cryptosystem can be utilized as an error-correcting code to obtain reliability over noisy communication and data systems. Specifically, we show that by composing a simple padding followed by encrypting with AES, we can achieve error-correcting performance similar to random codes. We conduct an empirical comparison between our AES-based error correction approach, Random Linear Codes, and CA-Polar codes to assess their performance in practical scenarios. Our results show that the AES-based approach achieves nearly identical performance to the other well-established error-correcting codes.

23 August 2023 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
ACAlejandro Cohen
Alejandro Cohen
RDRafael G. L. D'OLiveira
Rafael G. L. D'OLiveira
CYChia-Yi Yeh
Chia-Yi Yeh
HGHichem Guerboukha
Hichem Guerboukha
RSRabi Shrestha
Rabi Shrestha
DMDaniel M. Mittleman
Daniel M. Mittleman
Security against eavesdropping is one of the key concerns in the design of any communication system. Many common considerations of the security of a wireless communication channel rely on comparing the signal level measured by Bob (the intended receiver) to that accessible to Eve (a single eavesdropper). Frameworks such as Wyner's wiretap model ensure the security of a link, in an average sense, when Bob's signal-to-noise ratio (SNR) exceeds Eve's. Unfortunately, because these guarantees rely on the noise realizations at Eve, statistically, Eve can still occasionally succeed in decoding information. The goal of achieving exactly zero probability of intercept over an engineered region of the broadcast sector, which we term absolute security, remains elusive. Here, we describe the first architecture for a wireless link with a single eavesdropper, that provides absolute security. I.e., a cryptographic deterministic and non-probabilistic security approach that does not rely on statistical assumptions about noise, shared secure key, or Eve's computational power. Our approach relies on the inherent properties of broadband and high-gain antennas, and is therefore ideally suited for implementation in millimeter-wave and terahertz wireless systems, where such antennas will generally be employed. We exploit spatial minima of the antenna pattern at different frequencies, the union of which defines a wide region where Eve is guaranteed to fail regardless of her computational capabilities, and regardless of the noise in the channels. Unlike conventional zero-forcing beam forming methods, we show that, for realistic assumptions about the antenna configuration and power budget, this absolute security guarantee can be achieved over most possible eavesdropper locations. Since we use relatively simple frequency-multiplexed coding, together with the underlying physics of a diffracting aperture, this idea is broadly applicable in many contexts.

1 June 2020
Verified
Conference Paper
Closed access
RDRafael G. L. D'Oliveira
Rafael G. L. D'Oliveira
SRSalim El Rouayheb
Salim El Rouayheb
DHDaniel Heinlein
Daniel Heinlein
DKDavid Karpuk
David Karpuk
We consider the problem of secure distributed matrix multiplication in which a user wishes to compute the product of two matrices with the assistance of honest but curious servers. In this paper, we answer the following question: Is it beneficial to offload the computations if security is a concern? We answer this question in the affirmative by showing that by adjusting the parameters in a polynomial code we can obtain a trade-off between the user’s and the servers’ computational time. Indeed, we show that if the computational time complexity of an operation in $\mathbb{F}_{q}$ is at most $\mathcal{Z}_{q}$ and the computational time complexity of multiplying two $n\times n$ matrices is $\mathcal{O}(n^{\omega}\mathcal{Z}_{q})$ then, by optimizing the trade-off, the user together with the servers can compute the multiplication in $\mathcal{O}\left(n^{4-\frac{6}{\omega+1}}\mathcal{Z}_{q}\right)$ time. We also show that if the user is only concerned in optimizing the download rate, a common assumption in the literature, then the problem can be converted into a simple private information retrieval problem by means of a scheme we call Private Oracle Querying. However, this comes at large upload and computational costs for both the user and the servers.