Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- Part I Theoretical Foundations
- Part II Secure Communication
- Part III Secret Key Generation and Authentication
- 12 Multiple Secret Key Generation: Information Theoretic Models and Key Capacity Regions
- 13 Secret Key Generation for Physical Unclonable Functions
- 14 Wireless Physical-Layer Authentication for the Internet of Things
- Part IV Data Systems and Related Applications
- Index
- References
12 - Multiple Secret Key Generation: Information Theoretic Models and Key Capacity Regions
from Part III - Secret Key Generation and Authentication
Published online by Cambridge University Press: 28 June 2017
Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- Part I Theoretical Foundations
- Part II Secure Communication
- Part III Secret Key Generation and Authentication
- 12 Multiple Secret Key Generation: Information Theoretic Models and Key Capacity Regions
- 13 Secret Key Generation for Physical Unclonable Functions
- 14 Wireless Physical-Layer Authentication for the Internet of Things
- Part IV Data Systems and Related Applications
- Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Publisher: Cambridge University PressPrint publication year: 2017
References
[1] and , “Common randomness in information theory and cryptography – Part I: Secret sharing,” IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121–1132, Jul. 1993.Google Scholar
[2] , “Secret key agreement by public discussion from common information,” IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733–742, May 1993.Google Scholar
[3] and , “Noiseless coding of correlated information sources,” IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471–480, Jul. 1973.Google Scholar
[4] and , “Secrecy capacities for multiple terminals,” IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047–3061, Dec. 2004.Google Scholar
[5] and , “Unconditionally secure key agreement and the intrinsic conditional information,” IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 499–514, Feb. 1999.Google Scholar
[6] and , “Common randomness and secret key generation with a helper,” IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 344–366, Mar. 2000.Google Scholar
[7] and , “Secret-key agreement over unauthenticated public channels – Part I. Definitions and a completeness result,” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 822–831, Apr. 2003.Google Scholar
[8] and , “Secret-key agreement over unauthenticated public channels – Part II. The simulatability condition,” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 832–838, Apr. 2003.Google Scholar
[9] and , “Secret-key agreement over unauthenticated public channels – Part III. Privacy amplification,” IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 839–851, Apr. 2003.Google Scholar
[10] and , “The secret key–private key capacity region for three terminals,” in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 2142–2146.
[11] , , , and , “The secret key–private key generation over three terminals: Capacity region,” in Proc. IEEE Int. Symp. Inf. Theory, Honolulu, HI, USA, Jul. 2014, pp. 1141–1145.
[12] , , , and , “The capacity region of the source-type model for secret key and private key generation,” IEEE Trans. Inf. Theory, vol. 60, no. 10, pp. 6389–6398, Oct. 2014.Google Scholar
[13] and , “The private key capacity region for three terminals,” in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, USA, Jun. 2004, p. 44.
[14] and , “Simultaneously generating multiple keys in many to one networks,” in Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, Jul. 2013, pp. 2394–2398.
[15] , , and , “Key capacity region for a cellular source model,” in Proc. IEEE Inf. Theory Workshop, Hobart, TAS, Australia, Nov. 2014, pp. 321–325.
[16] , , , and (Shitz), “Two-key generation for a cellular model with a helper,” in Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, Jun. 2015, pp. 715–719.
[17] , , , and (Shitz), “Multi-key generation over a cellular model with a helper,” submitted to IEEE Trans. Inf. Theory, 2015, available at http://hzhan23.mysite.syr.edu
[18] and , “Simultaneously generating multiple keys and multi-commodity flow in networks,” in Proc. IEEE Inf. Theory Workshop, Lausanne, Switzerland, Sep. 2012, pp. 627–631.
[19] and , “Key generation algorithms for pairwise independent networks based on graphical models,” IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 4828–4837, Sep. 2015.Google Scholar
[20] and , “From weak to strong information-theoretic key agreement,” in Proc. IEEE Int. Symp. Inf. Theory, Sorrento, Italy, Jun. 2000, p. 18.
[21] , “Information theoretic generation of multiple secret keys,” Ph.D. dissertation, University of Maryland, College Park, MD, USA, 2005.
[22] and , Network Information Theory. Cambridge: Cambridge University Press, 2011.
[23] , , and , “Achievability proof via output statistics of random binning,” IEEE Trans. Inf. Theory, vol. 60, no. 11, pp. 6760–6786, Nov. 2014.Google Scholar
[24] and , “Group secret key generation algorithms,” in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 2007, pp. 2596–2600.
[25] , , and , “Channel identification: Secret sharing using reciprocity in ultrawideband channels,” IEEE Trans. Inf. Forensics Security, vol. 2, no. 3, pp. 364–375, Sep. 2007.Google Scholar
[26] , , , , and , “Information-theoretic key generation from wireless channels,” IEEE Trans. Inf. Forensics Security, vol. 5, no. 2, pp. 240–254, Jun. 2010.Google Scholar
[27] , , and , “A unified framework for key agreement over wireless fading channels,” IEEE Trans. Inf. Forensics Security, vol. 7, no. 2, pp. 480–490, Apr. 2012.Google Scholar
[28] , , and , “Impact of channel sparsity and correlated eavesdropping on secret key generation from multipath channel randomness,” in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA, Jun. 2010, pp. 2518–2522.
[29] , , , , and , “Radiotelephathy: Extracting a secret key from an unauthenticated wireless channel,” in Proc. ACM Int. Conf. Mobile Computing and Networking, San Francisco, CA, USA, Sep. 2008, pp. 128–139.
[30] , “Interactive secret key generation over reciprocal fading channels,” in Proc. 50th Annual Allerton Conf. Commun., Control, Computing, Monticello, IL, USA, Sep. 2012, pp. 1374–1381.
[31] , , , , and , “Group secret key generation over broadcast erasure channels,” in Proc. 44th Asilomar Conf. Signals, Systems, Computers, Pacific Grove, CA, USA, Nov. 2010, pp. 719–723.
[32] , , and , Network Flows. Upper Saddle River, NJ: Prentice Hall, 1993.
[33] , “Multi-commodity network flows,” Operations Research, vol. 11, no. 3, pp. 344–360, May 1963.Google Scholar
[34] , , and , “Approximate max-flow min-(multi)cut theorems and their applications,” SIAM J. Comput., vol. 25, no. 2, pp. 235–251, Apr. 1996.Google Scholar
[35] , , , , and , “Secret key generation for a pairwise independent network model,” IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6482–6489, Dec. 2010.Google Scholar
[36] and , “Secret key agreement from vector Gaussian sources by rate limited public communication,” IEEE Trans. Inf. Forensics Security, vol. 6, no. 3, pp. 541–550, Sep. 2011.Google Scholar
[37] , , and , “Secret key generation with one communicator and a one-shot converse via hypercontractivity,” in Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, Jun. 2015, pp. 710–714.
[38] , , and , “Secret key agreement with rate-limited communication among three nodes,” in Proc. Inf. Theory Applications Workshop, La Jolla, CA, USA, Feb. 2015.
[39] , , and , “A new secret key agreement scheme in a four-terminal network,” in Proc. Canadian Workshop Inf. Theory, Kelowna, BC, Canada, May 2011, pp. 151–154.
[40] , , , and (Shitz), “Degraded broadcast channel: Secrecy outside of a bounded range,” in Proc. IEEE Inf. Theory Workshop, Jerusalem, Israel, Apr. 2015, pp. 1–5.
[41] , , , and (Shitz), “Rate splitting and sharing for degraded broadcast channel with secrecy outside a bounded range,” in Proc. IEEE Int. Symp. Inf. Theory, Hong Kong, Jun. 2015, pp. 1357–1361.
[42] , , , and (Shitz), “On the secrecy degrees of freedom of multi-antenna wiretap channels with delayed CSIT,” in Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul. 2011, pp. 2866–2870.
[43] , , , and (Shitz), “Multiple-input multiple-output Gaussian broadcast channels with confidential messages,” IEEE Trans. Inf. Theory, vol. 56, no. 9, pp. 4215–4227, Sep. 2010.Google Scholar
- 2
- Cited by