Chee / Park | Information Security and Cryptology - ICISC 2004 | Buch | 978-3-540-26226-8 | sack.de

Buch, Englisch, 490 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1570 g

Reihe: Security and Cryptology

Chee / Park

Information Security and Cryptology - ICISC 2004

7th International Conference, Seoul, Korea, December 2-3, 2004, Revised Selected Papers

Buch, Englisch, 490 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1570 g

Reihe: Security and Cryptology

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


This book constitutes the thoroughly refereed postproceedings of the 7th International Conference on Information Security and Cryptology, ICISC 2004, held in Seoul, Korea in December 2004.

The 34 revised full papers presented have gone through two rounds of reviewing and improvement and were selected from 194 submissions. The papers are organized in topical sections on block ciphers and stream ciphers, public key cryptosystems, PKI and related implementations, digital signatures, elliptic curve cryptosystems, provable security and primitives, network security, steganography, and biometrics.
Chee / Park Information Security and Cryptology - ICISC 2004 jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Invited Talks.- Security by, and for, Converged Mobile Devices.- Security for Ubiquitous Computing.- Block Cipher and Stream Cipher.- Algebraic Attacks on Combiners with Memory and Several Outputs.- New Method for Bounding the Maximum Differential Probability for SPNs and ARIA.- Dragon: A Fast Word Based Stream Cipher.- Public Key Cryptosystem.- An Efficient and Verifiable Solution to the Millionaire Problem.- All in the XL Family: Theory and Practice.- Efficient Broadcast Encryption Using Multiple Interpolation Methods.- On Private Scalar Product Computation for Privacy-Preserving Data Mining.- PKI and Related Implementation.- Separable Implicit Certificate Revocation.- Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation.- Improvement on Ha-Moon Randomized Exponentiation Algorithm.- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields.- Digital Signature.- On Subliminal Channels in Deterministic Signature Schemes.- Threshold Entrusted Undeniable Signature.- On the Security Models of (Threshold) Ring Signature Schemes.- Identity Based Threshold Ring Signature.- Batch Verifications with ID-Based Signatures.- Elliptic Curve Cryptosystem.- A Method for Distinguishing the Two Candidate Elliptic Curves in CM Method.- Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations.- New Families of Hyperelliptic Curves with Efficient Gallant-Lambert-Vanstone Method.- Some Improved Algorithms for Hyperelliptic Curve Cryptosystems Using Degenerate Divisors.- Provable Security and Primitives.- On the Pseudorandomness of a Modification of KASUMI Type Permutations.- Provably Secure Double-Block-Length Hash Functions in a Black-Box Model.- Padding Oracle Attacks on Multiple Modes of Operation.- An Evolutionary Algorithm to Improve the Nonlinearity of Self-inverse S-Boxes.- Network Security.- Identity-Based Access Control for Ad Hoc Groups.- Mobile Mixing.- A Location-Aware Secure Interworking Architecture Between 3GPP and WLAN Systems.- ADWICE – Anomaly Detection with Real-Time Incremental Clustering.- Steganography.- Steganography for Executables and Code Transformation Signatures.- On Security Notions for Steganalysis.- A Block Oriented Fingerprinting Scheme in Relational Database.- Biometrics.- A Study on Evaluating the Uniqueness of Fingerprints Using Statistical Analysis.- Profile-Based 3D Face Registration and Recognition.


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.