Muutke küpsiste eelistusi

E-raamat: Symmetric Cryptographic Protocols

1.00/5 (2 hinnangut Goodreads-ist)
  • Formaat: PDF+DRM
  • Ilmumisaeg: 05-Aug-2014
  • Kirjastus: Springer International Publishing AG
  • Keel: eng
  • ISBN-13: 9783319075846
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 110,53 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Symmetric Cryptographic ProtocolsSuurem pilt
  • Formaat: PDF+DRM
  • Ilmumisaeg: 05-Aug-2014
  • Kirjastus: Springer International Publishing AG
  • Keel: eng
  • ISBN-13: 9783319075846
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book focuses on protocols and constructions that make good use of the building blocks for symmetric cryptography. The book brings under one roof, several esoteric strategies of utilizing symmetric cryptographic blocks. The specific topics addressed by the book include various key distribution strategies for unicast, broadcast and multicast security and strategies for constructing efficient digests of dynamic databases using binary hash trees.

Arvustused

From the book reviews:

Experienced security practitioners and cryptography researchers will benefit from reading this book. the book provides a thorough analysis of key distribution and predistribution techniques, alongside pertinent applications. I would recommend this book as an advanced-level resource on symmetric cryptography and its application to diverse application scenarios. (Zubair Baig, Computing Reviews, February, 2015)

