Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Hessam Mahdavifar"'
Publikováno v:
IEEE Access, Vol 9, Pp 88137-88150 (2021)
There are applications that may require removing the trace of a sample from the system, e.g., a user requests their data to be deleted, or corrupted data is discovered. Simply removing a sample from storage units does not necessarily remove its entir
Externí odkaz:
https://doaj.org/article/bebb1f259ca2459896b6e892a4410966
Publikováno v:
IEEE Transactions on Communications. 70:6399-6409
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ced61174251894270a9b605236474b0d
https://doi.org/10.1109/tcomm.2022.3204286
https://doi.org/10.1109/tcomm.2022.3204286
Publikováno v:
IEEE Transactions on Information Forensics and Security. 17:1893-1904
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c36349d3704de351528ec5689c1f28fd
https://doi.org/10.1109/tifs.2022.3173417
https://doi.org/10.1109/tifs.2022.3173417
Publikováno v:
ISIT
We consider the problem of coded computing, where a computational task is performed in a distributed fashion in the presence of adversarial workers. We propose techniques to break the adversarial toleration threshold barrier previously known in coded
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::844dc673b70c4e0fc65ad6ad1194f2bd
https://doi.org/10.1109/jsait.2021.3102956
https://doi.org/10.1109/jsait.2021.3102956
Publikováno v:
IEEE Transactions on Communications. 69:3664-3681
In this paper, we present a low-complexity recursive approach for massive and scalable code-domain nonorthogonal multiple access (NOMA) with applications to emerging low-capacity scenarios. The problem definition in this paper is inspired by three ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3f58ecb66b0c56cb78068266cfa868f
https://doi.org/10.1109/tcomm.2021.3064327
https://doi.org/10.1109/tcomm.2021.3064327
Autor:
Nasser Aldaghri, Hessam Mahdavifar
Publikováno v:
Allerton
Cryptographic protocols are often implemented at upper layers of communication networks, while error-correcting codes are employed at the physical layer. In this article, we consider utilizing readily-available physical layer functions, such as encod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c107635f4ff8fe0cf8f574d7763b6557
https://doi.org/10.1109/jsait.2021.3053020
https://doi.org/10.1109/jsait.2021.3053020
Autor:
Mahdi Soleymani, Hessam Mahdavifar
Publikováno v:
ISIT
We consider a distributed secret sharing system that consists of a dealer, n storage nodes, and m users. Each user is given access to a certain subset of storage nodes, where it can download the stored data. The dealer wants to securely convey a spec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cf6ef84b55a403637c76b438859381d3
https://doi.org/10.1109/tit.2020.3028194
https://doi.org/10.1109/tit.2020.3028194
Autor:
Nasser Aldaghri, Hessam Mahdavifar
Publikováno v:
IEEE Transactions on Information Forensics and Security. 15:2692-2705
Two legitimate parties, referred to as Alice and Bob, wish to generate secret keys from the wireless channel in the presence of an eavesdropper, referred to as Eve, in order to use such keys for encryption and decryption. In general, the secret key r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b00a50a45a69759e90f2b8f931d573e5
https://doi.org/10.1109/tifs.2020.2974621
https://doi.org/10.1109/tifs.2020.2974621
Let $A(n, d)$ denote the maximum size of a binary code of length $n$ and minimum Hamming distance $d$. Studying $A(n, d)$, including efforts to determine it as well to derive bounds on $A(n, d)$ for large $n$'s, is one of the most fundamental subject
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00c447e1af0a75d27d51fcc110162370
http://arxiv.org/abs/2202.03472
http://arxiv.org/abs/2202.03472
In this work, we propose a method for speeding up linear regression distributively, while ensuring security. We leverage randomized sketching techniques, and improve straggler resilience in asynchronous systems. Specifically, we apply a random orthon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c196c1efc5df4c05cffd7e11eda4d40e