Recherche

Afficher tous les résultats pour

Accueil

Personne

Suhas Diggavi

Cette personne n’est plus à l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (77)

Group secret key agreement over state-dependent wireless broadcast channels

Suhas Diggavi, Christina Fragouli, Mahdi Jafari Siavoshani

We consider a group of m trusted nodes that aim to create a shared secret key K, using a state-dependent wireless broadcast channel that exists from one of the honest nodes to the rest of the nodes including a passive eavesdropper Eve. All of the trusted n ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

On the capacity of non-coherent network coding

Suhas Diggavi, Christina Fragouli, Soheil Mohajerzefreh, Mahdi Jafari Siavoshani

We consider the problem of multicasting information from a source to a set of receivers over a network where interme- diate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoher ...

2011

Secret message capacity of erasure broadcast channels with feedback

Suhas Diggavi, Christina Fragouli, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of a wiretapped erasure channel where causal channel state informa- tion of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generati ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

On Source Transmission over Deterministic Relay Networks

Suhas Diggavi, Soheil Mohajerzefreh

Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all ...

2010

Erased Secrets: Practical Information-Theoretic Group Secrecy

Suhas Diggavi, Christina Fragouli, Mahdi Jafari Siavoshani, Aikaterini Argyraki, Uday Kiran Pulleti

We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...

2010

Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

Suhas Diggavi, Soheil Mohajerzefreh

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2(K) - 1 information sources, ordered in a decreasing level of importance, is encoded into K messages (or descriptions). There are 2(K) - 1 decoders, each of which has a ...

2010

Joint Identity-Message Coding for Sensor Networks

Lorenzo Keller, Suhas Diggavi, Christina Fragouli, Mahdi Jafari Siavoshani, Aikaterini Argyraki

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit—for instance, in many cases, sensors are used to detect ...

Institute of Electrical and Electronics Engineers2010

On the Capacity of Non-Coherent Network Coding

Suhas Diggavi, Christina Fragouli, Soheil Mohajerzefreh, Mahdi Jafari

The min-cut value towards a single receiver in a network with unit capacity edges can be achieved by routing a single bit. The multicast theorem in network coding shows that, the common min-cut value towards N >= 1 receivers can also be achieved using pack ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Capacity of Deterministic Z-Chain Relay-Interference Network

Suhas Diggavi, Christina Fragouli, Soheil Mohajerzefreh

The wireless multiple-unicast problem is considered over a layered network, where the rates of transmission are limited by the relaying and interference effect. The deterministic model introduced in 131 is used to capture the broadcasting and multiple acce ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Multiple Description Coding for Stationary Gaussian Sources

Suhas Diggavi, Jun Chen

We consider the problem of multiple description coding for stationary Gaussian sources under the squared error distortion measure. The rate region is characterized for the 2-description case. It is shown that each supporting line of the rate region is achi ...

2009

Code Construction for Multiple Sources Network Coding

Suhas Diggavi, Christina Fragouli

In several wireless applications multiple sources transmit information to one or more receivers, many times over unknown topologies. This is especially so in mobile networks where learning the topology may have prohibitive complexity. Network coding techni ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2009

Linear Diversity-Embedding STBC: Design Issues and Applications

Suhas Diggavi

We design a novel class of space-time codes, called linear diversity-embedding space-time block codes (LDE-STBC) where a high-rate STBC is linearly superimposed on a high-diversity STBC without requiring channel knowledge at the transmitter. In applying th ...

2009

On Noise Insertion Strategies for Wireless Network Secrecy

Etienne Perron, Emre Telatar, Suhas Diggavi

We provide lower and upper bounds on the optimal rate for reliable and secret transmission of a message from one node to another in an arbitrary wireless network with deterministic signal interaction. Certain relay nodes are allowed to insert noise into th ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Lossy Source Coding with Gaussian or Erased Side-Information

Etienne Perron, Emre Telatar, Suhas Diggavi

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side-information. The first setup is when the source and side-information are jointly Gaussian and the distortion measure is quadratic. The sec ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Identity Aware Sensor Networks

Lorenzo Keller, Suhas Diggavi, Christina Fragouli, Mahdi Jafari Siavoshani, Aikaterini Argyraki

In a significant class of sensor-network applications, the identities of the reporting sensors constitute the bulk of the communicated data, whereas the message itself can be as small as a single bit---for instance, in many cases, sensors are used to detec ...

2009

Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion

Suhas Diggavi, Soheil Mohajerzefreh

We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric mean-squared error (MSE) distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region can b ...

2009

Network coding for undirected information exchange

Suhas Diggavi, Christina Fragouli

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achie ...

2009

The Interference-Multiple-Access Channel

Etienne Perron, Emre Telatar, Suhas Diggavi

We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the o ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

On the capacity of multisource non-coherent network coding

Suhas Diggavi, Christina Fragouli, Soheil Mohajerzefreh, Mahdi Jafari Siavoshani

We consider multisource non-coherent network coding, where multiple sources send information to one or multiple receivers. We prove that this is equivalent to a ldquosubspacerdquo channel, that takes subspaces as inputs and outputs. We then show that the r ...

2009

On Cooperative Wireless Network Secrecy

Etienne Perron, Emre Telatar, Suhas Diggavi

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Page 2 sur 4