1 Introduction
1(10)
1.1 Cryptographic Algorithms
1(3)
1.1.1 Symmetric Cryptographic Algorithms
2(1)
1.1.2 Asymmetric Algorithms
3(1)
1.2 Using Cryptographic Algorithms
4(3)
1.2.1 Block Cipher Modes
4(1)
1.2.2 Hash Function
5(1)
1.2.3 Hashed Message Authentication Code
6(1)
1.2.4 Asymmetric Encryption and Signatures
6(1)
1.3 Cryptographic Protocols and Security Protocols
7(4)
1.3.1 Security Protocols
7(1)
1.3.2 Symmetric Protocols
8(1)
1.3.3 Symmetric Security Protocols
9(2)
2 Some Useful Constructions
11(8)
2.1 Hash Chains
11(4)
2.1.1 Hash Accumulator
12(1)
2.1.2 Hash Tree
12(3)
2.2 Random Subsets
15(4)
2.2.1 Si ⊂ Sn
15(1)
2.2.2 (Si ∩ Sj) ⊂ Sn
16(3)
3 Nonscalable Key Distribution Schemes
19(12)
3.1 Online KDC
20(2)
3.1.1 NS Protocol
20(1)
3.1.2 Leighton--Micali Protocol
20(2)
3.2 Offline KDC
22(1)
3.2.1 Basic KDS for Static Small-Scale Networks
22(1)
3.2.2 Key Distribution for Dynamic Networks
23(1)
3.3 MLS Key Distribution
23(3)
3.3.1 Identity Ticket (IT) Scheme
25(1)
3.4 Comparison
26(5)
3.4.1 MLS with Multiple KDCs
27(1)
3.4.2 MLS Applications
28(3)
4 MLS for Internet Security Protocols
31(32)
4.1 Domain Name System
31(3)
4.1.1 DNS Records
32(2)
4.2 Securing DNS
34(2)
4.2.1 Link-Security Approaches
35(1)
4.3 DNSSEC
36(2)
4.3.1 Authenticated Denial
36(1)
4.3.2 DNS-Walk
37(1)
4.4 MLS Based Alternative to DNSSEC
38(6)
4.4.1 Extending Link-Security Approaches
38(1)
4.4.2 Principle of TCB-DNS
39(3)
4.4.3 Computing Link Secrets
42(2)
4.5 The TCB-DNS Protocol
44(7)
4.5.1 The Atomic Relay Algorithm
44(2)
4.5.2 Preparation of TCB-DNS Master File
46(1)
4.5.3 Verification of RRSets
47(3)
4.5.4 Proof of Correctness
50(1)
4.6 Practical Considerations
51(7)
4.6.1 TCB-DNS vs. DNSSEC
52(1)
4.6.2 Authenticated Denial
53(2)
4.6.3 Overhead
55(1)
4.6.4 Replay Attacks
56(1)
4.6.5 DNSSEC with TSIG
56(1)
4.6.6 NSEC3 Opt-Out
57(1)
4.7 Alternative to IPSec
58(5)
4.7.1 IPSec Operation
59(1)
4.7.2 IPSec Issues
60(1)
4.7.3 IPSec Alternative Leveraging TCB-DNS
60(3)
5 Scalable Key Distribution Schemes
63(18)
5.1 Certificates Based Schemes
63(1)
5.2 Identity Based Schemes
64(3)
5.2.1 Identity-Based Key Predistribution Schemes
64(1)
5.2.2 Blom's Schemes
65(2)
5.3 Probabilistic KPSs (PKPS)
67(4)
5.3.1 Allocation of Subsets
67(1)
5.3.2 Random Preloaded Subsets
68(1)
5.3.3 Hash-Chain KPS
68(2)
5.3.4 Hashed Random Preloaded Subsets (HARPS)
70(1)
5.4 (n, p)-Security of HARPS
71(4)
5.4.1 Probability of Winning a Round
72(1)
5.4.2 Optimization of Parameters
73(2)
5.5 Deterministic Versus Probabilistic KPSs
75(6)
5.5.1 KPS Complexity
77(1)
5.5.2 Complexity Versus Desired Collusion Resistance n
78(1)
5.5.3 Using External Resources
78(1)
5.5.4 Low Complexity Hardware
79(1)
5.5.5 Multiple KDCs and Renewal
79(1)
5.5.6 Exploiting Multi-path Diversity
80(1)
5.5.7 Conclusions
80(1)
6 Scalable Extensions of Nonscalable Schemes
81(22)
6.1 Parallel Basic KPS
81(1)
6.2 Parallel Leighton--Micali Scheme (PLM)
82(2)
6.3 (n, p)-Security of PBK and PLM
84(1)
6.3.1 Optimal Choice of Parameters m and M
84(1)
6.4 Subset Keys and Identity Tickets (SKIT)
85(2)
6.4.1 (n, p)-Security of SKIT
86(1)
6.4.2 Optimal Choice of Parameters
87(1)
6.5 Comparison of KPSs
87(3)
6.6 Beyond (n, p)-Security
90(6)
6.6.1 (n, φ, pa)-Security of RPS
91(2)
6.6.2 (n, φ, pa)-Security of PBK/PLM
93(2)
6.6.3 (n, φ, pa)-Security of SKIT
95(1)
6.6.4 Addressing Message Injection Attacks
95(1)
6.7 PLM for Sensor Networks
96(5)
6.7.1 Classical Sensor Network Model
97(1)
6.7.2 Assumptions
97(1)
6.7.3 Key Distribution for Sensor Networks
98(1)
6.7.4 Key Establishment
99(1)
6.7.5 Performance and Overhead
100(1)
6.8 Conclusions
101(2)
7 Using PKPSs with Tamper-Responsive Modules
103(32)
7.1 Core Principles
103(4)
7.1.1 Active and Passive Shields
104(1)
7.1.2 State Transitions
105(2)
7.1.3 Single-Step Countermeasures
107(1)
7.2 The DOWN Policy
107(7)
7.2.1 DOWN-Enabled Modules
108(1)
7.2.2 DOWN with Other Asymmetric Schemes
109(2)
7.2.3 DOWN With ID-Based Schemes
111(2)
7.2.4 DOWN Assurance and Complexity
113(1)
7.2.5 DOWN with PKPSs
114(1)
7.3 A Second Look at Key Predistribution Scheme (KPS) Complexity
114(3)
7.3.1 Generic Device Model
115(2)
7.4 Comparison of KPSs
117(7)
7.4.1 Deployment Complexity
117(3)
7.4.2 Complexity During Regular Operation
120(2)
7.4.3 PLM
122(1)
7.4.4 PBK
122(1)
7.4.5 RPS and HARPS
123(1)
7.5 KPS Algorithms
124(3)
7.5.1 MLS
126(1)
7.5.2 Scalable KPSs
126(1)
7.6 Security Protocols Utilizing fpw()
127(6)
7.6.1 Atomic Relay Protocols
128(1)
7.6.2 Atomic Authentication Relay Algorithm
128(2)
7.6.3 Atomic Path Secret Relay Algorithm
130(1)
7.6.4 Accepting Relays
131(2)
7.7 Conclusions
133(2)
8 Broadcast Authentication and Broadcast Encryption
135(28)
8.1 Certificates-Based Broadcast Authentication (BA)
135(3)
8.1.1 One-Time Signatures (OTS)
135(2)
8.1.2 Timed Efficient Stream Loss Tolerant Authentication (TESLA)
137(1)
8.2 Identity-Based Broadcast Authentication (BA) Using Key Predistribution
138(4)
8.2.1 Reducing Signature Size
139(2)
8.2.2 Effect of Decrypt Only When Necessary (DOWN) Assurance
141(1)
8.3 Broadcast Encryption
142(3)
8.3.1 Tree-Based Broadcast Encryption (BE) Schemes
142(2)
8.3.2 Broadcast Encryption (BE) Using Probabilistic Key Distribution
144(1)
8.3.3 Broadcast Encryption (BE) by Sources Other Than Key Distribution Center (KDC)
145(1)
8.4 Performance of Probabilistic Key Predistribution Scheme Broadcast Encryption (PKPS BE)
145(7)
8.4.1 Performance Bounds
147(1)
8.4.2 Over-Provisioning Keys
148(1)
8.4.3 Hashed Random Preloaded Subsets (HARPS) vs. Random Preloaded Subsets (RPS)
149(3)
8.5 Models for Broadcast Encryption (BE)
152(5)
8.5.1 G = N Models
152(1)
8.5.2 N >> G Models
153(2)
8.5.3 Batch Sizes for External Sources
155(2)
8.6 Application of Probabilistic Key Predistribution Scheme Broadcast Encryption (PKPS BE) in Publish--Subscribe Systems
157(6)
8.6.1 Desirable Features
157(1)
8.6.2 PKPS-BE vs. T-BE for Pub--Sub Systems
158(2)
8.6.3 Pub--Sub Operation
160(3)
9 Authenticated Data Structures
163(32)
9.1 Merkle Tree as an ADS
164(3)
9.1.1 Merkle Tree Protocols
165(2)
9.2 Ordered Merkle Tree
167(10)
9.2.1 OMT Leaves
167(2)
9.2.2 OMT Nodes
169(1)
9.2.3 Verification and Update Protocols
170(1)
9.2.4 Insertion of OMT Leaves
171(2)
9.2.5 Reordering OMT Leaves
173(1)
9.2.6 Index Ordered Merkle Tree
174(1)
9.2.7 Domain Ordered Merkle Tree
175(1)
9.2.8 Summary of OMT Properties
176(1)
9.3 OMT Algorithms in Trusted Resource Limited Boundaries
177(14)
9.3.1 Self-Certificates
178(1)
9.3.2 Core OMT Functions
179(1)
9.3.3 OMT Functions Exposed by T
180(3)
9.3.4 Root Equivalence Certificates
183(3)
9.3.5 Module T State
186(2)
9.3.6 Using Module Functions
188(1)
9.3.7 Context/Application Dependent Functions
189(2)
9.4 Infrastructural Requirements
191(4)
10 Universal Trusted Computing Bases
195(28)
10.1 Practical Systems
195(3)
10.1.1 Complexity and Ignorance
195(2)
10.1.2 System Security Model
197(1)
10.2 Trusted Platform Modules
198(2)
10.2.1 Realizing a TCG Trusted Platform
198(1)
10.2.2 Pitfalls of the TCG Approach
199(1)
10.3 Trinc
200(3)
10.3.1 Virtual Counters
202(1)
10.4 Credential Management Modules
203(9)
10.4.1 Credential Transaction Model
204(3)
10.4.2 Consequential Transactions
207(1)
10.4.3 Virtual Networks
207(1)
10.4.4 VN State Changes
208(1)
10.4.5 CMM State and VN State
209(1)
10.4.6 Changing VN State
210(1)
10.4.7 CMMs as ADS Constructors and Verifiers
211(1)
10.5 CMM System Architecture
212(4)
10.5.1 CMM Universe
213(1)
10.5.2 Creation of Virtual Networks
213(2)
10.5.3 Intra-VN Key Distribution
215(1)
10.5.4 VN Links
215(1)
10.6 Credential Transaction Model of Representative Systems
216(7)
10.6.1 Credential Transaction Model for DNS
217(2)
10.6.2 DNS Transactions
219(2)
10.6.3 Transaction Models for Other Systems
221(2)
11 Conclusions
223(4)
References 227(6)
Index 233
Dr. Ramkumar is an Associate Professor, at the Dept. of CSE, MSU since August 2009.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833190758462e.html
Märksõnad: