logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Information Security Applications 11th International Workshop WISA 2010 Jeju Island Korea August 24 26 2010 Revised Selected Papers 1st Edition by Yongwha Chung, Moti Yung 364217955X 9783642179556

  • SKU: BELL-2147486
Information Security Applications 11th International Workshop WISA 2010 Jeju Island Korea August 24 26 2010 Revised Selected Papers 1st Edition by Yongwha Chung, Moti Yung 364217955X 9783642179556
$ 31.00 $ 45.00 (-31%)

4.3

48 reviews

Information Security Applications 11th International Workshop WISA 2010 Jeju Island Korea August 24 26 2010 Revised Selected Papers 1st Edition by Yongwha Chung, Moti Yung 364217955X 9783642179556 instant download after payment.

Publisher: Springer-Verlag Berlin Heidelberg
File Extension: PDF
File size: 5.95 MB
Pages: 352
Author: Sumit Kumar Pandey, Rana Barua (auth.), Yongwha Chung, Moti Yung (eds.)
ISBN: 3642179541
Language: English
Year: 2011
Edition: 1

Product desciption

Information Security Applications 11th International Workshop WISA 2010 Jeju Island Korea August 24 26 2010 Revised Selected Papers 1st Edition by Yongwha Chung, Moti Yung 364217955X 9783642179556 by Sumit Kumar Pandey, Rana Barua (auth.), Yongwha Chung, Moti Yung (eds.) 3642179541 instant download after payment.

Information Security Applications 11th International Workshop WISA 2010 Jeju Island Korea August 24 26 2010 Revised Selected Papers 1st Edition by Yongwha Chung, Moti Yung - Ebook PDF Instant Download/Delivery: 364217955X, 9783642179556

Full download Information Security Applications 11th International Workshop WISA 2010 Jeju Island Korea August 24 26 2010 Revised Selected Papers 1st Edition after payment

 

Product details:

ISBN 10: 364217955X 

ISBN 13: 9783642179556

Author: Yongwha Chung; Moti Yung

This book constitutes the refereed proceedings of the 11th International Workshop on Information Security Applications, WISA 2010, held in Jeju Island, Korea, in August 2010. The 25 revised full papers presented were carefully reviewed and selected from 107 submissions. The papers are organized in topical sections on cryptosystem, implementation, mobile security/secure coding, attack, biometrics, and secure protocol.

