eBook Encyclopedia of Cryptography and Security, 2nd Edition

  • Henk C.A. van Tilborg
  • Sushil Jajodia
  • Published By:
  • ISBN-10: 1441959068
  • ISBN-13: 9781441959065
  • DDC: 652.803
  • Grade Level Range: College Freshman - College Senior
  • 1435 Pages | eBook
  • Original Copyright 2011 | Published/Released October 2013
  • This publication's content originally published in print form: 2011
  • Price:  Sign in for price

About

Overview

Expanded into two volumes, the Second Edition of Springer’s Encyclopedia of Cryptography and Security brings the latest and most comprehensive coverage of the topic: Definitive information on cryptography and information security from highly regarded researchers Effective tool for professionals in many fields and researchers of all levels Extensive resource with more than 700 contributions in Second Edition 5643 references, more than twice the number of references that appear in the First Edition With over 300 new entries, appearing in an A-Z format, the Encyclopedia of Cryptography and Security provides easy, intuitive access to information on all aspects of cryptography and security. As a critical enhancement to the First Edition’s base of 464 entries, the information in the Encyclopedia is relevant for researchers and professionals alike. Topics for this comprehensive reference were elected, written, and peer-reviewed by a pool of distinguished researchers in the field. The Second Edition’s editorial board now includes 34 scholars, which was expanded from 18 members in the First Edition. Representing the work of researchers from over 30 countries, the Encyclopedia is broad in scope, covering everything from authentication and identification to quantum cryptography and web security.

Features and Benefits

  • Definitive information on cryptography and information security from highly regarded researchers.
  • Effective tool for professionals in many fields and researchers of all levels.
  • 5643 references, more than twice the number of references that appear in the First Edition.

Table of Contents

