Complexity in the title of the book, one might have expected a deeper and more comprehensive treatment of complexity-theoretic issues. For example, the Arthur-Merlin hierarchy, which combines the power of nondeterminism with the power of randomization (in the sense of BPP) and which is closely related to the interactive proof systems treated in Chapter 11, is not considered (only mentioned in the chapter notes). Thus, the reader learns nothing about the complexity-theoretic properties (inclusions, collapse, etc.) of this hierarchy. However, as mentioned in the introduction, Complexity and Cryptography. An Introduction by Talbot and Welsh is a recommendable source for an introductory course on cryptography, which provides cryptographically related complexity theory to some extent.
/lp/association-for-computing-machinery/review-of-complexity-theory-and-cryptology-an-introduction-to-47vaFj0F7t