Cheon / Lee | Information Security and Cryptoloy - ICISC 2008 | Buch | 978-3-642-00729-3 | sack.de

Buch, Englisch, Band 5461, 433 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 674 g

Reihe: Lecture Notes in Computer Science

Cheon / Lee

Information Security and Cryptoloy - ICISC 2008

11th International Conference, Seoul, Korea, December 3-5, 2008, Revised Selected Papers
2009
ISBN: 978-3-642-00729-3
Verlag: Springer

11th International Conference, Seoul, Korea, December 3-5, 2008, Revised Selected Papers

Buch, Englisch, Band 5461, 433 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 674 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-642-00729-3
Verlag: Springer


This book constitutes the refereed proceedings of the 11th International Conference on Information Security and Cryptology, ICISC 2008, held in Seoul, Korea, during December 3-5, 2008. The 26 revised full papers presented have gone through two rounds of reviewing and improvement and were carefully selected from 131 submissions. The papers are organized in topical sections on public key encryption, key management and secret sharing, privacy and digital rights, digital signature and voting, side channel attack, hash and mac, primitives and foundations, as well as block and stream ciphers.
Cheon / Lee Information Security and Cryptoloy - ICISC 2008 jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Public Key Encryption.- Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption.- Distributed Attribute-Based Encryption.- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors.- Simple Algorithms for Computing a Sequence of 2-Isogenies.- Key Management and Secret Sharing.- Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks.- Visual Secret Sharing Schemes with Cyclic Access Structure for Many Images.- Privacy and Digital Rights.- The Swiss-Knife RFID Distance Bounding Protocol.- Protecting Location Privacy through a Graph-Based Location Representation and a Robust Obfuscation Technique.- Anonymous Fingerprinting for Predelivery of Contents.- Instruction Set Limitation in Support of Software Diversity.- Digital Signature and Voting.- Non-interactive Identity-Based DNF Signature Scheme and Its Extensions.- How to Balance Privacy with Authenticity.- Efficient Vote Validity Check in Homomorphic Electronic Voting.- Side Channel Attack.- Secure Hardware Implementation of Non-linear Functions in the Presence of Glitches.- Novel PUF-Based Error Detection Methods in Finite State Machines.- Partition vs. Comparison Side-Channel Distinguishers: An Empirical Evaluation of Statistical Tests for Univariate Side-Channel Attacks against Two Unprotected CMOS Devices.- Hash and MAC.- A Single-Key Domain Extender for Privacy-Preserving MACs and PRFs.- Extended Models for Message Authentication.- A Preimage Attack for 52-Step HAS-160.- Primitives and Foundations.- Essentially Optimal Universally Composable Oblivious Transfer.- Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification.- Proving a Shuffle Using Representations of the SymmetricGroup.- On Formal Verification of Arithmetic-Based Cryptographic Primitives.- Block and Stream.- A New Technique for Multidimensional Linear Cryptanalysis with Applications on Reduced Round Serpent.- Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis.- Higher Order Differential Attacks on Reduced-Round MISTY1.



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.