Cryptography is concerned with the conceptualization, definition, and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Building on the basic tools presented in the first volume, this second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful. Also available: Volume I: Basic Tools 0-521-79172-3 Hardback $75.00 C

lgli/Z:\Bibliotik_\15\2\2004 Oded Goldreich - Foundations of Cryptography - VOL2_Basic Applications_Rebfl.pdf

lgrsnf/Z:\Bibliotik_\15\2\2004 Oded Goldreich - Foundations of Cryptography - VOL2_Basic Applications_Rebfl.pdf

nexusstc/Foundations of cryptography. 2, Basic applications/c0fd5bfe6d0a8fa375777bf9b4e81550.pdf

zlib/Computers/Programming/Goldreich, Oded/Foundations of cryptography. 2, Basic applications_5909519.pdf

Foundations of Cryptography Volume II Basic Applications

Foundations of Cryptography: Basic Application, II

Foundations of cryptography : basic tools

Foundations of cryptology

Oded Goldreich. Vol. 2, Basic applications

Oded Goldreich; ProQuest

FOUNDATIONS OF CRYPTOGRAPHY; V. 2, NEW YORK, Unknown, 2004-01-01

Cambridge University Press, Cambridge, 2001

United Kingdom and Ireland, United Kingdom

Cambridge, England, 2004

Cambridge, UK, ©2003

New York, Sept. 2009

May 10, 2004

1, PS, 2004

1, 2009

lg2628245

producers:
Acrobat Distiller 6.0 (Windows)

{"isbns":["052111991X","0521830842","9780521119917","9780521830843"],"publisher":"Cambridge University Press"}

Cover 1
Title 5
Copyright 6
Dedication 7
Contents II Basic Applications 9
List of Figures 13
Preface 15
Acknowledgments 23
5 Encryption Schemes 25
5.1. The Basic Setting 26
5.1.1. Private-Key Versus Public-Key Schemes 27
5.1.2. The Syntax of Encryption Schemes 28
5.2. Definitions of Security 30
5.2.1. Semantic Security 31
5.2.2. Indistinguishability of Encryptions 34
5.2.3. Equivalence of the Security Definitions 35
5.2.4. Multiple Messages 41
5.2.5.* A Uniform-Complexity Treatment 46
5.3. Constructions of Secure Encryption Schemes 55
5.3.1.* Stream-Ciphers 56
5.3.2. Preliminaries: Block-Ciphers 60
5.3.3. Private-Key Encryption Schemes 62
5.3.4. Public-Key Encryption Schemes 65
5.4.* Beyond Eavesdropping Security 74
5.4.1. Overview 74
5.4.2. Key-Dependent Passive Attacks 77
5.4.3. Chosen Plaintext Attack 83
5.4.4. Chosen Ciphertext Attack 90
5.4.5. Non-Malleable Encryption Schemes 122
5.5. Miscellaneous 126
5.5.1. On Using Encryption Schemes 126
5.5.2. On Information-Theoretic Security 128
5.5.3. On Some Popular Schemes 129
5.5.4. Historical Notes 130
5.5.5. Suggestions for Further Reading 132
5.5.6. Open Problems 133
5.5.7. Exercises 133
6 Digital Signatures and Message Authentication 149
6.1. The Setting and Definitional Issues 150
6.1.1. The Two Types of Schemes: A Brief Overview 150
6.1.2. Introduction to the Unified Treatment 151
6.1.3. Basic Mechanism 153
6.1.4. Attacks and Security 154
6.1.5.* Variants 157
6.2. Length-Restricted Signature Scheme 159
6.2.1. Definition 159
6.2.2. The Power of Length-Restricted Signature Schemes 160
6.2.3.* Constructing Collision-Free Hashing Functions 168
6.3. Constructions of Message-Authentication Schemes 175
6.3.1. Applying a Pseudorandom Function to the Document 175
6.3.2.* More on Hash-and-Hide and State-Based MACs 183
6.4. Constructions of Signature Schemes 189
6.4.1. One-Time Signature Schemes 190
6.4.2. From One-Time Signature Schemes to General Ones 195
6.4.3.* Universal One-Way Hash Functions and Using Them 212
6.5.* Some Additional Properties 227
6.5.1. Unique Signatures 227
6.5.2. Super-Secure Signature Schemes 228
6.5.3. Off-Line/On-Line Signing 232
6.5.4. Incremental Signatures 233
6.5.5. Fail-Stop Signatures 235
6.6. Miscellaneous 236
6.6.1. On Using Signature Schemes 236
6.6.2. On Information-Theoretic Security 237
6.6.3. On Some Popular Schemes 238
6.6.4. Historical Notes 239
6.6.5. Suggestions for Further Reading 241
6.6.6. Open Problems 242
6.6.7. Exercises 242
7 General Cryptographic Protocols 251
7.1. Overview 252
7.1.1. The Definitional Approach and Some Models 253
7.1.2. Some Known Results 259
7.1.3. Construction Paradigms 261
7.2.* The Two-Party Case: Definitions 267
7.2.1. The Syntactic Framework 267
7.2.2. The Semi-Honest Model 271
7.2.3. The Malicious Model 278
7.3.* Privately Computing (Two-Party) Functionalities 286
7.3.1. Privacy Reductions and a Composition Theorem 288
7.3.2. The OTk 1 Protocol: Definition and Construction 292
7.3.3. Privately Computing c1 + c2 = (a1 + a2) · (b1 + b2) 295
7.3.4. The Circuit Evaluation Protocol 297
7.4.* Forcing (Two-Party) Semi-Honest Behavior 302
7.4.1. The Protocol Compiler: Motivation and Overview 302
7.4.2. Security Reductions and a Composition Theorem 304
7.4.3. The Compiler: Functionalities in Use 309
7.4.4. The Compiler Itself 333
7.5.* Extension to the Multi-Party Case 345
7.5.1. Definitions 346
7.5.2. Security in the Semi-Honest Model 353
7.5.3. The Malicious Models: Overview and Preliminaries 360
7.5.4. The First Compiler: Forcing Semi-Honest Behavior 366
7.5.5. The Second Compiler: Effectively Preventing Abort 381
7.6.* Perfect Security in the Private Channel Model 393
7.6.1. Definitions 394
7.6.2. Security in the Semi-Honest Model 395
7.6.3. Security in the Malicious Model 398
7.7. Miscellaneous 399
7.7.1.* Three Deferred Issues 399
7.7.2.* Concurrent Executions 404
7.7.3. Concluding Remarks 407
7.7.4. Historical Notes 408
7.7.5. Suggestions for Further Reading 409
7.7.6. Open Problems 410
7.7.7. Exercises 411
Appendix C: Corrections and Additions to Volume 1 417
C.1. Enhanced Trapdoor Permutations 417
C.2. On Variants of Pseudorandom Functions 420
C.3. On Strong Witness Indistinguishability 420
C.3.1. On Parallel Composition 421
C.3.2. On Theorem 4.6.8 and an Afterthought 422
C.3.3. Consequences 423
C.4. On Non-Interactive Zero-Knowledge 424
C.4.1. On NIZKs with Efficient Prover Strategies 424
C.4.2. On Unbounded NIZKs 425
C.4.3. On Adaptive NIZKs 426
C.5. Some Developments Regarding Zero-Knowledge 427
C.5.1. Composing Zero-Knowledge Protocols 427
C.5.2. Using the Adversary’s Program in the Proof of Security 432
C.6. Additional Corrections and Comments 435
C.7. Additional Mottoes 436
Bibliography 437
Index 447

Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Foundations of Cryptography presents a rigorous and systematic treatment of foundational issues, defining cryptographic tasks and solving cryptographic problems. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving several central cryptographic problems, as opposed to describing ad-hoc approaches. This second volume contains a thorough treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It builds on the previous volume, which provided a treatment of one-way functions, pseudorandomness, and zero-knowledge proofs. It is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful.

Cryptography is concerned with the conceptualization, definition, and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. This book presents a rigorous and systematic treatment of the foundational issues: defining cryptographic tasks and solving new cryptographic problems using existing tools. It focuses on the basic mathematical tools: computational difficulty (one-way functions), pseudorandomness, and zero-knowledge proofs. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving cryptographic problems rather than on describing ad hoc approaches. The book is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful

Annotation Cryptography is concerned with the conceptualization, definition, and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Building on the basic tools presented in the first volume, this second volume of Foundations of Cryptography contains a rigorous and systematic treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful. Also available: Volume I: Basic Tools 0-521-79172-3 Hardback $75.00 C

"The book is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful."--Jacket

Up to the 1970s, Cryptography was understood as the art of building encryption schemes, that is, the art of constructing schemes allowing secret data exchange over insecure channels.

2020-07-26