| 000 -LEADER |
|---|
| fixed length control field |
19134cam a22003975i 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250923161701.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
t| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
|
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780136643609 |
| Qualifying information |
cloth |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| Cancelled/invalid ISBN |
9780136643524 |
| Qualifying information |
epub |
| 041 ## - LANGUAGE CODE |
|---|
| Language code of text/sound track or separate title |
eng |
| 042 ## - AUTHENTICATION CODE |
|---|
| Authentication code |
pcc |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Edition number |
23 |
| Classification number |
005.8 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Preferred name for the person |
Kaufman, Charlie |
| Relator term |
author |
| Relator code |
aut |
| -- |
http://id.loc.gov/vocabulary/relators/aut |
| Authority record control number |
http://id.loc.gov/authorities/names/no95026726 |
| Real World Object URI (R) |
http://id.loc.gov/rwo/agents/no95026726 |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Network security: private communications in a public world / |
| Statement of responsibility, etc |
Charlie Kaufman, Radia Perlman, Mike Speciner, Ray Perlner. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Third edition. |
| 264 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Place of publication, distribution, etc |
Boston : |
| Name of publisher, distributor, etc |
Pearson Education, Inc, |
| Date of publication, distribution, etc |
2023. |
| 264 #4 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Date of publication, distribution, etc |
©2023 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
1 volume (various paging) |
| Other physical details |
illustrations |
| Dimensions |
24 cm. |
| 336 ## - CONTENT TYPE |
|---|
| Content type term |
text |
| Content type code |
txt |
| Source |
rdacontent |
| 337 ## - MEDIA TYPE |
|---|
| Media type term |
unmediated |
| Media type code |
n |
| Source |
rdamedia |
| 338 ## - CARRIER TYPE |
|---|
| Carrier type term |
volume |
| Carrier type code |
nc |
| Source |
rdacarrier |
| 340 ## - PHYSICAL MEDIUM |
|---|
| Authority record control number or standard number |
http://id.loc.gov/vocabulary/millus/ill |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 505 0# - CONTENTS |
|---|
| Formatted contents note |
CHAPTER 1 Introduction<br/>1.1 Opinions, Products<br/>1.2 Roadmap to the Book<br/>1.3 Terminology<br/>1.4 Notation<br/>1.5 Cryptographically Protected Sessions<br/>1.6 Active and Passive Attacks<br/>1.7 Legal Issues<br/>1.7.1 Patents<br/>1.7.2 Government Regulations<br/>1.8 Some Network Basics<br/>1.8.1 Network Layers<br/>1.8.2 TCP and UDP Ports<br/>1.8.3 DNS (Domain Name System)<br/>1.8.4 HTTP and URLs<br/>1.8.5 Web Cookies<br/>1.9 Names for Humans<br/>1.10 Authentication and Authorization<br/>1.10.1 ACL (Access Control List)<br/>1.10.2 Central Administration/Capabilities<br/>1.10.3 Groups<br/>1.10.4 Cross-Organizational and Nested Groups<br/>1.10.5 Roles<br/>1.11 Malware: Viruses, Worms, Trojan Horses<br/>1.11.1 Where Does Malware Come From?<br/>1.11.2 Virus Checkers<br/>1.12 Security Gateway<br/>1.12.1 Firewall<br/>1.12.2 Application-Level Gateway/Proxy<br/>1.12.3 Secure Tunnels<br/>1.12.4 Why Firewalls Don’t Work<br/>1.13 Denial-of-Service (DoS) Attacks<br/>1.14 NAT (Network Address Translation)<br/>1.14.1 Summary<br/>CHAPTER 2 Introduction to Cryptography<br/>2.1 Introduction<br/>2.1.1 The Fundamental Tenet of Cryptography<br/>2.1.2 Keys<br/>2.1.3 Computational Difficulty<br/>2.1.4 To Publish or Not to Publish<br/>2.1.5 Earliest Encryption<br/>2.1.6 One-Time Pad (OTP)<br/>2.2 Secret Key Cryptography<br/>2.2.1 Transmitting Over an Insecure Channel<br/>2.2.2 Secure Storage on Insecure Media<br/>2.2.3 Authentication<br/>2.2.4 Integrity Check<br/>2.3 Public Key Cryptography<br/>2.3.1 Transmitting Over an Insecure Channel<br/>2.3.2 Secure Storage on Insecure Media<br/>2.3.3 Authentication<br/>2.3.4 Digital Signatures<br/>2.4 Hash Algorithms<br/>2.4.1 Password Hashing<br/>2.4.2 Message Integrity<br/>2.4.3 Message Fingerprint<br/>2.4.4 Efficient Digital Signatures<br/>2.5 Breaking an Encryption Scheme<br/>2.5.1 Ciphertext Only<br/>2.5.2 Known Plaintext<br/>2.5.3 Chosen Plaintext<br/>2.5.4 Chosen Ciphertext<br/>2.5.5 Side-Channel Attacks<br/>2.6 Random Numbers<br/>2.6.1 Gathering Entropy<br/>2.6.2 Generating Random Seeds<br/>2.6.3 Calculating a Pseudorandom Stream from the Seed<br/>2.6.4 Periodic Reseeding<br/>2.6.5 Types of Random Numbers<br/>2.6.6 Noteworthy Mistakes<br/>2.7 Numbers<br/>2.7.1 Finite Fields<br/>2.7.2 Exponentiation<br/>2.7.3 Avoiding a Side-Channel Attack<br/>2.7.4 Types of Elements used in Cryptography<br/>2.7.5 Euclidean Algorithm<br/>2.7.6 Chinese Remainder Theorem<br/>2.8 Homework<br/>CHAPTER 3 Secret Key Cryptography<br/>3.1 Introduction<br/>3.2 Generic Block Cipher Issues<br/>3.2.1 Blocksize, Keysize<br/>3.2.2 Completely General Mapping<br/>3.2.3 Looking Random<br/>3.3 Constructing a Practical Block Cipher<br/>3.3.1 Per-Round Keys<br/>3.3.2 S-boxes and Bit Shuffles<br/>3.3.3 Feistel Ciphers<br/>3.4 Choosing Constants<br/>3.5 Data Encryption Standard (DES)<br/>3.5.1 DES Overview<br/>3.5.2 The Mangler Function<br/>3.5.3 Undesirable Symmetries<br/>3.5.4 What’s So Special About DES?<br/>3.6 3DES (Multiple Encryption DES)<br/>3.6.1 How Many Encryptions?<br/>3.6.1.1 Encrypting Twice with the Same Key<br/>3.6.1.2 Encrypting Twice with Two Keys<br/>3.6.1.3 Triple Encryption with Only Two Keys<br/>3.6.2 Why EDE Rather Than EEE?<br/>3.7 Advanced Encryption Standard (AES)<br/>3.7.1 Origins of AES<br/>3.7.2 Broad Overview<br/>3.7.3 AES Overview<br/>3.7.4 Key Expansion<br/>3.7.5 Inverse Rounds<br/>3.7.6 Software Implementations of AES<br/>3.8 RC4<br/>3.9 Homework<br/>CHAPTER 4 Modes of Operation<br/>4.1 Introduction<br/>4.2 Encrypting a Large Message<br/>4.2.1 ECB (Electronic Code Book)<br/>4.2.2 CBC (Cipher Block Chaining)<br/>4.2.2.1 Randomized ECB<br/>4.2.2.2 CBC<br/>4.2.2.3 CBC Threat—Modifying Ciphertext Blocks<br/>4.2.3 CTR (Counter Mode)<br/>4.2.3.1 Choosing IVs for CTR Mode<br/>4.2.4 XEX (XOR Encrypt XOR)<br/>4.2.5 XTS (XEX with Ciphertext Stealing)<br/>4.3 Generating MACs<br/>4.3.1 CBC-MAC<br/>4.3.1.1 CBC Forgery Attack<br/>4.3.2 CMAC<br/>4.3.3 GMAC<br/>4.3.3.1 GHASH<br/>4.3.3.2 Transforming GHASH into GMAC<br/>4.4 Ensuring Privacy and Integrity Together<br/>4.4.1 CCM (Counter with CBC-MAC)<br/>4.4.2 GCM (Galois/Counter Mode)<br/>4.5 Performance Issues<br/>4.6 Homework<br/>CHAPTER 5 Cryptographic Hashes<br/>5.1 Introduction<br/>5.2 The Birthday Problem<br/>5.3 A Brief History of Hash Functions<br/>5.4 Nifty Things to Do with a Hash<br/>5.4.1 Digital Signatures<br/>5.4.2 Password Database<br/>5.4.3 Secure Shorthand of Larger Piece of Data<br/>5.4.4 Hash Chains<br/>5.4.5 Blockchain<br/>5.4.6 Puzzles<br/>5.4.7 Bit Commitment<br/>5.4.8 Hash Trees<br/>5.4.9 Authentication<br/>5.4.10 Computing a MAC with a Hash<br/>5.4.11 HMAC<br/>5.4.12 Encryption with a Secret and a Hash Algorithm<br/>5.5 Creating a Hash Using a Block Cipher<br/>5.6 Construction of Hash Functions<br/>5.6.1 Construction of MD4, MD5, SHA-1 and SHA-2<br/>5.6.2 Construction of SHA-3<br/>5.7 Padding<br/>5.7.1 MD4, MD5, SHA-1, and SHA2-256 Message Padding<br/>5.7.2 SHA-3 Padding Rule<br/>5.8 The Internal Encryption Algorithms<br/>5.8.1 SHA-1 Internal Encryption Algorithm<br/>5.8.2 SHA-2 Internal Encryption Algorithm<br/>5.9 SHA-3 fFunction (Also Known as KECCAK-f)<br/>5.10 Homework<br/>CHAPTER 6 First-Generation Public Key Algorithms<br/>6.1 Introduction<br/>6.2 Modular Arithmetic<br/>6.2.1 Modular Addition<br/>6.2.2 Modular Multiplication<br/>6.2.3 Modular Exponentiation<br/>6.2.4 Fermat’s Theorem and Euler’s Theorem<br/>6.3 RSA<br/>6.3.1 RSA Algorithm<br/>6.3.2 Why Does RSA Work?<br/>6.3.3 Why Is RSA Secure?<br/>6.3.4 How Efficient Are the RSA Operations?<br/>6.3.4.1 Exponentiating with Big Numbers<br/>6.3.4.2 Generating RSA Keys<br/>6.3.4.3 Why a Non-Prime Has Multiple Square Roots of One<br/>6.3.4.4 Having a Small Constant e<br/>6.3.4.5 Optimizing RSA Private Key Operations<br/>6.3.5 Arcane RSA Threats<br/>6.3.5.1 Smooth Numbers<br/>6.3.5.2 The Cube Root Problem<br/>6.3.6 Public-Key Cryptography Standard (PKCS)<br/>6.3.6.1 Encryption<br/>6.3.6.2 The Million-Message Attack<br/>6.3.6.3 Signing<br/>6.4 Diffie-Hellman<br/>6.4.1 MITM (Meddler-in-the-Middle) Attack<br/>6.4.2 Defenses Against MITM Attack<br/>6.4.3 Safe Primes and the Small-Subgroup Attack<br/>6.4.4 ElGamal Signatures<br/>6.5 Digital Signature Algorithm (DSA)<br/>6.5.1 The DSA Algorithm<br/>6.5.2 Why Is This Secure?<br/>6.5.3 Per-Message Secret Number<br/>6.6 How Secure Are RSA and Diffie-Hellman?<br/>6.7 Elliptic Curve Cryptography (ECC)<br/>6.7.1 Elliptic Curve Diffie-Hellman (ECDH)<br/>6.7.2 Elliptic Curve Digital Signature Algorithm (ECDSA)<br/>6.8 Homework<br/>CHAPTER 7 Quantum Computing<br/>7.1 What Is a Quantum Computer?<br/>7.1.1 A Preview of the Conclusions<br/>7.1.2 First, What Is a Classical Computer?<br/>7.1.3 Qubits and Superposition<br/>7.1.3.1 Example of a Qubit<br/>7.1.3.2 Multi-Qubit States and Entanglement<br/>7.1.4 States and Gates as Vectors and Matrices<br/>7.1.5 Becoming Superposed and Entangled<br/>7.1.6 Linearity<br/>7.1.6.1 No Cloning Theorem<br/>7.1.7 Operating on Entangled Qubits<br/>7.1.8 Unitarity<br/>7.1.9 Doing Irreversible Operations by Measurement<br/>7.1.10 Making Irreversible Classical Operations Reversible<br/>7.1.11 Universal Gate Sets<br/>7.2 Grover’s Algorithm<br/>7.2.1 Geometric Description<br/>7.2.2 How to Negate the Amplitude of |k?<br/>7.2.3 How to Reflect All the Amplitudes Across the Mean<br/>7.2.4 Parallelizing Grover’s Algorithm<br/>7.3 Shor’s Algorithm<br/>7.3.1 Why Exponentiation mod nIs a Periodic Function<br/>7.3.2 How Finding the Period of a mod nLets You Factor n<br/>7.3.3 Overview of Shor’s Algorithm<br/>7.3.4 Converting to the Frequency Graph—Introduction<br/>7.3.5 The Mechanics of Converting to the Frequency Graph<br/>7.3.6 Calculating the Period<br/>7.3.7 Quantum Fourier Transform<br/>7.4 Quantum Key Distribution (QKD)<br/>7.4.1 Why It’s Sometimes Called Quantum Encryption<br/>7.4.2 Is Quantum Key Distribution Important?<br/>7.5 How Hard Are Quantum Computers to Build?<br/>7.6 Quantum Error Correction<br/>7.7 Homework<br/>CHAPTER 8 Post-Quantum Cryptography<br/>8.1 Signature and/or Encryption Schemes<br/>8.1.1 NIST Criteria for Security Levels<br/>8.1.2 Authentication<br/>8.1.3 Defense Against Dishonest Ciphertext<br/>8.2 Hash-based Signatures<br/>8.2.1 Simplest Scheme – Signing a Single Bit<br/>8.2.2 Signing an Arbitrary-sized Message<br/>8.2.3 Signing Lots of Messages<br/>8.2.4 Deterministic Tree Generation<br/>8.2.5 Short Hashes<br/>8.2.6 Hash Chains<br/>8.2.7 Standardized Schemes<br/>8.2.7.1 Stateless Schemes<br/>8.3 Lattice-Based Cryptography<br/>8.3.1 A Lattice Problem<br/>8.3.2 Optimization: Matrices with Structure<br/>8.3.3 NTRU-Encryption Family of Lattice Encryption Schemes<br/>8.3.3.1 Bob Computes a (Public, Private) Key Pair<br/>8.3.3.2 How Bob Decrypts to Find m<br/>8.3.3.3 How Does this Relate to Lattices?<br/>8.3.4 Lattice-Based Signatures<br/>8.3.4.1 Basic Idea<br/>8.3.4.2 Insecure Scheme<br/>8.3.4.3 Fixing the Scheme<br/>8.3.5 Learning with Errors (LWE)<br/>8.3.5.1 LWE Optimizations<br/>8.3.5.2 LWE-based NIST Submissions<br/>8.4 Code-based Schemes<br/>8.4.1 Non-cryptographic Error-correcting Codes<br/>8.4.1.1 Invention Step<br/>8.4.1.2 Codeword Creation Step<br/>8.4.1.3 Misfortune Step<br/>8.4.1.4 Diagnosis Step<br/>8.4.2 The Parity-Check Matrix<br/>8.4.3 Cryptographic Public Key Code-based Scheme<br/>8.4.3.1 Neiderreiter Optimization<br/>8.4.3.2 Generating a Public Key Pair<br/>8.4.3.3 Using Circulant Matrices<br/>8.5 Multivariate Cryptography<br/>8.5.1 Solving Linear Equations<br/>8.5.2 Quadratic Polynomials<br/>8.5.3 Polynomial Systems<br/>8.5.4 Multivariate Signature Systems<br/>8.5.4.1 Multivariate Public Key Signatures<br/>8.6 Homework<br/>CHAPTER 9 Authentication of People<br/>9.1 Password-based Authentication<br/>9.1.1 Challenge-Response Based on Password<br/>9.1.2 Verifying Passwords<br/>9.2 Address-based Authentication<br/>9.2.1 Network Address Impersonation<br/>9.3 Biometrics<br/>9.4 Cryptographic Authentication Protocols<br/>9.5 Who Is Being Authenticated?<br/>9.6 Passwords as Cryptographic Keys<br/>9.7 On-Line Password Guessing<br/>9.8 Off-Line Password Guessing<br/>9.9 Using the Same Password in Multiple Places<br/>9.10 Requiring Frequent Password Changes<br/>9.11 Tricking Users into Divulging Passwords<br/>9.12 Lamport’s Hash<br/>9.13 Password Managers<br/>9.14 Web Cookies<br/>9.15 Identity Providers (IDPs)<br/>9.16 Authentication Tokens<br/>9.16.1 Disconnected Tokens<br/>9.16.2 Public Key Tokens<br/>9.17 Strong Password Protocols<br/>9.17.1 Subtle Details<br/>9.17.2 Augmented Strong Password Protocols<br/>9.17.3 SRP (Secure Remote Password)<br/>9.18 Credentials Download Protocols<br/>9.19 Homework<br/>CHAPTER 10 Trusted Intermediaries<br/>10.1 Introduction<br/>10.2 Functional Comparison<br/>10.3 Kerberos<br/>10.3.1 KDC Introduces Alice to Bob<br/>10.3.2 Alice Contacts Bob<br/>10.3.3 Ticket Granting Ticket (TGT)<br/>10.3.4 Interrealm Authentication<br/>10.3.5 Making Password-Guessing Attacks Difficult<br/>10.3.6 Double TGT Protocol<br/>10.3.7 Authorization Information<br/>10.3.8 Delegation<br/>10.4 PKI<br/>10.4.1 Some Terminology<br/>10.4.2 Names in Certificates<br/>10.5 Website Gets a DNS Name and Certificate<br/>10.6 PKI Trust Models<br/>10.6.1 Monopoly Model<br/>10.6.2 Monopoly plus Registration Authorities (RAs)<br/>10.6.3 Delegated CAs<br/>10.6.4 Oligarchy<br/>10.6.5 Anarchy Model<br/>10.6.6 Name Constraints<br/>10.6.7 Top-Down with Name Constraints<br/>10.6.8 Multiple CAs for Any Namespace Node<br/>10.6.9 Bottom-Up with Name Constraints<br/>10.6.9.1 Functionality of Up-Links<br/>10.6.9.2 Functionality of Cross-Links<br/>10.6.10 Name Constraints in PKIX Certificates<br/>10.7 Building Certificate Chains<br/>10.8 Revocation<br/>10.8.1 CRL (Certificate Revocation list)<br/>10.8.2 Online Certificate Status Protocol (OCSP)<br/>10.8.3 Good-Lists vs. Bad-Lists<br/>10.9 Other Information in a PKIX Certificate<br/>10.10 Issues with Expired Certificates<br/>10.11 DNSSEC (DNS Security Extensions)<br/>10.12 Homework<br/>CHAPTER 11 Communication Session Establishment<br/>11.1 One-way Authentication of Alice<br/>11.1.1 Timestamps vs. Challenges<br/>11.1.2 One-Way Authentication of Alice using a Public Key<br/>11.2 Mutual Authentication<br/>11.2.1 Reflection Attack<br/>11.2.2 Timestamps for Mutual Authentication<br/>11.3 Integrity/Encryption for Data<br/>11.3.1 Session Key Based on Shared Secret Credentials<br/>11.3.2 Session Key Based on Public Key Credentials<br/>11.3.3 Session Key Based on One-Party Public Keys<br/>11.4 Nonce Types<br/>11.5 Intentional MITM<br/>11.6 Detecting MITM<br/>11.7 What Layer?<br/>11.8 Perfect Forward Secrecy<br/>11.9 Preventing Forged Source Addresses<br/>11.9.1 Allowing Bob to Be Stateless in TCP<br/>11.9.2 Allowing Bob to Be Stateless in IPsec<br/>11.10 Endpoint Identifier Hiding<br/>11.11 Live Partner Reassurance<br/>11.12 Arranging for Parallel Computation<br/>11.13 Session Resumption/Multiple Sessions<br/>11.14 Plausible Deniability<br/>11.15 Negotiating Crypto Parameters<br/>11.15.1 Suites vs. à la Carte<br/>11.15.2 Downgrade Attack<br/>11.16 Homework<br/>CHAPTER 12 IPsec<br/>12.1 IPsec Security Associations<br/>12.1.1 Security Association Database<br/>12.1.2 Security Policy Database<br/>12.1.3 IKE-SAs and Child-SAs<br/>12.2 IKE (Internet Key Exchange Protocol)<br/>12.3 Creating a Child-SA<br/>12.4 AH and ESP<br/>12.4.1 ESP Integrity Protection<br/>12.4.2 Why Protect the IP Header?<br/>12.4.3 Tunnel, Transport Mode<br/>12.4.4 IPv4 Header<br/>12.4.5 IPv6 Header<br/>12.5 AH (Authentication Header)<br/>12.6 ESP (Encapsulating Security Payload)<br/>12.7 Comparison of Encodings<br/>12.8 Homework<br/>CHAPTER 13 SSL/TLS and SSH<br/>13.1 Using TCP<br/>13.2 StartTLS<br/>13.3 Functions in the TLS Handshake<br/>13.4 TLS 1.2 (and Earlier) Basic Protocol<br/>13.5 TLS 1.3<br/>13.7 PKI as Deployed by TLS<br/>13.6 Session Resumption<br/>13.8 SSH (Secure Shell)<br/>13.8.1 SSH Authentication<br/>13.8.2 SSH Port Forwarding<br/>13.9 Homework<br/>CHAPTER 14 Electronic Mail Security<br/>14.1 Distribution Lists<br/>14.2 Store and Forward<br/>14.3 Disguising Binary as Text<br/>14.4 HTML-Formatted Email<br/>14.5 Attachments<br/>14.6 Non-cryptographic Security Features<br/>14.6.1 Spam Defenses<br/>14.7 Malicious Links in Email<br/>14.8 Data Loss Prevention (DLP)<br/>14.9 Knowing Bob’s Email Address<br/>14.10 Self-Destruct, Do-Not-Forward, …<br/>14.11 Preventing Spoofing of From Field<br/>14.12 In-Flight Encryption<br/>14.13 End-to-End Signed and Encrypted Email<br/>14.14 Encryption by a Server<br/>14.15 Message Integrity<br/>14.16 Non-Repudiation<br/>14.17 Plausible Deniability<br/>14.18 Message Flow Confidentiality<br/>14.19 Anonymity<br/>14.20 Homework<br/>CHAPTER 15 Electronic Money<br/>15.1 ECASH<br/>15.2 Offline eCash<br/>15.2.1 Practical Attacks<br/>15.3 Bitcoin<br/>15.3.1 Transactions<br/>15.3.2 Bitcoin Addresses<br/>15.3.3 Blockchain<br/>15.3.4 The Ledger<br/>15.3.5 Mining<br/>15.3.6 Blockchain Forks<br/>15.3.7 Why Is Bitcoin So Energy-Intensive?<br/>15.3.8 Integrity Checks: Proof of Work vs. Digital Signatures<br/>15.3.9 Concerns<br/>15.4 Wallets for Electronic Currency<br/>15.5 Homework<br/>CHAPTER 16 Cryptographic Tricks<br/>16.1 Secret Sharing<br/>16.2 Blind Signature<br/>16.3 Blind Decryption<br/>16.4 Zero-Knowledge Proofs<br/>16.4.1 Graph Isomorphism ZKP<br/>16.4.2 Proving Knowledge of a Square Root<br/>16.4.3 Noninteractive ZKP<br/>16.5 Group Signatures<br/>16.5.1 Trivial Group Signature Schemes<br/>16.5.1.1 Single Shared Key<br/>16.5.1.2 Group Membership Certificate<br/>16.5.1.3 Multiple Group Membership Certificates<br/>16.5.1.4 Blindly Signed Multiple Group Membership Certificates<br/>16.5.2 Ring Signatures<br/>16.5.3 DAA (Direct Anonymous Attestation)<br/>16.5.4 EPID (Enhanced Privacy ID)<br/>16.6 Circuit Model<br/>16.7 Secure Multiparty Computation (MPC)<br/>16.8 Fully Homomorphic Encryption (FHE)<br/>16.8.1 Bootstrapping<br/>16.8.2 Easy-to-Understand Scheme<br/>16.9 Homework<br/>CHAPTER 17 Folklore<br/>17.1 Misconceptions<br/>17.2 Perfect Forward Secrecy<br/>17.3 Change Encryption Keys Periodically<br/>17.4 Don’t Encrypt without Integrity Protection<br/>17.5 Multiplexing Flows over One Secure Session<br/>17.5.1 The Splicing Attack<br/>17.5.2 Service Classes<br/>17.5.3 Different Cryptographic Algorithms<br/>17.6 Using Different Secret Keys<br/>17.6.1 For Initiator and Responder in Handshake<br/>17.6.2 For Encryption and Integrity<br/>17.6.3 In Each Direction of a Secure Session<br/>17.7 Using Different Public Keys<br/>17.7.1 Use Different Keys for Different Purposes<br/>17.7.2 Different Keys for Signing and Encryption<br/>17.8 Establishing Session Keys<br/>17.8.1 Have Both Sides Contribute to the Master Key<br/>17.8.2 Don’t Let One Side Determine the Key<br/>17.9 Hash in a Constant When Hashing a Password<br/>17.10 HMAC Rather than Simple Keyed Hash<br/>17.11 Key Derivation<br/>17.12 Use of Nonces in Protocols<br/>17.13 Creating an Unpredictable Nonce<br/>17.14 Compression<br/>17.15 Minimal vs. Redundant Designs<br/>17.16 Overestimate the Size of Key<br/>17.17 Hardware Random Number Generators<br/>17.18 Put Checksums at the End of Data<br/>17.19 Forward Compatibility<br/>17.19.1 Options<br/>17.19.2 Version Numbers<br/>17.19.2.1 Version Number Field Must Not Move<br/>17.19.2.2 Negotiating Highest Version Supported<br/>17.19.2.3 Minor Version Number Field<br/>Glossary<br/> |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
"With ever more of our commercial and personal lives occurring electronically, network security is vital. When networks don't have secure foundations, malware steals from us, invades our privacy, and threatens our safety. This guide uncovers the technology behind network security: its strengths, weaknesses, past, and future. It answers fundamental questions like: How do you identify yourself and prevent others from impersonating you? How do you communicate with others? How do you maintain your privacy? How do you buy and sell things? As a tutorial, it explains sophisticated concepts in a friendly and intuitive manner. As a reference, it covers concepts and techniques rigorously and in depth. The authors cover a wide spectrum of topics essential for securing web-based transactions, including public and secret key cryptography, hashes/message digests, signatures, authentication, blockchains, electronic money, secret sharing, and multiparty computation. They also address exciting emerging issues such as quantum computing, post-quantum algorithms, homomorphic encryption, and secure multiparty computation. Wherever math beyond high school algebra is needed, Network Security, 3rd Edition covers what students and other readers need to know, making it a self-contained solution suitable for undergraduate students, graduate students, and working engineers alike. To support learning and mastery, it also includes extensive homework problems, fully updated to reflect current concepts and technologies"-- Provided by publisher. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer security. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computers |
| General subdivision |
Access control. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Electronic data processing departments |
| General subdivision |
Security measures. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Computer networks |
| General subdivision |
Security measures. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Perlman, Radia |
| Relator term |
author |
| Relator code |
http://id.loc.gov/vocabulary/relators/aut |
| Authority record control number |
http://id.loc.gov/authorities/names/n91097789 |
| Real World Object URI (R) |
http://id.loc.gov/rwo/agents/n91097789 |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Speciner, Michael |
| Relator term |
author |
| Relator code |
http://id.loc.gov/vocabulary/relators/aut |
| Authority record control number |
http://id.loc.gov/authorities/names/n88614187 |
| Real World Object URI (R) |
http://id.loc.gov/rwo/agents/n88614187 |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Perlner, Ray, |
| Relator term |
author |
| Relator code |
http://id.loc.gov/vocabulary/relators/aut |
| 942 ## - ADDED ENTRY ELEMENTS |
|---|
| Source of classification or shelving scheme |
|
| Item type |
BOOK |