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.
![]() |
PDF
Nati_Con_Comm_1_2013.pdf - Published Version Restricted to Registered users only Download (328kB) | Request a copy |
Abstract
A pairwise independent network (PIN) model consists of pairwise secret keys (SKs) distributed among m terminals. The goal is to generate, through public communication among the terminals, a group SK that is information-theoretically secure from an eavesdropper. In this paper, we study the Harary graph PIN model, which has useful fault-tolerant properties. We derive the exact SK capacity for a regular Harary graph PIN model. Lower and upper bounds on the fault-tolerant SK capacity of the Harary graph PIN model are also derived.
Item Type: | Conference Paper |
---|---|
Series.: | National Conference on Communications NCC |
Publisher: | IEEE |
Additional Information: | Copyright of this article belongs to IEEE. |
Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
Date Deposited: | 30 Jul 2013 12:04 |
Last Modified: | 30 Jul 2013 12:04 |
URI: | http://eprints.iisc.ac.in/id/eprint/46926 |
Actions (login required)
![]() |
View Item |