Information Security Applications 1st edition by Kiwook Sohn, Moti Yung 3642003066 9783642003066

Information Security Applications 1st edition by Kiwook Sohn, Moti Yung – Ebook PDF Instant Download/DeliveryISBN:  3642003066, 9783642003066 

Full download Information Security Applications 1st edition after payment.

Product details:

ISBN-10 :  3642003066 

ISBN-13 :  9783642003066

Author:  Kiwook Sohn, Moti Yung 

This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Workshop on Information Security Applications, WISA 2008, held in Jeju Island, Korea, during September 23-25, 2008. The 24 revised full papers presented were carefully reviewed and selected from a total of 161 submissions. The papers are organized in topical sections on smart card and secure hardware, wireless and sensor network security, public key crypto applications, privacy and anonymity, n/w security and intrusion detection, as well as application security and trust management.

Information Security Applications 1st Table of contents:

1. Smart Card and Secure Hardware(1)
2. Using Templates to Attack Masked Montgomery Ladder Implementations of Modular Exponentiation
3. Introduction
4. Masked Montgomery Powering Ladder
5. Principle of Template Attacks
6. Mask Filtering
7. Sieving with Tolerance
8. Practical Attack
9. Results
10. Conclusions
11. References
12. Template Attacks on ECDSA
13. Introduction
14. Template Attacks
15. Template Building Phase
16. Template Matching Phase
17. Previous Work
18. Our Contribution
19. ECDSA and Power Analysis Attacks
20. ECDSA Signature Generation
21. Security of Implementations of ECDSA
22. Template-Based SPA Attacks on ECDSA
23. Three Observations for Practical Applications
24. Different Scenarios for Practical Attacks
25. Practical Template-Based SPA Attacks on EC Point Multiplication
26. Template Building Phase
27. Template Matching with Pre-computed Templates
28. Template Matching with On-the-Fly Created Templates
29. Countermeasures
30. Conclusion
31. References
32. Compact ASIC Architectures for the 512-Bit Hash Function Whirlpool
33. Introduction
34. The 512-Bit Hash Function Whirlpool
35. Compact Hardware Architectures
36. Data Manager
37. Datapath Architectures
38. Performance Evaluation
39. Conclusion
40. References
41. Wireless and Sensor Network Security(1)
42. Improved Constant Storage Self-healing Key Distribution with Revocation in Wireless Sensor Network
43. Introduction
44. Overview of Dutta’s Scheme
45. Security Model of Dutta’s Scheme
46. Protocol Requirements
47. Self-healing Session Key Distribution
48. Attack To Dutta’s Scheme
49. The Proposed Scheme 1
50. Security Model of the Proposed Scheme
51. The Proposed Scheme 1
52. Security Analysis of Scheme 1
53. The Proposed Scheme 2
54. The Construction of Scheme 2
55. The Security Analysis of Scheme 2
56. Efficiency
57. Conclusion
58. References
59. Advances in Ultralightweight Cryptography for Low-Cost RFID Tags: Gossamer Protocol
60. Introduction
61. A Family of Ultralightweight Mutual Authentication Protocols
62. Security Analysis of the UMAP Protocols
63. SASIProtocol
64. Vulnerability Analysis
65. Gossamer Protocol
66. Model Suppositions
67. The Protocol
68. Security Analysis
69. Performance Analysis
70. Conclusions
71. General Considerations
72. Ultralightweight Protocols
73. References
74. Securing Layer-2 Path Selection in Wireless Mesh Networks
75. Introduction
76. Related Works
77. Path Selection Mechanism in 802.11s
78. Possible Attacks
79. Flooding Attack
80. Route Re-direction Attack
81. Routing Loops
82. Proposed Secure Layer-2 Path Selection (SLPS) Protocol
83. Key Establishment
84. Identifying Mutable and Non-mutable Fields
85. Secure Route Discovery
86. Security and Overhead Analyses
87. Security Analysis
88. Overhead Analysis
89. Performance Evaluation
90. Conclusions
91. References
92. Public Key Crypto Applications
93. Public Key Authentication with Memory Tokens
94. Introduction
95. Authentication Techniques
96. Approaches for Authentication
97. Merkle Signatures
98. Authentication without Calculations
99. Generating Signatures without Calculations
100. Authentication Protocol
101. Comparison
102. Implementation and Applications
103. Memory and Resource Requirements
104. Hardware Implementation
105. Applications
106. Conclusion
107. References
108. Certificate-Based Signatures: New Definitions and a Generic Construction from Certificateless Signat
109. Introduction
110. Certificate-Based Signatures: Pros and Cons
111. Related Works about Certificate-Based Signatures
112. Motivations and Contributions
113. Certificate-Based Signatures
114. Syntax of Certificate-Based Signatures
115. Adversaries and Oracles
116. Security Models
117. Security against Normal Type I Adversary
118. Security against Strong Type I Adversary
119. Security against Super Type I Adversary
120. Security against Type II Adversary
121. Generic Construction of Certificate-Based Signatures
122. Syntax of Certificateless Signatures
123. Generic Construction: {sf CLS-2-CBS}
124. Conclusion
125. References
126. Cryptanalysis of Mu et al.’s and Li et al.’s Schemes and a Provably Secure ID-Based Broadcast Si
127. Introduction
128. Preliminaries
129. Bilinear Pairing
130. Computational Diffie-Hellman Problem (CDHP)
131. ID-Based Broadcast Signcryption (IBBSC)
132. Framework of ID-Based Broadcast Signcryption (IBBSC)
133. Security Model for ID-Based Broadcast Signcryption
134. Overview of IBBSC Scheme of Mu et al.
135. Attack on IBBSC Scheme of Mu et al.
136. Overview of IBBSC Scheme of Li et al.
137. Attacks on IBBSC Scheme of Li et al.
138. Attack on Confidentiality
139. Attack on Authentication
140. Improved ID-Based Broadcast Signcryption Scheme
141. Proof of Confidentiality of Our IBBSC Scheme
142. Proof of Unforgeability of Our IBBSC Scheme
143. Efficiency of Our IBBSC Scheme
144. Conclusion
145. References
146. Privacy and Anonymity
147. Sanitizable and Deletable Signature
148. Introduction
149. Preliminaries
150. Aggregate Signature
151. Sanitizable Signature
152. Deletable Signature
153. Proposed Schemes
154. Concept
155. Approach
156. Subdocument Status
157. Proposed Scheme 1 (SDS1)
158. Proposed Scheme 2 (SDS2)
159. Comparison
160. Concluding Remarks
161. References
162. An Efficient Scheme of Common Secure Indices for Conjunctive Keyword-Based Retrieval on Encrypted Da
163. Introduction
164. Preliminaries
165. Models
166. Assumptions
167. Construction
168. Wang {it et al.} Dynamic Accumulator
169. Conjunctive Keyword Searches
170. Three-Party Cryptosystem
171. New CSI-CKR
172. Efficiency
173. Conclusions
174. References
175. Extension of Secret Handshake Protocols with Multiple Groups in Monotone Condition
176. References
177. N/W Security and Intrusion Detection
178. Pseudorandom-Function Property of the Step-Reduced Compression Functions of SHA-256 and SHA-512
179. Introduction
180. Preliminaries
181. Pseudorandom-Function Property
182. SHA-2 Compression Function
183. 22 Step-Reduced SHA-512 Compression Function
184. Distinguishing Algorithm
185. Analysis
186. 22 Step-Reduced SHA-256 Compression Function
187. Concluding Remarks
188. References
189. A Regression Method to Compare Network Data and Modeling Data Using Generalized Additive Model
190. Introduction
191. Generalized Additive Models(GAM)
192. Regression Analysis
193. Generalized Additive Model
194. Experiment and Results
195. The Characteristic of Data
196. Experimental Method
197. The Results of Experiments
198. Conclusions
199. References
200. A Visualization Technique for Installation Evidences Containing Malicious Executable Files Using Mac
201. Introduction
202. Related Work
203. The Data for Forensic Analysis
204. The Detection Mechanisms for Malicious Executable Files
205. Executable Files and Machine Language Instruction
206. Opcode Abstraction
207. The Quantification of the Information Contained in Opcodes
208. Decision Tree for Selection of Opcodes by C4.5
209. Acquisition Evidences of Malware Installation
210. The Similarity Graph
211. The Similarity Graphs between Diverse Versions of Executable File
212. Reassembling Data Blocks in Order
213. Conclusion and Future Work
214. References
215. Application Security and Trust Management
216. Image-Feature Based Human Identification Protocols on Limited Display Devices
217. Introduction
218. Matsumoto’s Threat Model
219. Human Identification Protocol Based on Images and their Features
220. Preliminaries: Definitions and Conjectures
221. Proposed Protocols
222. Protocol {sf P1}
223. Protocol {sf P2}
224. Security of the Protocols
225. Implementation
226. Conclusion
227. References
228. Ternary Subset Difference Method and Its Quantitative Analysis
229. Introduction
230. Background
231. Previous Work
232. Our Contribution
233. Preliminary
234. Trivial Expansion of the Conventional SD Method
235. Subsets in the Ternary SD Method
236. Subset Description
237. Cover-Finding Algorithm
238. Proposed Method
239. Label Assignment Algorithm
240. Encryption Algorithm
241. Decryption Algorithm
242. Analysis
243. Efficiency Analysis
244. Security Analysis
245. Discussion
246. Comparison with Conventional SD Method
247. Extension to Coalition Resistant a-Array SD Method
248. Conclusion
249. References
250. Data Deletion with Provable Security
251. Introduction
252. Related Work
253. Organization of This Paper
254. Secure Erasing via Special Coding
255. Physical Data Representation on Magnetic Hard Drives and Its Weaknesses
256. Our Scheme for Data Coding
257. From Physical to Mathematical Model
258. Analysis of Efficiency of Proposed Scheme
259. Case of Erasing Cryptographic Material
260. Formal Description of Considered Scenario
261. Knowledge of the Adversary
262. Single Bit Analysis
263. Analysis of a String of Random Data
264. Data Wiping Algorithms
265. Future Work
266. Conclusions
267. References
268. Smart Card and Secure Hardware(2)
269. A Probing Attack on AES
270. Introduction
271. Preliminaries
272. Notations
273. AES
274. Attack Model
275. Probing AES
276. Variants
277. Probing $S^{i}_{0,0}$
278. Probing Bytes of Rows 1-3
279. Known Plaintext Scenario
280. Conclusion
281. References
282. On Avoiding ZVP-Attacks Using Isogeny Volcanoes
283. Introduction
284. Preliminaries on Elliptic Curves
285. Isogenies
286. Isogeny Volcanoes and Cordilleras
287. $Side Channel Attacks$ in Smart Cards
288. Zero–Value Point Attacks
289. Isogenies–Route over Cordilleras
290. Algorithm
291. Implementation and Complexity
292. Experimental Results
293. Conclusions
294. References
295. Security Analysis of DRBG Using HMAC in NIST SP 800-90
296. Introduction
297. Preliminaries
298. A Pseudorandom Bit Generator
299. A Pseudorandom Function
300. $bf{HMAC_DRBG}$
301. Internal State
302. The Function $bf{Update}$
303. The Algorithm $bf{Generate}$
304. Security Analysis
305. If $adin$ = null
306. If $adin$ neq null
307. Conclusion
308. References
309. Wireless and Sensor Network Security(2)
310. Compact Implementation of SHA-1 Hash Function for Mobile Trusted Module
311. Introduction
312. SHA-1 Algorithm and Previous Works
313. SHA-1 Algorithm
314. Previous Works
315. Architecture Design of SHA-1 Algorithm
316. Design of Message Compression
317. Design of Message Schedule
318. Design of Software Interface
319. Implementation Results and Comparison
320. Synthesis Results
321. System Level Test
322. Conclusions
323. References
324. An Improved Distributed Key Management Scheme in Wireless Sensor Networks
325. Introduction
326. Network and Attack Models
327. Pair-Wise Key Management Scheme
328. Group Key Management Scheme
329. Analysis
330. Security Analysis
331. Performance Analysis
332. Conclusions
333. References
334. Protection Profile for Connected Interoperable DRM Framework
335. Introduction
336. Related Works
337. Common Criteria and Protection Profile
338. Interoperable DRM
339. Protection Profile
340. Introduction of Protection Profile
341. Security Problem Definition
342. Security Objectives
343. Security Requirement

People also search for Information Security Applications 1st:

what cryptographic applications are used in information system security
    
journal of information security and applications scimago
    
authentication applications in information security
    
introduction to machine learning with applications in information security
    
journal of information security and applications abbreviation

Tags: Information, Security Applications, Kiwook Sohn, Moti Yung