Front Cover.
Half Title Page.
Title Page.
Other Frontmatter.
Copyright Page.
Preface to the Second Edition.
Preface to the First Edition.
Acknowledgments.
Editors.
Editorial Board.
List of Contributors.
1: A5/1.
2: Access Control.
3: Access Control from an OS Security Perspective.
4: Access Control Lists.
5: Access Control Matrix.
6: Access Control Policies, Models, and Mechanisms.
7: Access Matrix.
8: Access Pattern.
9: Access Structure.
10: Acquirer.
11: Adaptive Chosen Ciphertext Attack.
12: Adaptive Chosen Plaintext and Chosen Ciphertext Attack.
13: Adaptive Chosen Plaintext Attack.
14: Administrative Policies.
15: Administrative Policies in SQL.
16: Adversarial/External Knowledge (Privacy in the Presence of).
17: Aggregate Signatures.
18: AHS Competition/SHA-3.
19: Alberti Encryption.
20: Algebraic Immunity of Boolean Functions.
21: Algorithmic DoS.
22: Alphabet.
23: Android's Security Framework–Understanding the Security of Mobile Phone Platforms.
24: Anonymity.
25: Anonymous Routing.
26: Anonymous Web Browsing and Publishing.
27: Application-Level Denial of Service.
28: Applications of Formal Methods to Intrusion Detection.
29: Applications of Formal Methods to Web Application Security.
30: ARIA.
31: ARP Spoofing.
32: Asymmetric Cryptosystem.
33: Attestation.
34: Attribute Certificate.
35: Authenticated Encryption.
36: Authentication.
37: Authentication Token.
38: Authentication, from an Information Theoretic Perspective.
39: Authorizations.
40: Autocorrelation.
41: Autotomic Signatures.
42: Availability.
43: Barrett's Algorithm.
44: Beaufort Encryption.
45: Bell-LaPadula Confidentiality Model.
46: Bell–La Padula Model.
47: Berlekamp Q-matrix.
48: Berlekamp–Massey Algorithm.
49: Biba Integrity Model.
50: Biba Model.
51: Binary Euclidean Algorithm.
52: Binary Exponentiation.
53: Binomial Distribution.
54: Biometric Authentication.
55: Biometric Encryption.
56: Biometric Matching.
57: Biometric Privacy.
58: Biometric Sample Quality.
59: Biometric Sensors.
60: Biometric Social Responsibility.
61: Biometric Systems Evaluation.
62: Biometric Technologies and Security – International Biometric Standards Development Activities.
63: Biometrics for Forensics.
64: Biometrics for Identity Management and Fields of Application.
65: Biometrics in Video Surveillance.
66: Biometrics: Terms and Definitions.
67: Birthday Paradox.
68: Blackmailing Attacks.
69: Blind Signature.
70: Blinding Techniques.
71: Block Ciphers.
72: Blowfish.
73: BLS Short Digital Signatures.
74: Blum Integer.
75: Blum–Blum–Shub Pseudorandom Bit Generator.
76: Blum–Goldwasser Public Key Encryption System.
77: Boolean Functions.
78: Boomerang Attack.
79: Botnet Detection in Enterprise Networks.
80: Broadcast Authentication from a Conditional Perspective.
81: Broadcast Authentication from an Information Theoretic Perspective.
82: Broadcast Encryption.
83: Buffer Overflow Attacks.
84: Bytecode Verification.
85: C2 – Block Cipher.
86: Cæsar Cipher.
87: Camellia.
88: Cast.
89: Cayley Hash Functions.
90: CBC-MAC and Variants.
91: CCIT2-Code.
92: Certificate.
93: Certificate Management.
94: Certificate of Primality.
95: Certificate Revocation.
96: Certificateless Cryptography.
97: Certification Authority.
98: Certified Mail.
99: Chaffing and Winnowing.
100: Challenge-Response Identification.
101: Chaum Blind Signature Scheme.
102: Chemical Combinatorial Attack.
103: Chinese Remainder Theorem.
104: Chinese Wall.
105: Chinese Wall Model.
106: Chosen Ciphertext Attack.
107: Chosen Plaintext and Chosen Ciphertext Attack.
108: Chosen Plaintext Attack.
109: Chroot Jail.
110: Ciphertext-Only Attack.
111: Clark and Wilson Model.
112: Claw-Free.
113: CLEFIA.
114: Clock-Controlled Generator.
115: Closest Vector Problem.
116: CMAC.
117: Code-Based Cryptography.
118: Codebook Attack.
119: Cold-Boot Attacks.
120: Collaborative DoS Defenses.
121: Collision Attack.
122: Collision Resistance.
123: Combination Generator.
124: Commitment.
125: Common Criteria.
126: Common Criteria, from a Security Policies Perspective.
127: Communication Channel Anonymity.
128: Compromising Emanations.
129: Computational Complexity.
130: Computational Diffie-Hellman Problem.
131: Computational Puzzles.
132: Conceptual Design of Secure Databases.
133: Contactless Cards.
134: Content-Based and View-Based Access Control.
135: Contract Signing.
136: Control Vector.
137: Cookie.
138: Copy Protection.
139: Correcting-Block Attack.
140: Correlation Attack for Stream Ciphers.
141: Correlation Immune and Resilient Boolean Functions.
142: Cover Story.
143: Covert Channels.
144: CPS, Certificate Practice Statement.
145: CPU Denial of Service.
146: Cramer–Shoup Public-Key System.
147: Credential-Based Access Control.
148: Credentials.
149: Cross Site Scripting Attacks.
150: Cross-Correlation.
151: Cryptanalysis.
152: Crypto Machines.
153: Cryptology.
154: Cryptophthora.
155: Cryptosystem.
156: CRYPTREC (Japanese Cryptographic Algorithm Evaluation Project).
157: Cube Attack.
158: Cut-and-Choose Protocol.
159: Cyclic Codes.
160: Data Encryption Standard (DES).
161: Data Linkage.
162: Data Mining (Privacy in).
163: Data Remanence.
164: Database Encryption.
165: Davies-Meyer.
166: DC Network.
167: De Bruijn Sequence.
168: Decisional Diffie–Hellman Problem.
169: Decoding Algorithms.
170: Decryption Exponent.
171: Deniable Encryption.
172: Denial-of-Service Detection.
173: Derived Key.
174: Designated Confirmer Signature.
175: Designated-Verifier Proofs.
176: DES-X (or DESX).
177: Dictionary Attack.
178: Dictionary Attack (I).
179: Differential Cryptanalysis.
180: Differential Power Analysis.
181: Differential Privacy.
182: Differential–Linear Attack.
183: Diffie–Hellman Key Agreement.
184: Digital Signature Scheme Based on McEliece.
185: Digital Signature Schemes.
186: Digital Signature Schemes from Codes.
187: Digital Signature Standard.
188: Digital Steganography.
189: Discrete Logarithm Problem.
1: ℓ-Diversity.
2: L Notation.
3: Lattice.
4: Lattice Reduction.
5: Lattice-Based Cryptography.
6: Least Common Multiple.
7: Least Privilege.
8: Legendre Symbol.
9: Levels of Trust.
10: Linear Complexity.
11: Linear Congruential Generator.
12: Linear Consistency Attack.
13: Linear Cryptanalysis for Block Ciphers.
14: Linear Cryptanalysis for Stream Ciphers.
15: Linear Feedback Shift Register.
16: Linear Syndrome Attack.
17: Location Information (Privacy of).
18: Location Privacy in Wireless Networks.
19: Logic Bomb.
20: Logic-Based Authorization Languages.
21: Luby-Rackoff Ciphers.
22: M-Invariance.
23: MAA.
24: MAC Algorithms.
25: Macrodata Protection.
26: Malware Behavior Clustering.
27: Malware Detection.
28: Mandatory Access Control.
29: Mandatory Access Control Policy (MAC).
30: Man-in-the-Middle Attack.
31: MARS.
32: MASH Hash Functions (Modular Arithmetic Secure Hash).
33: Master Key.
34: Maurer's Method.
35: Maximal-Length Sequences.
36: Maxims.
37: McEliece Public Key Cryptosystem.
38: MD4-MD5.
39: MDC-2 and MDC-4.
40: Meet-in-the-Middle Attack.
41: Memory and State Exhaustion Denial of Service.
42: Mersenne Prime.
43: Metrics of Software Security.
44: Microdata Masking Techniques.
45: Microdata Protection.
46: Miller-Rabin Probabilistic Primality Test.
47: Minimal Polynomial.
48: MIPS-Year.
49: Miss-in-the-Middle Attack.
50: Mix Networks.
51: Mobile Payments.
52: Mobile Wallet.
53: Modes of Operation of a Block Cipher.
54: Modular Arithmetic.
55: Modular Root.
56: Modulus.
57: Monotone Signatures.
58: Montgomery Arithmetic.
59: Moore's Law.
60: Multibiometrics.
61: Multilevel Database.
62: Multilevel Security Policies.
63: Multiparty Computation.
64: Multiple Encryption.
65: Multiple Independent Levels of Security.
66: Multiplicative Knapsack Cryptosystem.
67: Multiprecision Multiplication.
68: Multiprecision Squaring.
69: Multiset Attack.
70: Multi-Threaded Implementation for Cryptography and Cryptanalysis.
71: Multivariate Cryptography.
72: Naccache-Stern Higher Residues Cryptosystem.
73: Needham–Schroeder Protocols.
74: NESSIE Project.
75: Network Bandwidth Denial of Service (DoS).
76: Network Capabilities.
77: NFC.
78: Niederreiter Encryption Scheme.
79: NIST Elliptic Curves.
80: Node Clone Defense.
81: Noninteractive Proof.
82: Nonlinear Feedback Shift Register.
83: Nonlinearity of Boolean Functions.
84: Non-Malleability.
85: Nonrepudiation of Digital Signatures.
86: Nonsecret Encryption.
87: NSA Suite B.
88: NTRU.
89: Number Field.
90: Number Field Sieve for Factoring.
91: Number Field Sieve for the DLP.
92: Number Theory.
93: Nyberg–Rueppel Signature Scheme.
94: O-Notation.
95: OAEP: Optimal Asymmetric Encryption Padding.
96: Oblivious Transfer.
97: One Time Password, from a Key Management Perspective.
98: One-Time Password.
99: One-Way Function.
100: Optimal Extension Fields (OEFs).
101: Order.
102: Overlay-Based DoS Defenses.
103: Overspender Detection.
104: Overspending Prevention.
105: Packet-Dropping Attack.
106: Paillier Encryption and Signature Schemes.
107: Pairing-Based Key Exchange.
108: Pairing-Friendly Elliptic Curves.
109: Pairings.
110: Palmprint Recognition.
111: Passport Security.
112: Password.
113: Payment Card.
114: PEM, Privacy-Enhanced Mail.
115: Penetration Testing.
116: Perfect Forward Secrecy.
117: Perfectly Secure Message Transmission.
118: Permissions.
119: Personal Identification Number (PIN).
120: Phenotyping.
121: Physical Security.
122: Physical Unclonable Functions (PUFs).
123: PKCS.
124: PKI.
125: PKI Trust Models.
126: PKIX, Public Key Infrastructure (X.509).
127: Platform for Privacy Preferences (P3P).
128: Playfair Cipher.
129: PMAC.
130: Point Counting.
131: Policy Composition.
132: Polybios Square Encryption.
133: Polyinstantiation.
134: Polynomial Time.
135: Porta Encryption.
136: Post-Quantum Cryptography.
137: Practical E-Cash.
138: Preimage Resistance.
139: PRESENT – Block Cipher.
140: Pretty Good Privacy (PGP).
141: Primality Proving Algorithm.
142: Primality Test.
143: Prime Generation.
144: Prime Number.
145: Primitive Element.
146: Privacy of Outsourced Data.
147: Privacy-Aware Access Control Policies.
148: Privacy-Aware Languages.
149: Privacy-Preserving Authentication in Wireless Access Networks.
150: Private Information Retrieval.
151: Privileges in SQL.
152: Probabilistic Key Sharing.
153: Probabilistic Primality Test.
154: Probabilistic Public-Key Encryption.
155: Product Cipher, Superencryption.
156: Program Verification and Security.
157: Proof of Knowledge Versus Proof of Membership.
158: Proof-Carrying Code.
159: Propagation Characteristics of Boolean Functions.
160: Protected Mode.
161: Protection Rings.
162: Protocol.
163: Protocol Cookies.
164: Proximity Card.
165: Pseudo-Mersenne Prime.
166: Pseudo-Noise Sequences (PN-Sequences).
167: Pseudonyms.
168: Pseudoprime.
169: Pseudorandom Function.
170: Pseudorandom Number Generator.
171: Public Key Cryptography.
172: Public Key Proxy Encryption.
173: Public Key Proxy Signatures.
174: Quadratic Residue.
175: Quadratic Residuosity Problem.
176: Quadratic Sieve.
177: Quantum Cryptography.
178: Quasi-Identifier.
179: Rabin Cryptosystem.
180: Rabin Digital Signature Scheme.
181: Radio Frequency Attacks.
182: Rainbow Tables.
183: Random Bit Generator.
184: Random Number Testing.
185: Random Oracle Model.
186: Rank Codes.
187: RC4.
188: RC5.
189: RC6.
190: Recipient Anonymity.
191: Recursive Revoke.
192: Reed-Muller Codes.
193: Reference Monitor.
194: Related Key Attack.
195: Relatively Prime.
196: Relay Attack.
197: Replay Attack.
198: Response.
199: Resynchronization Attack.
200: Reverse Engineering of Malware Emulators.