Muutke küpsiste eelistusi

Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich 1st ed. 2017 [Kõva köide]

2.67/5 (6 hinnangut Goodreads-ist)
Edited by
  • Formaat: Hardback, 450 pages, kõrgus x laius: 235x155 mm, kaal: 8218 g, 5 Illustrations, color; 21 Illustrations, black and white; XV, 450 p. 26 illus., 5 illus. in color., 1 Hardback
  • Sari: Information Security and Cryptography
  • Ilmumisaeg: 13-Apr-2017
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319570471
  • ISBN-13: 9783319570471
Teised raamatud teemal:
  • Kõva köide
  • Hind: 85,76 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 100,89 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Tutorials on the Foundations of Cryptography: Dedicated to Oded Goldreich 1st ed. 2017Suurem pilt
  • Formaat: Hardback, 450 pages, kõrgus x laius: 235x155 mm, kaal: 8218 g, 5 Illustrations, color; 21 Illustrations, black and white; XV, 450 p. 26 illus., 5 illus. in color., 1 Hardback
  • Sari: Information Security and Cryptography
  • Ilmumisaeg: 13-Apr-2017
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319570471
  • ISBN-13: 9783319570471
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783319570471.html
Märksõnad:

This is a graduate textbook of advanced tutorials on the theory of cryptography and computational complexity. In particular, the chapters explain aspects of garbled circuits, public-key cryptography, pseudorandom functions, one-way functions, homomorphic encryption, the simulation proof technique, and the complexity of differential privacy. Most chapters progress methodically through motivations, foundations, definitions, major results, issues surrounding feasibility, surveys of recent developments, and suggestions for further study.

This book honors Professor Oded Goldreich, a pioneering scientist, educator, and mentor. Oded was instrumental in laying down the foundations of cryptography, and he inspired the contributing authors, Benny Applebaum, Boaz Barak, Andrej Bogdanov, Iftach Haitner, Shai Halevi, Yehuda Lindell, Alon Rosen, and Salil Vadhan, themselves leading researchers on the theory of cryptography and computational complexity. The book is appropriate for graduate tutorials and seminars, and for self-study by experienced researchers, assuming prior knowledge of the theory of cryptography.

1 Garbled Circuits as Randomized Encodings of Functions: a Primer
1(44)
Benny Applebaum
1.1 Introduction
1(3)
1.2 Definitions and Basic Properties
4(6)
1.3 Feasibility Results
10(9)
1.4 Advanced Constructions
19(12)
1.5 Applications
31(4)
1.6 Summary and Suggestions for Further Reading
35(2)
1.7 Appendix: Randomized Encodings Versus Garbling Schemes [ 26]
37(8)
References
38(7)
2 The Complexity of Public-Key Cryptography
45(34)
Boaz Barak
2.1 Introduction
45(4)
2.2 Private-Key Cryptography
49(6)
2.3 Public-Key Cryptography: an Overview
55(1)
2.4 The Two "Mainstream" Public-Key Constructions
56(5)
2.5 Alternative Public-Key Constructions
61(6)
2.6 Is Computational Hardness the Rule or the Exception?
67(12)
References
69(10)
3 Pseudorandom Functions: Three Decades Later
79(80)
Andrej Bogdanov
Alon Rosen
3.1 Introduction
80(7)
3.2 Definitions
87(5)
3.3 Generic Constructions
92(7)
3.4 Instantiations
99(11)
3.5 Transformations
110(10)
3.6 Complexity of Pseudorandom Functions
120(6)
3.7 Distinguishers
126(13)
3.8 Contemporary Constructions
139(20)
References
149(10)
4 The Many Entropies in One-Way Functions
159(60)
Iftach Haitner
Salil Vadhan
4.1 Introduction
160(7)
4.2 Preliminaries
167(6)
4.3 Next-Block Entropy and Pseudorandom Generators
173(15)
4.4 Inaccessible Entropy and Statistically Hiding Commitment
188(31)
References
215(4)
5 Homomorphic Encryption
219(58)
Shai Halevi
5.1 Computing on Encrypted Data
219(7)
5.2 Defining Homomorphic Encryption
226(13)
5.3 Realizing Leveled Homomorphic Encryption
239(9)
5.4 Realizing Fully Homomorphic Encryption
248(11)
5.5 Advanced Topics
259(8)
5.6 Suggested Reading
267(10)
References
268(9)
6 How to Simulate It -- A Tutorial on the Simulation Proof Technique
277(70)
Yehuda Lindell
6.1 Introduction
277(2)
6.2 Preliminaries and Notation
279(1)
6.3 The Basic Paradigm - Semantic Security
280(2)
6.4 Secure Computation - Simulation for Semi-honest Adversaries
282(9)
6.5 Simulating the View of Malicious Adversaries -- Zero Knowledge
291(19)
6.6 Denning Security for Malicious Adversaries
310(6)
6.7 Determining Output -- Coin Tossing
316(13)
6.8 Extracting Inputs -- Oblivious Transfer
329(9)
6.9 The Common Reference String Model -- Oblivious Transfer
338(2)
6.10 Advanced Topics
340(7)
References
343(4)
7 The Complexity of Differential Privacy
347(102)
Salil Vadhan
7.1 Introduction and Definition
348(12)
7.2 Composition Theorems for Differential Privacy
360(7)
7.3 Alternatives to Global Sensitivity
367(6)
7.4 Releasing Many Counting Queries with Correlated Noise
373(8)
7.5 Information-Theoretic Lower Bounds
381(19)
7.6 Computational Lower Bounds
400(9)
7.7 Efficient Algorithms for Specific Query Families
409(8)
7.8 Private PAC Learning
417(8)
7.9 Multiparty Differential Privacy
425(6)
7.10 Computational Differential Privacy
431(4)
7.11 Conclusions
435(14)
References
438(11)
Nomenclature 449
Yehuda Lindell is a professor in the Dept. of Computer Science of Bar-Ilan University; his main research interests are in the field of cryptography, focusing on secure protocols, and questions of feasibility and efficiency. Benny Applebaum is a professor at the School of Electrical Engineering at Tel-Aviv University; his main interests are the foundations of cryptography and computational complexity. Boaz Barak is the Gordon McKay Professor of Computer Science at Harvard University; his research interests include all areas of theoretical computer science and in particular cryptography and computational complexity. Andrej Bogdanov is an associate professor in the Dept. of Computer Science and Engineering and an associate director of the Institute for Theoretical Computer Science and Communications at The Chinese University of Hong Kong; his research interests are computational complexity and the foundations of cryptography. Iftach Haitner is a faculty member in the School of ComputerScience at Tel-Aviv University; his main interests are cryptography and computational complexity. Shai Halevi is a Principal Research Staff Member at the IBM T.J. Watson Research Center, with research interests in cryptography. Alon Rosen is a professor in the School of Computer Science at the Herzliya Interdisciplinary Center (IDC); his main interests are cryptography and computational complexity. Salil Vadhan is the Vicky Joseph Professor of Computer Science and Applied Mathematics at Harvard University; his research areas include computational complexity, cryptography, randomness in computation, and data privacy.