000			01399 a2200205 4500
003			OSt
020			_a9781108484336
040			_cIIT Kanpur
041			_aeng
082			_a005.82 _bT952i
100			_aTyagi, Himanshu
245			_aInformation-theoretic cryptography _cHimanshu Tyagi and Shun Watanabe
260			_bCambridge University Press _c2023 _aCambridge
300			_axiv, 504p
520			_aThis book offers a mathematical foundation for modern cryptography. It is primarily intended as an introduction for graduate students. Readers should have basic knowledge of probability theory, but familiarity with computational complexity is not required. Starting from Shannon's classic result on secret key cryptography, fundamental topics of cryptography, such as secret key agreement, authentication, secret sharing, and secure computation, are covered. Particular attention is drawn to how correlated randomness can be used to construct cryptographic primitives. To evaluate the efficiency of such constructions, information-theoretic tools, such as smooth min/max entropies and information spectrum, are developed. The broad coverage means the book will also be useful to experts as well as students in cryptography as a reference for information-theoretic concepts and tools.
650			_aInformation theory
650			_aCryptography
700			_aWatanabe, Shun
942			_cBK
999			_c566941 _d566941