This introductory graduate coursebook offers a mathematical foundation for modern cryptography. Coverage includes secret key agreement, authentication, secret sharing, and secure computation. The book will also serve experts in the field as a reference for information-theoretic tools such as smooth min/max entropies and information spectrum.
This introductory graduate coursebook offers a mathematical foundation for modern cryptography. Coverage includes secret key agreement, authentication, secret sharing, and secure computation. The book will also serve experts in the field as a reference for information-theoretic tools such as smooth min/max entropies and information spectrum.
Himanshu Tyagi is an associate professor with the Department of Electrical Communication Engineering at the Indian Institute of Science, Bangalore. A specialist in information theory, his current research focuses on blockchains for crowdsourced networks, distributed statistics under information constraints, and privacy for federated learning data pipelines. He has served as an associate editor for the 'IEEE Transactions on Information Theory' and has been awarded the Indian National Science Academy (INSA) Young Scientist medal for 2020.
Inhaltsangabe
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.
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.
Es gelten unsere Allgemeinen Geschäftsbedingungen: www.buecher.de/agb
Impressum
www.buecher.de ist ein Shop der buecher.de GmbH & Co. KG Bürgermeister-Wegele-Str. 12, 86167 Augsburg Amtsgericht Augsburg HRA 13309
