Fundamentals of Computer Security

by Pieprzyk, Josef; Hardjono, Thomas; Seberry, Jennifer

• ISBN13: 9783540431015
• ISBN10: 3540431012
• eBook ISBN(s): 9783662073247
• Format: Hardcover
• Copyright: 2003-04-01
• Publisher: Springer Verlag
• More Book Details
• Purchase Benefits

Summary

This book presents modern concepts of computer security. It introduces the basic mathematical background necessary to follow computer security concepts. Modern developments in cryptography are examined, starting from private-key and public-key encryption, going through hashing, digital signatures, authentication, secret sharing, group-oriented cryptography, pseudorandomness, key establishment protocols, zero-knowledge protocols, and identification, and finishing with an introduction to modern e-business systems based on digital cash. Intrusion detection and access control provide examples of security systems implemented as a part of operating system. Database and network security is also discussed.

Table of Contents

Introduction	1	(10)
Preamble	1	(2)
Terminology	3	(3)
Historical Perspective	6	(2)
Modern Cryptography	8	(3)
Background Theory	11	(58)
Elements of Number Theory	11	(17)
Divisibility and the Euclid Algorithm	11	(4)
Primes and the Sieve of Eratosthenes	15	(1)
Congruences	16	(3)
Computing Inverses in Congruences	19	(6)
Legendre and Jacobi Symbols	25	(1)
Chinese Remainder Theorem	26	(2)
Algebraic Structures in Computing	28	(10)
Sets and Operations	28	(4)
Polynomial Arithmetic	32	(4)
Computing in Galois Fields	36	(2)
Complexity of Computing	38	(14)
Asymptotic Behavior of Functions	38	(1)
Hierarchy of Functions	39	(2)
Problems and Algorithms	41	(1)
Classes P and NP	42	(2)
NP Completeness	44	(2)
Complementary Problems in NP	46	(2)
NP-Hard and #P-Complete Problems	48	(1)
Problems Used in Cryptography	49	(2)
Probabilistic Computations	51	(1)
Quantum Computing	52	(1)
Elements of Information Theory	52	(14)
Entropy	53	(2)
Huffman Codes	55	(2)
Redundancy of the Language	57	(3)
Key Equivocation and Unicity Distance	60	(2)
Equivocation of a Simple Cryptographic System	62	(4)
Problems and Exercises	66	(3)
Private-Key Cryptosystems	69	(102)
Classical Ciphers	69	(20)
Caesar Ciphers	70	(2)
Affine Ciphers	72	(2)
Monoalphabetic Substitution Ciphers	74	(2)
Transposition Ciphers	76	(3)
Homophonic Substitution Ciphers	79	(2)
Polyalphabetic Substitution Ciphers	81	(2)
Cryptanalysis of Polyalphabetic Substitution Ciphers	83	(6)
DES Family	89	(17)
Product Ciphers	90	(3)
Lucifer Algorithm	93	(1)
DES Algorithm	94	(8)
DES Modes of Operation	102	(2)
Triple DES	104	(2)
Modern Private-Key Cryptographic Algorithms	106	(16)
Fast Encryption Algorithm (FEAL)	106	(1)
IDEA	106	(4)
RC6	110	(2)
Rijndael	112	(5)
Serpent	117	(4)
Other Ciphers	121	(1)
Differential Cryptanalysis	122	(13)
XOR Profiles	123	(4)
DES Round Characteristics	127	(2)
Cryptanalysis of 4-Round DES	129	(2)
Cryptanalysis of 6-Round DES	131	(3)
Analysis of Other Feistel-Type Cryptosystems	134	(1)
Linear Cryptanalysis	135	(9)
Linear Approximation	136	(4)
Analysis of 3-Round DES	140	(1)
Linear Characteristics	141	(3)
S-box Theory	144	(23)
Boolean Functions	145	(4)
S-box Design Criteria	149	(7)
Bent Functions	156	(2)
Propagation and Nonlinearity	158	(3)
Constructions of Balanced Functions	161	(4)
S-box Design	165	(2)
Problems and Exercises	167	(4)
Public-Key Cryptosystems	171	(48)
Concept of Public-Key Cryptography	171	(3)
RSA Cryptosystem	174	(15)
Variants of RSA	176	(2)
Primality Testing	178	(2)
Factorization	180	(6)
Security of RSA	186	(3)
Merkle-Hellman Cryptosystem	189	(3)
Security of Merkle-Hellman Cryptosystem	192	(1)
McEliece Cryptosystem	192	(3)
Security of McEliece Cryptosystem	194	(1)
ElGamal Cryptosystem	195	(1)
Security of ElGamal Cryptosystem	196	(1)
Elliptic Cryptosystems	196	(10)
Elliptic Curves	197	(2)
Addition of Points	199	(2)
Elliptic Curve Variant of RSA	201	(4)
Elliptic Curve Variant of ElGamal	205	(1)
Probabilistic Encryption	206	(3)
GM Probabilistic Encryption	207	(1)
BG Probabilistic Encryption	208	(1)
Public-Key Encryption Practice	209	(7)
Taxonomy of Public-Key Encryption Security	209	(2)
Generic OAEP Public-Key Cryptosystem	211	(2)
RSA Encryption Standard	213	(1)
Extended ElGamal Cryptosystem	214	(2)
Problems and Exercises	216	(3)
Pseudorandomness	219	(24)
Number Generators	219	(2)
Polynomial Indistinguishability	221	(3)
Pseudorandom Bit Generators	224	(8)
RSA Pseudorandom Bit Generator	225	(2)
BBS Pseudorandom Bit Generator	227	(5)
Next Bit Test	232	(1)
Pseudorandom Function Generators	233	(5)
Pseudorandom Permutation Generators	238	(3)
Super Pseudorandom Permutation Generators	241	(1)
Problems and Exercises	242	(1)
Hashing	243	(40)
Properties of Hashing	243	(1)
Birthday Paradox	244	(5)
Serial and Parallel Hashing	249	(1)
Theoretic Constructions	250	(4)
Hashing Based on Cryptosystems	254	(2)
MD (Message Digest) Family	256	(19)
MD5	257	(5)
SHA-1	262	(2)
RIPEMD-160	264	(4)
HAVAL	268	(5)
Hashing Based on Intractable Problems	273	(2)
Keyed Hashing	275	(5)
Early MACs	276	(2)
MACs from Keyless Hashing	278	(2)
Problems and Exercises	280	(3)
Digital Signatures	283	(24)
Properties of Digital Signatures	283	(2)
Generic Signature Schemes	285	(3)
Rabin Signatures	285	(1)
Lamport Signatures	286	(1)
Matyas-Meyer Signatures	287	(1)
RSA Signatures	288	(2)
ElGamal Signatures	290	(4)
Blind Signatures	294	(1)
Undeniable Signatures	295	(4)
Fail-Stop Signatures	299	(3)
Timestamping	302	(2)
Problems and Exercises	304	(3)
Authentication	307	(20)
Active Opponents	307	(2)
Model of Authentication Systems	309	(8)
Elements of the Theory of Games	310	(1)
Impersonation Game	311	(3)
Substitution Game	314	(2)
Spoofing Game	316	(1)
Information Theoretic Bounds	317	(2)
Constructions of A-codes	319	(4)
A-codes in Projective Spaces	319	(2)
A-codes and Orthogonal Arrays	321	(1)
A-codes Based on Error Correcting Codes	322	(1)
General A-codes	323	(1)
Problems and Exercises	324	(3)
Secret Sharing	327	(26)
Threshold Secret Sharing	327	(5)
(t, t) Threshold Schemes	328	(1)
Shamir Scheme	329	(2)
Blakley Scheme	331	(1)
Modular Scheme	331	(1)
General Secret Sharing	332	(6)
Cumulative Array Construction	334	(3)
Benaloh-Leichter Construction	337	(1)
Perfectness	338	(2)
Information Rate	340	(8)
Upper Bounds	341	(3)
Ideal Schemes	344	(3)
Non-ideal Optimal Secret Sharing	347	(1)
Extended Capabilities	348	(2)
Problems and Exercises	350	(3)
Group-Oriented Cryptography	353	(26)
Conditionally Secure Shamir Scheme	353	(8)
Description of the Scheme	354	(1)
Renewal of the Scheme	355	(1)
Noninteractive Verification of Shares	356	(2)
Proactive Secret Sharing	358	(3)
Threshold Decryption	361	(7)
ElGamal Threshold Decryption	361	(2)
RSA Threshold Decryption	363	(3)
RSA Decryption Without Dealer	366	(2)
Threshold Signatures	368	(8)
RSA Threshold Signatures	369	(2)
ElGamal Threshold Signatures	371	(2)
Threshold DSS Signatures	373	(3)
Problems and Exercises	376	(3)
Key Establishment Protocols	379	(30)
Classical Key Transport Protocols	381	(2)
Diffie-Hellman Key Agreement Protocol	383	(2)
DH Problem	385	(1)
Modern Key Distribution Protocols	385	(8)
Kerberos	387	(3)
SPX	390	(2)
Other Authentication Services	392	(1)
Key Agreement Protocols	393	(5)
MTI Protocols	394	(1)
Station-to-Station Protocol	394	(1)
Protocols with Self-certified Public Keys	395	(2)
Identity-Based Protocols	397	(1)
Conference-Key Establishment Protocols	398	(3)
BAN Logic of Authentication	401	(6)
BAN Logical Postulates	401	(2)
Analysis of the Needham-Schroeder Protocol	403	(4)
Problems and Exercises	407	(2)
Zero-Knowledge Proof Systems	409	(24)
Interactive Proof Systems	409	(4)
Perfect Zero-Knowledge Proofs	413	(8)
Computational Zero-Knowledge Proofs	421	(3)
Bit Commitment Schemes	424	(6)
Blobs with Unconditional Secrecy	425	(2)
Blobs with Unconditional Binding	427	(1)
Multivalued Blobs	428	(2)
Problems and Exercises	430	(3)
Identification	433	(26)
Basic Identification Techniques	433	(1)
User Identification	434	(2)
Passwords	436	(4)
Attacks on Passwords	437	(2)
Weaknesses of Passwords	439	(1)
Challenge-Response Identification	440	(3)
Authentication of Shared Keys	440	(1)
Authentication of Public Keys	441	(2)
Identification Protocols	443	(7)
Fiat-Shamir Identification Protocol	443	(2)
Feige-Fiat-Shamir Identification Protocol	445	(2)
Guillou-Quisquater Identification Protocol	447	(3)
Identification Schemes	450	(6)
Schnorr Identification Scheme	450	(2)
Okamoto Identification Scheme	452	(2)
Signatures from Identification Schemes	454	(2)
Problems and Exercises	456	(3)
Intrusion Detection	459	(40)
Introduction	459	(2)
Anomaly Intrusion Detection	461	(5)
Statistical IDS	462	(1)
Predictive Patterns	463	(2)
Neural Networks	465	(1)
Misuse Intrusion Detection	466	(1)
Uncertainty in Intrusion Detection	467	(6)
Probabilistic Model	467	(4)
Dempster-Shafer Theory	471	(2)
Generic Intrusion Detection Model	473	(3)
Host Intrusion Detection Systems	476	(4)
IDES	476	(2)
Haystack	478	(1)
MIDAS	479	(1)
Network Intrusion Detection Systems	480	(7)
NSM	481	(2)
DIDS	483	(2)
NADIR	485	(1)
Cooperating Security Manager (CSM)	485	(2)
Limitations of Current Intrusion Detection Systems	487	(3)
General Limitations	487	(1)
Network-IDS Shortcomings	488	(2)
The Common Intrusion Detection Framework (CIDF)	490	(2)
Partial List of ID Systems	492	(5)
Problems and Exercises	497	(2)
Electronic Elections and Digital Money	499	(26)
Electronic Elections	499	(10)
A Simple Electronic Election Protocol	501	(2)
Chaum Protocol	503	(2)
Boyd Protocol	505	(1)
Fujioka-Okamoto-Ohta Protocol	506	(2)
Other Protocols	508	(1)
Digital Cash	509	(13)
Untraceable Digital Coins	510	(3)
Divisible Electronic Cash	513	(4)
Brands Electronic Cash Protocol	517	(2)
Other E-Cash Protocols	519	(1)
Micropayments	520	(2)
Payment Protocols	522	(3)
Database Protection and Security	525	(40)
Database Access Control	525	(2)
Security Filters	527	(2)
Encryption Methods	529	(10)
Privacy Homomorphisms	538	(1)
Database Machines and Architectures	539	(5)
Experimental Back-end Database Systems	541	(3)
Database Views	544	(7)
Advantages and Disadvantages of Views	546	(2)
Completeness and Consistency of Views	548	(1)
Design and Implementations of Views	549	(2)
Security in Distributed Databases	551	(3)
Security in Object-Oriented Database Systems	554	(3)
Security in Knowledge-Based Systems	557	(1)
Oracle8 Security	558	(7)
User Authentication	558	(2)
Access Control	560	(3)
Oracle Security Server	563	(2)
Access Control	565	(26)
Mandatory Access Control	567	(4)
Lattice Model	567	(2)
Bell-LaPadula Model	569	(2)
Discretionary Access Control	571	(5)
Access Matrix Model	571	(3)
Harrison-Ruzzo-Ullman Model	574	(2)
Role-Based Access Control Model	576	(2)
Implementations of Access Control	578	(13)
Security Kernel	578	(3)
Multics	581	(1)
UNIX	582	(2)
Capabilities	584	(3)
Access Control Lists	587	(4)
Network Security	591	(40)
Internet Protocol Security (IPsec)	591	(11)
Security Associations	594	(1)
Authentication Header Protocol	594	(2)
Encapsulating Security Payload Protocol	596	(1)
Internet Key Exchange	597	(4)
Virtual Private Networks	601	(1)
Secure Sockets Layer	602	(9)
States of SSL	602	(2)
SSL Record Protocol	604	(2)
Handshake Protocol	606	(3)
Change Cipher Spec and Alert Protocols	609	(1)
Cryptographic Computations	610	(1)
Transport-Layer Security	611	(1)
Computer Viruses	611	(20)
What Is a Computer Virus?	611	(1)
Worms and Trojan Horses	612	(1)
Taxonomy of Viruses	613	(2)
IBM-PC Viruses	615	(4)
Macintosh Operating System	619	(4)
Macintosh Viruses	623	(2)
Macro Viruses	625	(2)
Protection Against Viruses	627	(4)
References	631	(34)
Index	665