Foundations of cryptography : (Record no. 522797)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 08379nam a22003498i 4500 |
| 001 - CONTROL NUMBER | |
| control field | CR9780511546891 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UkCbUP |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200124160333.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS--GENERAL INFORMATION | |
| fixed length control field | m|||||o||d|||||||| |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr|||||||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 090508s2003||||enk o ||1 0|eng|d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780511546891 (ebook) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9780521791724 (hardback) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9780521035361 (paperback) |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | UkCbUP |
| Language of cataloging | eng |
| Description conventions | rda |
| Transcribing agency | UkCbUP |
| 050 00 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA268 |
| Item number | .G5745 2003 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 652/.8 |
| Edition number | 21 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Goldreich, Oded, |
| Relator term | author. |
| 245 10 - TITLE STATEMENT | |
| Title | Foundations of cryptography : |
| Remainder of title | basic tools / |
| Statement of responsibility, etc | Oded Goldreich. |
| 264 #1 - Production, Publication, Distribution, Manufacture, and Copyright Notice (R) | |
| Place of production, publication, distribution, manufacture (R) | Cambridge : |
| Name of producer, publisher, distributor, manufacturer (R) | Cambridge University Press, |
| Date of production, publication, distribution, manufacture, or copyright notice | 2003. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (xix, 372 pages) : |
| Other physical details | digital, PDF file(s). |
| 336 ## - Content Type (R) | |
| Content type term (R) | text |
| Content type code (R) | txt |
| Source (NR) | rdacontent |
| 337 ## - Media Type (R) | |
| Media type term (R) | computer |
| Media type code (R) | c |
| Source (NR) | rdamedia |
| 338 ## - Carrier Type (R) | |
| Carrier type term (R) | online resource |
| Carrier type code (R) | cr |
| Source (NR) | rdacarrier |
| 500 ## - GENERAL NOTE | |
| General note | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| 505 00 - FORMATTED CONTENTS NOTE | |
| Miscellaneous information | 1.1.1. |
| Title | Encryption Schemes |
| Miscellaneous information | 2 -- |
| -- | 1.1.2. |
| Title | Pseudorandom Generators |
| Miscellaneous information | 3 -- |
| -- | 1.1.3. |
| Title | Digital Signatures |
| Miscellaneous information | 4 -- |
| -- | 1.1.4. |
| Title | Fault-Tolerant Protocols and Zero-Knowledge Proofs |
| Miscellaneous information | 6 -- |
| -- | 1.2. |
| Title | Some Background from Probability Theory |
| Miscellaneous information | 8 -- |
| -- | 1.2.1. |
| Title | Notational Conventions |
| Miscellaneous information | 8 -- |
| -- | 1.2.2. |
| Title | Three Inequalities |
| Miscellaneous information | 9 -- |
| -- | 1.3. |
| Title | Computational Model |
| Miscellaneous information | 12 -- |
| -- | 1.3.1. |
| Title | P, NP, and NP-Completeness |
| Miscellaneous information | 12 -- |
| -- | 1.3.2. |
| Title | Probabilistic Polynomial Time |
| Miscellaneous information | 13 -- |
| -- | 1.3.3. |
| Title | Non-Uniform Polynomial Time |
| Miscellaneous information | 16 -- |
| -- | 1.3.4. |
| Title | Intractability Assumptions |
| Miscellaneous information | 19 -- |
| -- | 1.3.5. |
| Title | Oracle Machines |
| Miscellaneous information | 20 -- |
| -- | 1.4. |
| Title | Motivation to the Rigorous Treatment |
| Miscellaneous information | 21 -- |
| -- | 1.4.1. |
| Title | Need for a Rigorous Treatment |
| Miscellaneous information | 21 -- |
| -- | 1.4.2. |
| Title | Practical Consequences of the Rigorous Treatment |
| Miscellaneous information | 23 -- |
| -- | 1.4.3. |
| Title | Tendency to Be Conservative |
| Miscellaneous information | 24 -- |
| -- | 1.5.1. |
| Title | Historical Notes |
| Miscellaneous information | 25 -- |
| -- | 1.5.3. |
| Title | Open Problems |
| Miscellaneous information | 27 -- |
| -- | 2 |
| Title | Computational Difficulty |
| Miscellaneous information | 30 -- |
| -- | 2.1. |
| Title | One-Way Functions: Motivation |
| Miscellaneous information | 31 -- |
| -- | 2.2. |
| Title | One-Way Functions: Definitions |
| Miscellaneous information | 32 -- |
| -- | 2.2.1. |
| Title | Strong One-Way Functions |
| Miscellaneous information | 32 -- |
| -- | 2.2.2. |
| Title | Weak One-Way Functions |
| Miscellaneous information | 35 -- |
| -- | 2.2.3. |
| Title | Two Useful Length Conventions |
| Miscellaneous information | 35 -- |
| -- | 2.2.4. |
| Title | Candidates for One-Way Functions |
| Miscellaneous information | 40 -- |
| -- | 2.2.5. |
| Title | Non-Uniformly One-Way Functions |
| Miscellaneous information | 41 -- |
| -- | 2.3. |
| Title | Weak One-Way Functions Imply Strong Ones |
| Miscellaneous information | 43 -- |
| -- | 2.3.1. |
| Title | Construction and Its Analysis (Proof of Theorem 2.3.2) |
| Miscellaneous information | 44 -- |
| -- | 2.3.2. |
| Title | Illustration by a Toy Example |
| Miscellaneous information | 48 -- |
| -- | 2.4. |
| Title | One-Way Functions: Variations |
| Miscellaneous information | 51 -- |
| -- | 2.4.1. |
| Title | Universal One-Way Function |
| Miscellaneous information | 52 -- |
| -- | 2.4.2. |
| Title | One-Way Functions as Collections |
| Miscellaneous information | 53 -- |
| -- | 2.4.3. |
| Title | Examples of One-Way Collections |
| Miscellaneous information | 55 -- |
| -- | 2.4.4. |
| Title | Trapdoor One-Way Permutations |
| Miscellaneous information | 58 -- |
| -- | 2.4.5. |
| Title | Claw-Free Functions |
| Miscellaneous information | 60 -- |
| -- | 2.4.6. |
| Title | On Proposing Candidates |
| Miscellaneous information | 63 -- |
| -- | 2.5. |
| Title | Hard-Core Predicates |
| Miscellaneous information | 64 -- |
| -- | 2.5.2. |
| Title | Hard-Core Predicates for Any One-Way Function |
| Miscellaneous information | 65 -- |
| -- | 2.5.3. |
| Title | Hard-Core Functions |
| Miscellaneous information | 74 -- |
| -- | 2.6. |
| Title | Efficient Amplification of One-Way Functions |
| Miscellaneous information | 78 -- |
| -- | 2.6.1. |
| Title | Construction |
| Miscellaneous information | 80 -- |
| -- | 2.6.2. |
| Title | Analysis |
| Miscellaneous information | 81 -- |
| -- | 2.7.1. |
| Title | Historical Notes |
| Miscellaneous information | 89 -- |
| -- | 3 |
| Title | Pseudorandom Generators |
| Miscellaneous information | 101 -- |
| -- | 3.1. |
| Title | Motivating Discussion |
| Miscellaneous information | 102 -- |
| -- | 3.1.1. |
| Title | Computational Approaches to Randomness |
| Miscellaneous information | 102 -- |
| -- | 3.1.2. |
| Title | A Rigorous Approach to Pseudorandom Generators |
| Miscellaneous information | 103 -- |
| -- | 3.2. |
| Title | Computational Indistinguishability |
| Miscellaneous information | 103 -- |
| -- | 3.2.2. |
| Title | Relation to Statistical Closeness |
| Miscellaneous information | 106 -- |
| -- | 3.2.3. |
| Title | Indistinguishability by Repeated Experiments |
| Miscellaneous information | 107 -- |
| -- | 3.2.4. |
| Title | Indistinguishability by Circuits |
| Miscellaneous information | 111 -- |
| -- | 3.2.5. |
| Title | Pseudorandom Ensembles |
| Miscellaneous information | 112 -- |
| -- | 3.3. |
| Title | Definitions of Pseudorandom Generators |
| Miscellaneous information | 112 -- |
| -- | 3.3.1. |
| Title | Standard Definition of Pseudorandom Generators |
| Miscellaneous information | 113 -- |
| -- | 3.3.2. |
| Title | Increasing the Expansion Factor |
| Miscellaneous information | 114 -- |
| -- | 3.3.3. |
| Title | Variable-Output Pseudorandom Generators |
| Miscellaneous information | 118 -- |
| -- | 3.3.4. |
| Title | Applicability of Pseudorandom Generators |
| Miscellaneous information | 119 -- |
| -- | 3.3.5. |
| Title | Pseudorandomness and Unpredictability |
| Miscellaneous information | 119 -- |
| -- | 3.3.6. |
| Title | Pseudorandom Generators Imply One-Way Functions |
| Miscellaneous information | 123 -- |
| -- | 3.4. |
| Title | Constructions Based on One-Way Permutations |
| Miscellaneous information | 124 -- |
| -- | 3.4.1. |
| Title | Construction Based on a Single Permutation |
| Miscellaneous information | 124 -- |
| -- | 3.4.2. |
| Title | Construction Based on Collections of Permutations |
| Miscellaneous information | 131 -- |
| -- | 3.4.3. |
| Title | Using Hard-Core Functions Rather than Predicates |
| Miscellaneous information | 134 -- |
| -- | 3.5. |
| Title | Constructions Based on One-Way Functions |
| Miscellaneous information | 135 -- |
| -- | 3.5.1. |
| Title | Using 1-1 One-Way Functions |
| Miscellaneous information | 135 -- |
| -- | 3.5.2. |
| Title | Using Regular One-Way Functions |
| Miscellaneous information | 141 -- |
| -- | 3.5.3. |
| Title | Going Beyond Regular One-Way Functions |
| Miscellaneous information | 147 -- |
| -- | 3.6. |
| Title | Pseudorandom Functions |
| Miscellaneous information | 148 -- |
| -- | 3.6.3. |
| Title | Applications: A General Methodology |
| Miscellaneous information | 157 -- |
| -- | 3.7. |
| Title | Pseudorandom Permutations |
| Miscellaneous information | 164 -- |
| -- | 3.8.1. |
| Title | Historical Notes |
| Miscellaneous information | 169 -- |
| -- | 4 |
| Title | Zero-Knowledge Proof Systems |
| Miscellaneous information | 184 -- |
| -- | 4.1. |
| Title | Zero-Knowledge Proofs: Motivation |
| Miscellaneous information | 185 -- |
| -- | 4.1.1. |
| Title | Notion of a Proof |
| Miscellaneous information | 187 -- |
| -- | 4.1.2. |
| Title | Gaining Knowledge |
| Miscellaneous information | 189 -- |
| -- | 4.2. |
| Title | Interactive Proof Systems |
| Miscellaneous information | 190 -- |
| -- | 4.2.2. |
| Title | An Example (Graph Non-Isomorphism in IP) |
| Miscellaneous information | 195 -- |
| -- | 4.2.3. |
| Title | Structure of the Class IP |
| Miscellaneous information | 198 -- |
| -- | 4.2.4. |
| Title | Augmentation of the Model |
| Miscellaneous information | 199 -- |
| -- | 4.3. |
| Title | Zero-Knowledge Proofs: Definitions |
| Miscellaneous information | 200 -- |
| -- | 4.3.1. |
| Title | Perfect and Computational Zero-Knowledge |
| Miscellaneous information | 200 -- |
| -- | 4.3.2. |
| Title | An Example (Graph Isomorphism in PZK) |
| Miscellaneous information | 207 -- |
| -- | 4.3.3. |
| Title | Zero-Knowledge with Respect to Auxiliary Inputs |
| Miscellaneous information | 213 -- |
| -- | 4.3.4. |
| Title | Sequential Composition ofh Zero-Knowledge Proofs |
| Miscellaneous information | 216 -- |
| -- | 4.4. |
| Title | Zero-Knowledge Proofs for NP |
| Miscellaneous information | 223 -- |
| -- | 4.4.1. |
| Title | Commitment Schemes |
| Miscellaneous information | 223 -- |
| -- | 4.4.2. |
| Title | Zero-Knowledge Proof of Graph Coloring |
| Miscellaneous information | 228 -- |
| -- | 4.4.3. |
| Title | General Result and Some Applications |
| Miscellaneous information | 240 -- |
| -- | 4.4.4. |
| Title | Second-Level Considerations |
| Miscellaneous information | 243 -- |
| -- | 4.5. |
| Title | Negative Results |
| Miscellaneous information | 246 -- |
| -- | 4.5.1. |
| Title | On the Importance of Interaction and Randomness |
| Miscellaneous information | 247 -- |
| -- | 4.5.2. |
| Title | Limitations of Unconditional Results |
| Miscellaneous information | 248 -- |
| -- | 4.5.3. |
| Title | Limitations of Statistical ZK Proofs |
| Miscellaneous information | 250 -- |
| -- | 4.5.4. |
| Title | Zero-Knowledge and Parallel Composition |
| Miscellaneous information | 251 -- |
| -- | 4.6. |
| Title | Witness Indistinguishability and Hiding |
| Miscellaneous information | 254 -- |
| -- | 4.6.2. |
| Title | Parallel Composition |
| Miscellaneous information | 258 -- |
| -- | 4.7. |
| Title | Proofs of Knowledge |
| Miscellaneous information | 262 -- |
| -- | 4.7.2. |
| Title | Reducing the Knowledge Error |
| Miscellaneous information | 267 -- |
| -- | 4.7.3. |
| Title | Zero-Knowledge Proofs of Knowledge for NP |
| Miscellaneous information | 268 -- |
| -- | 4.7.5. |
| Title | Proofs of Identity (Identification Schemes) |
| Miscellaneous information | 270 -- |
| -- | 4.7.6. |
| Title | Strong Proofs of Knowledge |
| Miscellaneous information | 274 -- |
| -- | 4.8. |
| Title | Computationally Sound Proofs (Arguments) |
| Miscellaneous information | 277 -- |
| -- | 4.8.2. |
| Title | Perfectly Hiding Commitment Schemes |
| Miscellaneous information | 278 -- |
| -- | 4.8.3. |
| Title | Perfect Zero-Knowledge Arguments for NP |
| Miscellaneous information | 284 -- |
| -- | 4.8.4. |
| Title | Arguments of Poly-Logarithmic Efficiency |
| Miscellaneous information | 286 -- |
| -- | 4.9. |
| Title | Constant-Round Zero-Knowledge Proofs |
| Miscellaneous information | 288 -- |
| -- | 4.9.1. |
| Title | Using Commitment Schemes with Perfect Secrecy |
| Miscellaneous information | 289 -- |
| -- | 4.9.2. |
| Title | Bounding the Power of Cheating Provers |
| Miscellaneous information | 294 -- |
| -- | 4.10. |
| Title | Non-Interactive Zero-Knowledge Proofs |
| Miscellaneous information | 298 -- |
| -- | 4.10.3. |
| Title | Extensions |
| Miscellaneous information | 306 -- |
| -- | 4.11. |
| Title | Multi-Prover Zero-Knowledge Proofs |
| Miscellaneous information | 311 -- |
| -- | 4.11.2. |
| Title | Two-Sender Commitment Schemes |
| Miscellaneous information | 313 -- |
| -- | 4.11.3. |
| Title | Perfect Zero-Knowledge for NP |
| Miscellaneous information | 317 -- |
| -- | 4.12.1. |
| Title | Historical Notes |
| Miscellaneous information | 320 -- |
| -- | Appendix |
| Title | A Background in Computational Number Theory |
| Miscellaneous information | 331 -- |
| -- | A.1. |
| Title | Prime Numbers |
| Miscellaneous information | 331 -- |
| -- | A.1.1. |
| Title | Quadratic Residues Modulo a Prime |
| Miscellaneous information | 331 -- |
| -- | A.1.2. |
| Title | Extracting Square Roots Modulo a Prime |
| Miscellaneous information | 332 -- |
| -- | A.1.3. |
| Title | Primality Testers |
| Miscellaneous information | 332 -- |
| -- | A.1.4. |
| Title | On Uniform Selection of Primes |
| Miscellaneous information | 333 -- |
| -- | A.2. |
| Title | Composite Numbers |
| Miscellaneous information | 334 -- |
| -- | A.2.1. |
| Title | Quadratic Residues Modulo a Composite |
| Miscellaneous information | 335 -- |
| -- | A.2.2. |
| Title | Extracting Square Roots Modulo a Composite |
| Miscellaneous information | 335 -- |
| -- | A.2.3. |
| Title | Legendre and Jacobi Symbols |
| Miscellaneous information | 336 -- |
| -- | A.2.4. |
| Title | Blum Integers and Their Quadratic-Residue Structure |
| Miscellaneous information | 337 -- |
| -- | Appendix B |
| Title | Brief Outline of Volume |
| Miscellaneous information | 338 -- |
| -- | B.1. |
| Title | Encryption: Brief Summary |
| Miscellaneous information | 338 -- |
| -- | B.1.3. |
| Title | Beyond Eavesdropping Security |
| Miscellaneous information | 343 -- |
| -- | B.2. |
| Title | Signatures: Brief Summary |
| Miscellaneous information | 345 -- |
| -- | B.3. |
| Title | Cryptographic Protocols: Brief Summary |
| Miscellaneous information | 350. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Coding theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Cryptography |
| General subdivision | Mathematics. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| International Standard Book Number | 9780521791724 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://doi.org/10.1017/CBO9780511546891">https://doi.org/10.1017/CBO9780511546891</a> |
No items available.