Zobrazeno 1 - 10
of 63
pro vyhledávání: '"D'Oliveira, Rafael G. L."'
In this work, we introduce a new technique for taking a single-secret sharing scheme with a general access structure and transforming it into an individually secure multi-secret sharing scheme where every secret has the same general access structure.
Externí odkaz:
http://arxiv.org/abs/2405.06773
Autor:
Cartor, Ryann, D'Oliveira, Rafael G. L., Rouayheb, Salim El, Heinlein, Daniel, Karpuk, David, Sprintson, Alex
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. We show how to construct polynomial schemes for the outer product par
Externí odkaz:
http://arxiv.org/abs/2405.06121
Autor:
Woo, Jongchan, Vasudevan, Vipindev Adat, Kim, Benjamin D., D'Oliveira, Rafael G. L., Cohen, Alejandro, Stahlbuhk, Thomas, Duffy, Ken R., Médard, Muriel
The Internet of Things (IoT) represents a significant advancement in digital technology, with its rapidly growing network of interconnected devices. This expansion, however, brings forth critical challenges in data security and reliability, especiall
Externí odkaz:
http://arxiv.org/abs/2405.05107
Linear hashes are known to possess error-correcting capabilities. However, in most applications, non-linear hashes with pseudorandom outputs are utilized instead. It has also been established that classical non-systematic random codes, both linear an
Externí odkaz:
http://arxiv.org/abs/2405.01495
Autor:
Torkamani, Sahel, Ebrahimi, Javad B., Sadeghi, Parastoo, D'Oliveira, Rafael G. L., Médard, Muriel
We present the notion of \emph{reasonable utility} for binary mechanisms, which applies to all utility functions in the literature. This notion induces a partial ordering on the performance of all binary differentially private (DP) mechanisms. DP mec
Externí odkaz:
http://arxiv.org/abs/2310.20486
Autor:
Kim, Benjamin D., Vasudevan, Vipindev Adat, Woo, Jongchan, Cohen, Alejandro, D'Oliveira, Rafael G. L., Stahlbuhk, Thomas, Médard, Muriel
The use of Mutual Information (MI) as a measure to evaluate the efficiency of cryptosystems has an extensive history. However, estimating MI between unknown random variables in a high-dimensional space is challenging. Recent advances in machine learn
Externí odkaz:
http://arxiv.org/abs/2309.08019
Autor:
Gu, Yuzhou, Zhou, Ziqi, Günlü, Onur, D'Oliveira, Rafael G. L., Sadeghi, Parastoo, Médard, Muriel, Schaefer, Rafael F.
We study a new framework for designing differentially private (DP) mechanisms via randomized graph colorings, called rainbow differential privacy. In this framework, datasets are nodes in a graph, and two neighboring datasets are connected by an edge
Externí odkaz:
http://arxiv.org/abs/2309.05871
Autor:
Woo, Jongchan, Vasudevan, Vipindev Adat, Kim, Benjamin, Cohen, Alejandro, D'Oliveira, Rafael G. L., Stahlbuhk, Thomas, Médard, Muriel
This paper presents CERMET, an energy-efficient hardware architecture designed for hardware-constrained cryptosystems. CERMET employs a base cryptosystem in conjunction with network coding to provide both information-theoretic and computational secur
Externí odkaz:
http://arxiv.org/abs/2308.05063
Federated learning (FL) is an emerging paradigm that allows a central server to train machine learning models using remote users' data. Despite its growing popularity, FL faces challenges in preserving the privacy of local datasets, its sensitivity t
Externí odkaz:
http://arxiv.org/abs/2308.00540
The problem of mismatched guesswork considers the additional cost incurred by using a guessing function which is optimal for a distribution $q$ when the random variable to be guessed is actually distributed according to a different distribution $p$.
Externí odkaz:
http://arxiv.org/abs/2305.03850