Dedication

pp v-vi

Contents

pp vii-xii

Preface

pp xiii-xiv

1 - Introduction

pp 1-12

Part I - External Adversary: Encryption, Authentication, Secret Key

pp 13-14

2 - Basic Information Theory

pp 15-46

3 - Secret Keys and Encryption

pp 47-65

4 - Universal Hash Families

pp 66-86

5 - Hypothesis Testing

pp 87-103

6 - Information Reconciliation

pp 104-117

7 - Random Number Generation

pp 118-138

8 - Authentication

pp 139-157

9 - Computationally Secure Encryption and Authentication

pp 158-176

10 - Secret Key Agreement

pp 177-206

Part II - Internal Adversary: Secure Computation

pp 207-208

11 - Secret Sharing

pp 209-226

12 - Two-party Secure Computation for a Passive Adversary

pp 227-261

13 - Oblivious Transfer from Correlated Randomness

pp 262-289

14 - Bit Commitment from Correlated Randomness

pp 290-311

15 - Active Adversary and Composable Security

pp 312-361

16 - Zero-knowledge Proof

pp 362-373

17 - Two-party Secure Computation for an Active Adversary

pp 374-398

18 - Broadcast, Byzantine Agreement, and Digital Signature

pp 399-431

19 - Multiparty Secure Computation

pp 432-461

Appendix - Solutions to Selected Problems

pp 462-472

References

pp 473-494

Symbol Index

pp 495-495

Index

pp 496-504