Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- Part I Theoretical Foundations
- 1 Effective Secrecy: Reliability, Confusion, and Stealth
- 2 Error-Free Perfect Secrecy Systems
- 3 Secure Source Coding
- 4 Networked Secure Source Coding
- Part II Secure Communication
- Part III Secret Key Generation and Authentication
- Part IV Data Systems and Related Applications
- Index
- References
1 - Effective Secrecy: Reliability, Confusion, and Stealth
from Part I - Theoretical Foundations
Published online by Cambridge University Press: 28 June 2017
Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- Part I Theoretical Foundations
- 1 Effective Secrecy: Reliability, Confusion, and Stealth
- 2 Error-Free Perfect Secrecy Systems
- 3 Secure Source Coding
- 4 Networked Secure Source Coding
- Part II Secure Communication
- Part III Secret Key Generation and Authentication
- 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
[2] and , “Broadcast channels with confidential messages,” IEEE Trans. Inf. Theory, vol. 24, no. 3, pp. 339–348, May 1978.Google Scholar
[3] and , “Information-theoretic key agreement: From weak to strong secrecy for free,” Lecture Notes in Computer Science, vol. 1807, pp. 351–368, 2000.Google Scholar
[4] , “Almost independence and secrecy capacity,” Probl. Pered. Inform., vol. 32, no. 1, pp. 48–57, 1996.Google Scholar
[5] and , “Approximation theory of output statistics,” IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752–772, May 1993.Google Scholar
[6] , “General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562–1575, Apr. 2006.Google Scholar
[7] and , “Strong secrecy from channel resolvability,” IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 8077–8098, Dec. 2013.Google Scholar
[8] and , “Informational divergence approximations to product distributions,” in Proc. Canadian Workshop Inf. Theory, Toronto, ON, Canada, Jun. 2013, pp. 76–81.
[9] , “Secret, public and quantum correlation cost of triples of random variables,” in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 2270–2274.
[10] and , “Effective secrecy: Reliability, confusion and stealth,” Nov. 2013. [Online]. Available: http://arxiv.org/abs/1311.1411
[11] , , and , “Reliability and secrecy functions of the wiretap channel under cost constraint,” Jul. 2013. [Online]. Available: http://arxiv.org/abs/1307.0608
[12] , , and , “Reliability and secrecy functions of the wiretap channel under cost constraint,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562–1575, Apr. 2015.Google Scholar
[13] Committee on National Security Systems, “Committee on National Security Systems (CNSS) Glossary,” Tech. Rep., Apr. 2015, CNSSI 4009. [Online]. Available: www.cnss.gov
[14] , “Performance metrics for low probability of intercept communication systems,” Air Force Office of Scientific Research, Bolling AFB, Washington DC, Tech. Rep., Oct. 1993, grant AFOSR-91-0018.
[15] , Spread Spectrum Signal Design: LPE and AJ Systems. Rockville, MD: Computer Science Press, 1988.
[16] , , and , “Limits of reliable communication with low probability of detection on AWGN channels,” IEEE J. Sel. Areas Commun., vol. 31, no. 9, pp. 1921–1930, Sep. 2013.Google Scholar
[17] , , and , “Reliable deniable communcation: Hiding messages in noise,” in Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, Jul. 2013, pp. 2945–2949.
[18] , , , and , “Achieving undetectable communication,” IEEE J. Sel. Topics Signal Proc., vol. 9, no. 7, pp. 1195–1205, Oct. 2015.Google Scholar
[19] , , and , “Fundamental limits of communication with low probability of detection,” IEEE Trans. Inf. Theory, vol. 62, no. 6, pp. 3493–3503, June 2016.Google Scholar
[20] , “Covert communication over noisy channels: A resolvability perspective,” IEEE Trans. Inf. Theory, vol. 62, no. 5, pp. 2334–2354, May 2016.Google Scholar
[21] , Applied Digital Information Theory, ETH Zurich, Zurich, Switzerland, 1980–1998.
[22] and , “Coding for computing,” IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903–917, Mar. 2001.Google Scholar
[23] and , “The optimal use of rate-limited randomness in broadcast channels with confidential messages,” IEEE Trans. Inf. Theory, vol. 61, no. 2, pp. 983–995, Feb. 2015.Google Scholar
[24] , “Teaching IT: An identity for the Gelfand-Pinsker converse,” IEEE Inf. Theory Society Newsletter, vol. 61, no. 4, pp. 4–6, Dec. 2011.Google Scholar
[25] , “Coding for relay networks and effective secrecy for wire-tap channels,” Ph.D. dissertation, Technische Universität München, Munich, Germany, 2014.
[26] and , Network Information Theory. Cambridge: Cambridge University Press, 2011.
[27] and , Testing Statistical Hypotheses, 3rd edn. New York: Springer, 2005.
[28] and , Elements of Information Theory, 2nd edn. Chichester:Wiley & Sons, 2006.
- 5
- Cited by