TY - GEN
T1 - On the secret key capacity of the Harary graph PIN model
AU - Kashyap, Navin
AU - Mukherjee, Manuj
AU - Sankarasubramaniam, Yogesh
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84894408988&partnerID=8YFLogxK
U2 - 10.1109/ncc.2013.6487950
DO - 10.1109/ncc.2013.6487950
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84894408988
SN - 9781467359528
T3 - 2013 National Conference on Communications, NCC 2013
BT - 2013 National Conference on Communications, NCC 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 National Conference on Communications, NCC 2013
Y2 - 15 February 2013 through 17 February 2013
ER -