Table of contents:

  1. Introduction
  2. Preliminaries
  3. Formal Models for Identity Based Encryption
  4. Security Notion of IBE Scheme
  5. Formal Models for Identity Based Signature
  6. Security Notion of IBS Scheme
  7. Formal Models for Identity Based Signcryption
  8. Security Notion of IBSC Scheme
  9. Proposed Scheme
  10. Security
  11. Message Cofidentiality
  12. Ciphertext Unforgeability
  13. Efficiency
  14. Comparisons
  15. References
  16. Predicate-Based Authenticated Key Exchange Resilient to Ephemeral Key Leakage
  17. Introduction
  18. Motivation
  19. Contribution
  20. eCK Security Model for Predicate-Based AKE
  21. Proposed Two-Pass Attribute-Based AKE Protocol
  22. Assumption
  23. Access Tree
  24. Proposed Two-Pass Attribute-Based AKE Protocol
  25. Security
  26. Conclusion
  27. References
  28. A New Efficient Construction for Non-Malleable Zero-Knowledge Sets
  29. Introduction
  30. Background
  31. Our Contributions
  32. Road Map
  33. Preliminaries
  34. Notations
  35. Definitions
  36. Zero-Knowledge Sets
  37. Non-malleability for ZKS
  38. Constructions
  39. Assumptions and Build Blocks
  40. Construction of ACCUMU-ZKS
  41. References
  42. Distributed Paillier Cryptosystem without Trusted Dealer
  43. Introduction
  44. Building Blocks
  45. Threshold Paillier Cryptosystem
  46. Secret Sharing over the Integers
  47. Pedersen's VSS over the Integers
  48. DKG Protocol for RSA Modulus Generation
  49. High-Level Overview of [5]
  50. Distributed Computation of RSA Modulus $N$ by BGW Protocol
  51. Distributed Biprimality Test for $N$
  52. Relaxing Condition on Safe Primes
  53. How to Check a Prime Candidate with Trial Division
  54. Threshold Paillier without Trusted Dealer
  55. References
  56. Implementation
  57. Fast Scalar Multiplication for ECC over GF($p$) Using Division Chains
  58. Introduction
  59. Addition Chains
  60. Representations from Division Chains
  61. Choosing the Base Set $B$
  62. Choosing the Digit Set $D$
  63. Optimising the Representation
  64. The Detailed Cost Function
  65. A Markov Process
  66. Test Results and Evaluation
  67. Conclusion
  68. References
  69. Design of a Novel Pseudo-Random Generator Based on Vectorial FCSRs
  70. Introduction
  71. Recalling the FCSR Automaton
  72. Binary FCSRs
  73. Description of the Automaton[7][8]
  74. Transition Function
  75. Vectorial FCSR Theoritical
  76. VFCSR Automaton
  77. Description of the Automaton
  78. Transition Function
  79. New Conception Analysis
  80. Randomness Property of Galois VFCSR
  81. Appearance of Equivalence
  82. Stream Cipher Conception
  83. Proposed Parameters
  84. Design of the Filter
  85. Pseudorandom Data Extraction
  86. Conclusion and Future Work
  87. References
  88. Low-Resource Hardware Design of an Elliptic Curve Processor for Contactless Devices
  89. Introduction
  90. System Overview
  91. Why Are Prime Fields Used as Underlying Fields?
  92. Is a Microprocessor Required?
  93. Why Is a Custom Designed Microprocessor Necessary?
  94. Why Is the Signature Verification Algorithm Implemented?
  95. Implemented Algorithms
  96. Scalar Point Multiplication
  97. Finite-Field Arithmetic
  98. Hardware Architecture
  99. Results
  100. Conclusion
  101. References
  102. A Design Procedure for Oscillator-Based Hardware Random Number Generator with Stochastic Behavior Mo
  103. Introduction
  104. Proposed HRNG Design Procedure
  105. Proposed Stochastic Behavior Model
  106. Behavior Model of Oscillator-Based HRNG
  107. Model Construction and Usage
  108. Model Validation with Hardware Measurement
  109. Design Space Exploration with Proposed Model
  110. Randomness Evaluation under Deterministic Noise
  111. Simulation Method
  112. Simulation Results
  113. Implication from Simulation Results
  114. Conclusion
  115. References
  116. Mobile Security/Secure Coding
  117. Using Special Use Cases for Security in the Software Development Life Cycle
  118. Introduction
  119. Overview of Security in the SDLC
  120. RUP – The Software Development Life Cycle
  121. Inception and Use Case Model
  122. Security in RUP
  123. Special Use Case Model
  124. Misuse Case
  125. Security Use Case
  126. Obligation Use Case
  127. Extending the SDLC with Special Use Cases
  128. Use Case – Obligation Use Case and Misuse Case Identification
  129. Refinement
  130. Next Steps
  131. Lesson Learned
  132. Conclusion
  133. References
  134. Efficient and Optimally Secure In-Network Aggregation in Wireless Sensor Networks
  135. Introduction
  136. Related Work
  137. Preliminaries
  138. Requirements
  139. Network Assumptions
  140. Security Infrastructure
  141. Adversary Model
  142. The CPS Protocol
  143. Protocol Description
  144. Drawbacks
  145. Checking Mechanism
  146. Our Protocol
  147. Underlying Idea
  148. The Format of Message
  149. Protocol Description
  150. Analysis
  151. Security
  152. Congestion Complexity
  153. Communication Complexity
  154. Computational and Storage Costs
  155. Other Operations
  156. Conclusion
  157. References
  158. An IP Traceback Mechanism against Mobile Attacker for IPv6 and PMIPv6
  159. Introduction
  160. Background
  161. Relevant Traceback Mechanisms
  162. Overview of Proxy MIPv6
  163. Proposal for Traceback Mechanism in IPv6 and PMIPv6 Environment
  164. Traceback Message Structure of Proposed Mechanism
  165. Attack Path Reconstruction Process
  166. Analysis and Comparison
  167. Conclusion
  168. References
  169. Hidden Credential Retrieval without Random Oracles
  170. Introduction
  171. Related Work
  172. Our Contribution
  173. Preliminary
  174. Outlining HCR
  175. Bilinear Groups
  176. Assumptions
  177. Security Requirements
  178. Oracles for Validity Tests
  179. Outsider Security
  180. Insider Security
  181. The Proposed HCR Scheme
  182. Protocol Construction
  183. Security of the Proposed HCR
  184. Conclusion
  185. References
  186. Attack
  187. Combined Side-Channel Attacks
  188. Introduction
  189. Combined Attacks and Metrics Based on Multiple Partitions
  190. Information Theoretic Metric
  191. Template Attacks
  192. Sensitive Variables
  193. Conditional Entropy
  194. Combined Correlation Attacks
  195. Techniques for Revealing the POIs
  196. Combining Time Samples
  197. Conclusion and Perspectives
  198. References
  199. Correlation Power Analysis Based on Switching Glitch Model
  200. Introduction
  201. Background
  202. CPA Attacks
  203. Leakage Models
  204. SG Model
  205. Preliminaries
  206. The New Leakage Model
  207. Measurement Setup
  208. Experiments
  209. CPA without Glitches
  210. CPA with Glitches
  211. Conclusions
  212. References
  213. Vulnerabilities of Wireless Key Exchange Based on Channel Reciprocity
  214. Introduction
  215. Previous Work
  216. The Key Exchange Protocol and Security Guarantees
  217. Reradiation Side-Channel
  218. Validation Using Anechoic Chamber
  219. Experiment Setup
  220. Discussion
  221. Conclusions
  222. References
  223. Collusion Attack on a Self-healing Key Distribution with Revocation in Wireless Sensor Networks
  224. Introduction
  225. Overview of the Du-He Scheme
  226. Security Definitions
  227. Review of the Du-He Scheme
  228. Collusion Attack
  229. Improvement
  230. Analysis of the Modified Scheme
  231. Self-healing Property
  232. Forward Secrecy
  233. Backward Secrecy
  234. Resistance to a Collusion Attack
  235. Efficiency
  236. Conclusions
  237. References
  238. Full-Round Differential Attack on TWIS Block Cipher
  239. Introduction
  240. Descriptions of TWIS and G-TWIS
  241. Notation
  242. Encryption Procedure of TWIS
  243. Encryption Procedure of G-TWIS
  244. 10-Round Differential Distinguishers for TWIS
  245. $n$-Round Differential Distinguisher for G-TWIS
  246. Summary
  247. References
  248. Improved Trace-Driven Cache-Collision Attacks against Embedded AES Implementations
  249. Introduction
  250. Generalities and Previous Work
  251. Caching and Performance
  252. Cache-Based Attacks against AES
  253. Notation
  254. Adaptive Chosen Plaintext Attack
  255. Improved Chosen Plaintext Attack
  256. Known Plaintext Attack
  257. Analysis of the First AES Round
  258. Analysis of the Second AES Round
  259. Dealing with Detection Errors
  260. Practical Explorations
  261. General Approach to Distinguishing Cache Events
  262. Error-Tolerant Improved Adaptive Chosen Plaintext Attack
  263. Error-Tolerant Known Plaintext Attack
  264. Attacks with Partially Pre-loaded Cache
  265. Conclusion
  266. References
  267. Combination of SW Countermeasure and CPU Modification on FPGA against Power Analysis
  268. Introduction
  269. Vulnerable Operation against Power Analysis in SW Implementations
  270. Countermeasures against Power Analysis to Vulnerability of Branch Operation
  271. SW-Level Countermeasures against Power Analysis
  272. HW-Level Countermeasure against Power Analysis
  273. Case Study of Algorithm by Coron et al.
  274. Vulnerability in Algorithm by Coron et al. against Power Analysis
  275. Our Countermeasures to Algorithm by Coron et al.
  276. Results of Our Evaluation Experiment
  277. Experimental Environment
  278. Experimental Result without Countermeasures
  279. Experimental Result with the Branch Treatment
  280. Experimental Result with Adding the Address Randomization
  281. Experimental Result with Adding the Processor Modification
  282. Comparison of Security, Cost and Performance
  283. Security Evaluation of Masking Version
  284. Investigation of Changes in Bias, Cost and Performance
  285. Conclusion
  286. References
  287. Biometrics
  288. Face Image Retrieval Using Sparse Representation Classifier with Gabor-LBP Histogram
  289. Introduction
  290. Face Representation with Gabor-LBP Histogram
  291. Face Retrieval Based on Sparse Representation Classifier
  292. Experimental Results
  293. Conclusions
  294. References
  295. Fingerprint Liveness Detection Based on Multiple Image Quality Features
  296. Introduction
  297. Proposed Method
  298. Fingerprint Texture Analysis and Quality Hypothesis
  299. Live Sample-Based Calibration
  300. Feature Extraction
  301. Experiments and Discussions
  302. Conclusions
  303. References
  304. Robust Feature Extraction for Facial Image Quality Assessment
  305. Introduction
  306. Face Detection
  307. Eye Detection
  308. Circular Filter
  309. Eye Center Detection
  310. Lip Feature Detection
  311. Lip Map Construction
  312. Mouth Corner Detection
  313. Upper/Lower Lip Detection
  314. Experimental Results
  315. Conclusions
  316. References
  317. Secure Protocol
  318. Round-Optimal Deniable Ring Authentication in the Presence of Big Brother
  319. Introduction
  320. Motivation
  321. Background
  322. Outline of the Paper
  323. Preliminaries
  324. Deniable Ring Authentication
  325. Broadcast Encryption
  326. Verifiability in Broadcast Encryption Schemes
  327. The Bilinear Diffie-Hellman Exponent Assumption
  328. Previous Work: Naor's Scheme
  329. Naor's Idea
  330. Modified Naor's Scheme from Broadcast Encryption
  331. Our Scheme
  332. Discussion: Essential Problem of the Naive Scheme
  333. Our Scheme
  334. Security of the Protocol
  335. Efficient Implementation from BGW Protocol
  336. BGW Protocol
  337. Implementing Our Protocol from BGW
  338. A Drawback of This Scheme
  339. Conclusion
  340. References
  341. Cross-Realm Password-Based Server Aided Key Exchange
  342. Introduction
  343. Prior Related Works
  344. Our Contribution
  345. Insecurity of Previous Schemes
  346. Attacks on the YB Scheme
  347. Attacks on the WZ Construction
  348. New Model: Cross-Realm PSAKE Security
  349. Cross-Realm C2C-PAKE and PSAKE
  350. Adversary Capabilities
  351. Indistinguishability
  352. Password Protection
  353. Mutual Authentication
  354. Proposed Scheme
  355. Notation
  356. Design Principles
  357. Security of Our Scheme
  358. Building Blocks
  359. Main Theorems
  360. Conclusion
  361. References
  362. A Two-Party Protocol with Trusted Initializer for Computing the Inner Product
  363. Introduction
  364. The Universal Composability Framework
  365. The Inner Product Protocol
  366. Protocol Specification and Notation
  367. Ideal Functionality for the Inner Product
  368. Trusted Initializer Functionality
  369. Protocol Implementation
  370. Security Proof
  371. Alice Corrupted, Bob Honest
  372. Alice Honest, Bob Corrupted
  373. Alice and Bob Honest
  374. Alice and Bob Corrupted
  375. Solving Linear Equations
  376. Ideal Functionality
  377. Protocol Implementation
  378. Security Proof
  379. Alice Corrupted, Bob Honest
  380. Alice Honest, Bob Corrupted
  381. Alice and Bob Honest
  382. Alice and Bob Corrupted

People also search:

social security application international students

international security after 9/11

information security and intelligence

information 9/11

information security architect interview questions

Tags: Yongwha Chung, Moti Yung, Information, Applications, Workshop

Related Products