Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Karmoose, Mohammed"'
Autor:
Agarwal, Gaurav Kumar, Karmoose, Mohammed, Diggavi, Suhas, Fragouli, Christina, Tabuada, Paulo
Publikováno v:
Transactions in Automatic Control 2020
In Cyber-Physical Systems (CPS), inference based on communicated data is of critical significance as it can be used to manipulate or damage the control operations by adversaries. This calls for efficient mechanisms for secure transmission of data sin
Externí odkaz:
http://arxiv.org/abs/2006.15998
In the traditional index coding problem, a server employs coding to send messages to $n$ clients within the same broadcast domain. Each client already has some messages as side information and requests a particular unknown message from the server. Al
Externí odkaz:
http://arxiv.org/abs/1809.08263
Autor:
Agarwal, Gaurav Kumar, Karmoose, Mohammed, Diggavi, Suhas, Fragouli, Christina, Tabuada, Paulo
In Cyber-Physical Systems (CPSs), inference based on communicated data is of critical significance as it can be used to manipulate or damage the control operations by adversaries. This calls for efficient mechanisms for secure transmission of data si
Externí odkaz:
http://arxiv.org/abs/1809.04580
Autor:
Karmoose, Mohammed, Fragouli, Christina, Diggavi, Suhas, Misoczki, Rafael, Yang, Lily L., Zhang, Zhenliang
The fact that Millimeter Wave (mmWave) communication needs to be directional is usually perceived as a challenge; in this paper we argue that it enables efficient secret key sharing that are unconditionally secure from passive eavesdroppers, by build
Externí odkaz:
http://arxiv.org/abs/1803.08188
It was recently observed in [1], that in index coding, learning the coding matrix used by the server can pose privacy concerns: curious clients can extract information about the requests and side information of other clients. One approach to mitigate
Externí odkaz:
http://arxiv.org/abs/1801.03892
In this paper, we revisit the communication vs. distributed computing trade-off, studied within the framework of MapReduce in [1]. An implicit assumption in the aforementioned work is that each server performs all possible computations on all the fil
Externí odkaz:
http://arxiv.org/abs/1705.08966
Index coding employs coding across clients within the same broadcast domain. This typically assumes that all clients learn the coding matrix so that they can decode and retrieve their requested data. However, learning the coding matrix can pose priva
Externí odkaz:
http://arxiv.org/abs/1705.08437
Using a broadcast channel to transmit clients' data requests may impose privacy risks. In this paper, we address such privacy concerns in the index coding framework. We show how a malicious client can infer some information about the requests and sid
Externí odkaz:
http://arxiv.org/abs/1701.04958
Primary user activity is a major bottleneck for existing routing protocols in cognitive radio networks. Typical routing protocols avoid areas that are highly congested with primary users, leaving only a small fragment of available links for secondary
Externí odkaz:
http://arxiv.org/abs/1608.01632
Social groups give the opportunity for a new form of caching. In this paper, we investigate how a social group of users can jointly optimize bandwidth usage, by each caching parts of the data demand, and then opportunistically share these parts among
Externí odkaz:
http://arxiv.org/abs/1601.05068