Fundamentals of computer security

Authors Josef Pieprzyk, Thomas Hardjono, Jennifer Seberry

Publication date 22 April 2002

access control AES authentication authentication codes BAN logic biometrics birthday paradox bit commitment protocols blind signatures challenge-response protocols computer security cryptanalysis database security DES differential cryptanalysis Diffie-Hellman protocol digital money digital signatures electronic elections ElGamal elliptic curve cryptography fail-stop signatures filters hash function identification indistinguishability intrusion detection systems IPsec protocol Kerberos key establishment key-distribution linear cryptanalysis multiparty key establishment protocols network security OAEP one-time passwords passwords private-key cryptosystems probabilistic encryption pseudorandom bit generators pseudorandom function generators pseudorandom permutation generators pseudorandomness public-key cryptosystems RSA secret sharing schemes SHA-1 and RIPEMD SPX SSL threshold decryption threshold schemes threshold signature time-stamps undeniable signatures virus zero-knowledge protocols

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data encryption (aspects in computer science) (68P25)

Review text

The goal of the book is to present the basic concepts in computer and network security. It grown out of an undergraduate course on computer security. It has 18 chapter, each (except of the introductory one) concluding with a set of exercises and problems. The first two chapters gives introduction to the subject. The first one overviews the basic terminology, and summarizes the history of cryptography; the second one presents mathematics necessary to understand the rest of the book, as well as basics of complexity and information theory. The next eleven chapters are devoted to cryptography, the last five to computer and network security. Chapter 3 is devoted to private-key cryptography. First, it overviews the classical ciphers and shortly discusses their cryptographic properties and cryptanalysis. Next, modern cryptosystems including DES and some AES candidates are presented. The chapter concludes with introduction to differential and linear cryptanalysis. The next chapter deals with public key cryptography. The concept of the public-key cryptography is explained, and several public-key algorithm are presented (besides classical public key cryptosystem like RSA and ElGamal, one can find here also Merkle-Hellman, McEliece, and elliptic curve cryptosystems) and their security is discussed. Probabilistic encryption is shortly introduced. Security properties of public-key algorithms, and concept of OAEP (Optimal Asymmetric Encryption Padding) conclude the chapter. Chapter 5 discusses pseudorandomness. The notion of indistinguishability is introduced, and using it the pseudorandom bit, function, and permutation generators are explained. The next chapter studies hash functions. First, cryptographic properties of hash functions are introduced, and an attack based on the birthday paradox explained. Next, possible constructions of a hash function are described, several algorithms including SHA-1 and RIPEMD are presented, and their security is shortly discussed. The chapter on digital signature starts with basic digital signature schemes, and then addresses some special types of signatures: blind, undeniable, and fail-stop signatures, and time-stamps. Chapter 8 is devoted to authentication. The problems of authentication is introduced and modeled using the game theory. Next, several constructions of authentication codes are presented. The next chapter studies secret sharing schemes. Threshold as well as general secret sharing schemes, and several their constructions are discussed. The information rate of a scheme, and constructions of ideal and optimal schemes are explained. The application of secret sharing schemes is presented in Chapter 10 devoted to the group-oriented cryptography. It addresses conditional secure Shamir scheme, threshold decryption and signature. The key establishment is the subject of the next chapter. On examples of different protocols, both key agreement (e.g. Diffie-Hellman protocol) and key-distribution (e.g. Kerberos, and SPX) are explained. Multiparty key establishment protocols are discussed as well. The BAN logic --- a formalism for analyzing authentication protocols --- concludes the chapter. Chapter 12 covers zero-knowledge protocols. It addresses perfect as well as computational zero-knowledge proofs. Next, examples of bit commitment protocols are presented. Identification is discussed in Chapter 13. First, it reviews biometric techniques. Next, passwords, one-time passwords, and challenge-response protocols based on both private and public key cryptography are discussed. The rest of the chapter deals with identification based on zero-knowledge proofs. The next chapter is devoted to the intrusion detection. It introduces the concept of anomaly and misuse intrusion detection. Two mathematical models of intrusion detection are discussed: the probability, and Dempster-Shafer model. Next, several host and network intrusion detection systems are reviewed. Discussion on limitation of current Intrusion Detection Systems (IDS) and a list of IDS prototypes and commercial systems with references to their sources conclude the chapter. Chapter 15 deals with electronic elections and digital money. It overviews several protocols addressing these topics. The chapter on database protection and security deals with access control, filters, and encryption in database systems, as well as with security problems of database views. Further, it discusses security in special database systems like distributed, and object-oriented database systems, and expert systems. A review of security features of Oracle8 concludes the chapter. The chapter on access control introduces three fundamental models: mandatory, discretionary, and role-based access control. Next, several implementations of access control are described. The last chapter is devoted to the network security. The parts of IPsec protocol, and of SSL are reviewed. The chapter concludes with section about viruses. In 18 chapters the book overviews the most important topics of cryptography and some topics of computer security. It may be used for self-study, as well as a text for undergraduate and postgraduate courses.

Recommendations

Cited in

(28)

This page was built for publication: Fundamentals of computer security

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784264)