• Publications
  • Influence
Secure Communication Over Fading Channels
TLDR
The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. Expand
  • 895
  • 28
  • PDF
SpiderBoost: A Class of Faster Variance-reduced Algorithms for Nonconvex Optimization
TLDR
This paper proposes SpiderBoost as an improved scheme, which comes with two major advantages compared to SPIDER. Expand
  • 60
  • 23
Compound Wiretap Channels
TLDR
This paper considers the compound wiretap channel, which generalizes Wyner's wiretap model to allow the channels to the (legitimate) receiver and to the eavesdropper to take a number of possible states. Expand
  • 273
  • 18
Multiple-Access Channels With Confidential Messages
  • Y. Liang, H. Poor
  • Computer Science
  • IEEE Transactions on Information Theory
  • 1 March 2008
TLDR
A discrete memoryless multiple-access channel with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has confidential information intended for the destination. Expand
  • 321
  • 17
  • PDF
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
TLDR
Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. Expand
  • 202
  • 16
  • PDF
Cooperative relay broadcast channels
TLDR
The capacity regions are investigated for cooperative relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. Expand
  • 105
  • 15
Information Theoretic Security
TLDR
Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems. Expand
  • 550
  • 13
Gaussian orthogonal relay channels: optimal resource allocation and capacity
  • Y. Liang, V. Veeravalli
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 1 September 2005
TLDR
We studied the capacity of a Gaussian orthogonal relay model, treating the resource allocation as a parameter that needs to be optimized over the parameter /spl theta/, which represents the fraction of the resource assigned to channel 1. Expand
  • 246
  • 13
  • PDF
Multiple-Input Multiple-Output Gaussian Broadcast Channels With Common and Confidential Messages
  • H. Ly, T. Liu, Y. Liang
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 15 July 2009
TLDR
This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a confidential message intended only for receiver 1 but needing to be kept asymptotically perfectly secure from receiver 2. Expand
  • 100
  • 13
  • PDF
Rate Regions for Relay Broadcast Channels
  • Y. Liang, G. Kramer
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 15 June 2006
TLDR
A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a relay to assist destination 2. Expand
  • 177
  • 11
  • PDF