ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Fault-tolerant secret key generation

Tyagi, Himanshu and Kashyap, Navin and Sankarasubramaniam, Yogesh and Viswanathan, Kapali (2012) Fault-tolerant secret key generation. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), 1-6 July 2012, Cambridge, MA.

[img] PDF
Info_The_Proc_1787_2012.pdf - Published Version
Restricted to Registered users only

Download (135kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/ISIT.2012.6283586


Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the switch. We are interested in fault-tolerant secret key rates, i.e., the rates of secret key generated even if a subset of nodes drop out before the completion of the communication protocol. We formulate a new notion of fault-tolerant secret key capacity, and present an upper bound on it. This upper bound is shown to be tight when the random variables corresponding to the observations of nodes are exchangeable. Further, it is shown that one round of interaction achieves the fault-tolerant secret key capacity in this case. The upper bound is also tight for the case of a pairwise independent network model consisting of a complete graph, and can be attained by a noninteractive protocol.

Item Type: Conference Paper
Additional Information: Copyright of this article belongs to IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Depositing User: Francis Jayakanth
Date Deposited: 17 Dec 2013 07:10
Last Modified: 17 Dec 2013 07:10
URI: http://eprints.iisc.ac.in/id/eprint/48013

Actions (login required)

View Item View Item