Abstract
The problem of simultaneously generating two keys for a cellular model is investigated, in which each of four terminals, X0, X1, X2, and X3 observes one component of correlated sources. The terminal X0 wishes to generate secret keys K1 and K2 respectively, with terminals X1 and X2 under the help of terminal X3. They are allowed to communicate over a public channel. Both K1 and K2 are required to be concealed from an eavesdropper that has access to the public discussion. The key capacity region is established by designing a unified achievable strategy to achieve the cut-set outer bounds, which greatly simplifies the proof.
Original language | English (US) |
---|---|
Title of host publication | IEEE International Symposium on Information Theory - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 715-719 |
Number of pages | 5 |
Volume | 2015-June |
ISBN (Print) | 9781467377041 |
DOIs | |
State | Published - Sep 28 2015 |
Event | IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: Jun 14 2015 → Jun 19 2015 |
Other
Other | IEEE International Symposium on Information Theory, ISIT 2015 |
---|---|
Country | Hong Kong |
City | Hong Kong |
Period | 6/14/15 → 6/19/15 |
Keywords
- Cut-set bound
- key capacity region
- secret key generation
- source model
ASJC Scopus subject areas
- Applied Mathematics
- Modeling and Simulation
- Theoretical Computer Science
- Information Systems