'Tyagi and Watanabe provide readers with a new solid reference for unified understanding of key subjects in the cryptography as developed in seven decades since Shannon. In fact, this book provides a comprehensive and thorough presentation of information theoretically secure cryptographic primitives, also shedding due light on the relevance to computationally secure ones. It looks like those primitives have now been washed-up and reborn in the new cradle of information theory. I recommend this text as a reliable compass for both beginners and professionals working in cryptography.' Te Sun Han, National Institute of Information and Communications Technology, Japan
1. Introduction; Part I. External Adversary: Encryption, Authentication, Secret Key: 2. Basic information theory; 3. Secret keys and encryption; 4. Universal hash families; 5. Hypothesis testing; 6. Information reconciliation; 7. Random number generation; 8. Authentication; 9. Computationally secure encryption and authentication; 10. Secret key agreement; Part II. Internal Adversary: Secure Computation: 11. Secret sharing; 12. Two-party secure computation for passive adversary; 13. Oblivious transfer from correlated randomness; 14. Bit commitment from correlated randomness; 15. Active adversary and composable security; 16. Zero-knowledge proof; 17. Two-party secure computation for active adversary; 18. Broadcast, Byzantine agreement, and digital signature; 19. Multiparty secure computation; Appendix. Solutions to selected problems; References; Notation index; Subject index.