Up a level |
Mukherjee, Manuj and Chan, Chung and Kashyap, Navin and Zhou, Qiaoqiao (2016) Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 2504-2508.
Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2016) When is Omniscience a Rate-Optimal Strategy for Achieving Secret Key Capacity? In: IEEE Information Theory Workshop (ITW), SEP 11-14, 2016, Cambridge, ENGLAND.
Mukherjee, Manuj and Kashyap, Navin and Sankarasubramaniam, Yogesh (2014) Achieving SK Capacity in the Source Model: When Must All Terminals Talk? In: IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), JUN 29-JUL 04, 2014, Honolulu, HI, pp. 1156-1160.
Mukherjee, Manuj and Kashyap, Navin (2014) On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. In: IEEE International Symposium on Information Theory (ISIT), JUN 29-JUL 04, 2014, Honolulu, HI, pp. 1151-1155.
Mukherjee, Manuj and Kashyap, Navin (2015) The Communication Complexity of Achieving SK Capacity in a Class of PIN Models. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 296-300.
Kashyap, Navin and Mukherjee, Manuj and Sankarasubramaniam, Yogesh (2013) On the secret key capacity of the harary graph PIN model. In: 2013 National Conference on Communications (NCC), 15-17 Feb. 2013, New Delhi, India.
Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2018) On the Optimality of Secret Key Agreement via Omniscience. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 64 (4, 1). pp. 2371-2389.
Mukherjee, Manuj and Kashyap, Navin and Sankarasubramaniam, Yogesh (2016) On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model. In: IEEE TRANSACTIONS ON INFORMATION THEORY, 62 (7). pp. 3811-3830.