Title :
On the secret key capacity of the Harary graph PIN model
Author :
Kashyap, Navin ; Mukherjee, Manuj ; Sankarasubramaniam, Yogesh
Author_Institution :
Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, India
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.
Keywords :
Fault tolerance; Fault tolerant systems; Graph theory; Protocols; Random variables; Security; Upper bound;
Conference_Titel :
Communications (NCC), 2013 National Conference on
Conference_Location :
New Delhi, India
Print_ISBN :
978-1-4673-5950-4
Electronic_ISBN :
978-1-4673-5951-1
DOI :
10.1109/NCC.2013.6487950
