4 citations · 5 across the 11 of their papers we have counts for
17 papers
Fundamental Privacy Limits in Bipartite Networks under Active Attacks
Mahshad Shariatnasab, Farhad Shirani, Elza Erkip
This work considers active deanonymization of bipartite networks. The scenario arises naturally in evaluating privacy in various applications such as social networks, mobility netw…
On Graph Matching Using Generalized Seed Side-Information
Mahshad Shariatnasab, Farhad Shirani, Siddharth Garg +1
In this paper, matching pairs of stocahstically generated graphs in the presence of generalized seed side-information is considered. The graph matching problem emerges naturally in…
A Concentration of Measure Approach to Correlated Graph Matching
Farhad Shirani, Siddharth Garg, Elza Erkip
The graph matching problem emerges naturally in various applications such as web privacy, image processing and computational biology. In this paper, graph matching is considered un…
On the Joint Typicality of Permutations of Sequences of Random Variables
Farhad Shirani, Siddharth Garg, Elza Erkip
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the as…
A New Achievable Rate-Distortion Region for Distributed Source Coding
Farhad Shirani, S. Sandeep Pradhan
In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured…
Opportunistic Temporal Fair Mode Selection and User Scheduling for Full-duplex Systems
Shahram Shahsavari, Farhad Shirani, Mohammad A Khojastepour +1
In-band full-duplex (FD) communications - enabled by recent advances in antenna and RF circuit design - has emerged as one of the promising techniques to improve data rates in wire…