Kim / Won | Information Security and Cryptology - ICISC 2005 | Buch | 978-3-540-33354-8 | sack.de

Buch, Englisch, Band 3935, 458 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1470 g

Reihe: Lecture Notes in Computer Science

Kim / Won

Information Security and Cryptology - ICISC 2005

8th International Conference, Seoul, Korea, December 1-2, 2005, Revised Selected Papers
2006
ISBN: 978-3-540-33354-8
Verlag: Springer Berlin Heidelberg

8th International Conference, Seoul, Korea, December 1-2, 2005, Revised Selected Papers

Buch, Englisch, Band 3935, 458 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1470 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-33354-8
Verlag: Springer Berlin Heidelberg


This book constitutes the thoroughly refereed postproceedings of the 8th International Conference on Information Security and Cryptology, ICISC 2005. The 32 revised full papers presented together with two invited talks are organized in topical sections on key management and distributed cryptography, authentication and biometrics, provable security and primitives, system and network security, block ciphers and stream ciphers, efficient implementations, digital rights management, and public key cryptography.

Kim / Won Information Security and Cryptology - ICISC 2005 jetzt bestellen!

Zielgruppe


Research


Autoren/Hrsg.


Weitere Infos & Material


Invited Talks.- National Security, Forensics and Mobile Communications.- Information Security as Interdisciplinary Science Based on Ethics.- Key Management and Distributed Cryptography.- A Timed-Release Key Management Scheme for Backward Recovery.- Property-Based Broadcast Encryption for Multi-level Security Policies.- Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption.- Authentication and Biometrics.- An Enhanced Estimation Algorithm for Reconstructing Fingerprint Strip Image.- Trust Management for Resilient Wireless Sensor Networks.- Improvements to Mitchell’s Remote User Authentication Protocol.- Efficient Authenticators with Application to Key Exchange.- Provable Security and Primitives.- Benes and Butterfly Schemes Revisited.- Relative Doubling Attack Against Montgomery Ladder.- Improved Collision Attack on MD4 with Probability Almost 1.- Finding Collision on 45-Step HAS-160.- System/Network Security.- The Program Counter Security Model: Automatic Detection and Removal of Control-Flow Side Channel Attacks.- The Dilemma of Covert Channels Searching.- A Probabilistic Approach to Estimate the Damage Propagation of Cyber Attacks.- Foundations of Attack Trees.- Block/Stream Ciphers (I).- An Algebraic Masking Method to Protect AES Against Power Attacks.- Characterisations of Extended Resiliency and Extended Immunity of S-Boxes.- Integral Cryptanalysis of Reduced FOX Block Cipher.- Hybrid Symmetric Encryption Using Known-Plaintext Attack-Secure Components.- Block/Stream Ciphers (II).- Cryptanalysis of Sfinks.- Weaknesses of COSvd (2,128) Stream Cipher.- Expanding Weak PRF with Small Key Size.- On Linear Systems of Equations with Distinct Variables and Small Block Size.- Efficient Implementations.- An FPGA Implementation of CCM Mode UsingAES.- New Architecture for Multiplication in GF(2 m ) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography.- An Efficient Design of CCMP for Robust Security Network.- Digital Rights Management.- Software-Based Copy Protection for Temporal Media During Dissemination and Playback.- Ambiguity Attacks on the Ganic-Eskicioglu Robust DWT-SVD Image Watermarking Scheme.- Public Key Cryptography.- Universal Custodian-Hiding Verifiable Encryption for Discrete Logarithms.- An Efficient Static Blind Ring Signature Scheme.- Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model.- Yet Another Forward Secure Signature from Bilinear Pairings.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.