密碼學(xué)基礎(chǔ)（第二卷）

內(nèi)容概要

　　密碼學(xué)涉及解決通信保密問(wèn)題的計(jì)算系統(tǒng)的概念、定義及構(gòu)造。密碼系統(tǒng)的設(shè)計(jì)必須基于堅(jiān)實(shí)的基礎(chǔ)。本書繼上一卷對(duì)這一基礎(chǔ)問(wèn)題再次給出了系統(tǒng)而嚴(yán)格的論述：用已有工具來(lái)定義密碼系統(tǒng)的目標(biāo)并解決新的密碼學(xué)問(wèn)題。全書詳細(xì)闡述了三種基本應(yīng)用：加密、簽名和一般的密碼學(xué)協(xié)議。該書的重點(diǎn)是澄清基本概念及證明密碼學(xué)問(wèn)題解決方法的可行性，而不側(cè)重于對(duì)特殊方法的描述。    本書可作為密碼學(xué)、應(yīng)用數(shù)學(xué)、信息安全等專業(yè)的研究生教材，也可作為相關(guān)專業(yè)人員的參考用書。

作者簡(jiǎn)介

Oded Goldreich  以色列魏茨曼科學(xué)研究所的計(jì)算機(jī)科學(xué)教授，現(xiàn)任Meyer W.Weisgal講座教授。作為一名活躍的學(xué)者，他已經(jīng)發(fā)表了大量密碼學(xué)方面的論文，是密碼學(xué)領(lǐng)域公認(rèn)的世界級(jí)專家。他還是“Journal of Cryptology”，“SIAM Journal on Computing”雜志的編輯，1999年在Spri

書籍目錄

5 Encryption Schemes  5.1. The Basic Setting    5.1.1. Private-Key Versus Public-Key Schemes    5.1.2. The Syntax of Encryption Schemes  5.2. Definitions of Security    5.2.1. Semantic Security    5.2.2. Indistinguishability of Encryptions    5.2.3. Equivalence of the Security Definitions    5.2.4. Multiple Messages    5.2.5.* A Uniform-Complexity Treatment  5.3. Constructions of Secure Encryption Schemes    5.3.1.* Stream-Ciphers    5.3.2. Preliminaries: Block-Ciphers    5.3.3. Private-Key Encryption Schemes    5.3.4. Public-Key Encryption Schemes  5.4.* Beyond Eavesdropping Security    5.4.1. Overview    5.4.2. Key-Dependent Passive Attacks    5.4.3. Chosen Plaintext Attack    5.4.4. Chosen Ciphertext Attack    5.4.5. Non-Malleable Encryption Schemes  5.5. Miscellaneous    5.5.1. On Using Encryption Schemes    5.5.2. On Information-Theoretic Security    5.5.3. On Some Popular Schemes    5.5.4． HistOrical Notes    5.5.5． SuggestiOns f-0r Further Reading    5.5.6．Open Problems    5.5.7 Exercises6 Digital Signatures and Message Authentication  6.1. The Setting and Definitional Issues    6.1.1. The Two Types of Schemes: A Brief Overview    6.1.2. Introduction to the Unified Treatment    6.1.3. Basic Mechanism    6.1.4. Attacks and Security    6.1.5.* Variants  6.2. Length-Restricted Signature Scheme    6.2.1. Definition    6.2.2. The Power of Length-Restricted Signature Schemes    6.2.3.* Constructing Collision-Free Hashing Functions  6.3. Constructions of Message-Authentication Schemes    6.3.1. Applying a Pseudorandom Function to the Document    6.3.2.* More on Hash-and-Hide and State-Based MACs  6.4. Constructions of Signature Schemes    6.4.1. One-Time Signature Schemes    6.4.2. From One-Time Signature Schemes to General Ones    6.4.3.* Universal One-Way Hash Functions and Using Them  6.5.* Some Additional Properties    6.5.1. Unique Signatures    6.5.2. Super-Secure Signature Schemes    6.5.3. Off-Line/On-Line Signing    6.5.4. Incremental Signatures    6.5.5. Fail-Stop Signatures  6.6. Miscellaneous    6.6.1. On Using Signature Schemes    6.6.2. On Information-Theoretic Security    6.6.3. On Some Popular Schemes    6.6.4. Historical Notes    6.6.5. Suggestions for Further Reading    6.6.6. Open Problems    6.6.7. Exercises7 General Cryptographic Protocols  7.1. Overview    7.1.1. The Definitional Approach and Some Models    7.1.2. Some Known Results    7.1.3. Construction Paradigms  7.2.* The Two-Party Case: Definitions    7.2.1. The Syntactic Framework    7.2.2. The Semi-Honest Model    7.2.3. The Malicious Model  7.3.* Privately Computing (Two-Party) Functionalities    7.3.1. Privacy Reductions and a Composition Theorem    7.3.2. The OT Protocol: Definition and Construction    7.3.3. Privately Computing c + c2 = (al + a2). (hi + b2)    7.3.4. The Circuit Evaluation Protocol  7.4.* Forcing (Two-Party) Semi-Honest Behavior    7.4.1. The Protocol Compiler: Motivation and Overview    7.4.2. Security Reductions and a Composition Theorem    7.4.3. The Compiler: Functionalities in Use    7.4.4. The Compiler Itself  7.5.* Extension to the Multi-Party Case    7.5.1. Definitions    7.5.2. Security in the Semi-Honest Model    7.5.3. The Malicious Models: Overview and Preliminaries    7.5.4. The First Compiler: Forcing Semi-Honest Behavior    7.5.5. The Second Compiler: Effectively Preventing Abort    7.6.* Perfect Security in the Private Channel Model    7.6.1. Definitions    7.6.2. Security in the Semi-Honest Model    7.6.3. Security in the Malicious Model  7.7. Miscellaneous    7.7.1.* Three Deferred Issues    7.7.2.* Concurrent Executions    7.7.3. Concluding Remarks    7.7.4. Historical Notes    7.7.5. Suggestions for Further Reading    7.7.6. Open Problems    7.7.7. ExercisesAppendix C: Corrections and Additions to Volume 1  C.4. Enhanced Trapdoor Permutations  C.2. On Variants of Pseudorandom Functions  C.3. On Strong Witness Indistinguishability    C.3.1. On Parallel Composition    C.3.2. On Theorem 4.6.8 and an Afterthought    C.3.3. Consequences  C.4. On Non-Interactive Zero-Knowledge    C.4.1. On NIZKs with Efficient Prover Strategies    C.4.2. On Unbounded NIZKs    C.4.3. On Adaptive NIZKs  C.5. Some DevelOpments Regarding Zero-Knowledge  C.6. Additional Corrections and Comments  C.7. Additional MOttoesBibliographylndexNote： Asterisks indicate advanced material.

圖書封面

圖書標(biāo)簽Tags

無(wú)

評(píng)論、評(píng)分、閱讀與下載

---

    密碼學(xué)基礎(chǔ)（第二卷） PDF格式下載

---