1. | Secrecy Outage of a Cognitive Radio Network with Selection of Energy Harvesting Relay and Imperfect CSI |
2. | A comprehensive framework for Double Spatial Modulation under imperfect channel state information |
3. | Secure computation of randomized functions: Further results |
4. | Signal constellations employing multiplicative groups of Gaussian and Eisenstein integers for Enhanced Spatial Modulation |
5. | Coding for Arbitrarily Varying Remote Sources |
6. | Function Computation through a Bidirectional Relay |
7. | An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback |
8. | Communication and Randomness Lower Bounds for Secure Computation |
9. | Renyi Information Complexity and an Information Theoretic Characterization of the Partition Bound |
10. | Secret Communication Over Broadcast Erasure Channels With State-Feedback |
11. | Fundamental Limits of Secretive Coded Caching |
12. | Secondary Throughput in Underlay Cognitive Radio Network with Imperfect CSI and Energy Harvesting Relay |
13. | On Coding for Secure Computing |
14. | On the Noisy Feedback Capacity of Gaussian Broadcast Channels |
15. | On the Oblivious Transfer Capacity of the Degraded Wiretapped Binary Erasure Channel |
16. | Dirty Paper Arbitrarily Varying Channel with a State-Aware Adversary |
17. | Private Data Transfer over a Broadcast Channel |
18. | A new upperbound for the oblivious transfer capacity of discrete memoryless channels |
19. | How to securely compute the modulo-two sum of binary sources |
20. | Effects of Primary User Interference and Channel Estimation Errors on Ergodic Capacity of Secondary User |
21. | On the Communication Complexity of Secure Computation |
22. | On the oblivious transfer capacity region of the binary erasure broadcast channel |