|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Colin Boyd , Juan González NietoPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2009 ed. Volume: 5594 Dimensions: Width: 15.50cm , Height: 2.50cm , Length: 23.50cm Weight: 0.735kg ISBN: 9783642026195ISBN 10: 3642026192 Pages: 470 Publication Date: 15 June 2009 Audience: College/higher education , Professional and scholarly , Postgraduate, Research & Scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsInvited Lecture.- Is the Information Security King Naked?.- Network Security.- Measurement Study on Malicious Web Servers in the .nz Domain.- A Combinatorial Approach for an Anonymity Metric.- On Improving the Accuracy and Performance of Content-Based File Type Identification.- Symmetric Key Encryption.- Attacking 9 and 10 Rounds of AES-256.- Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network Structure.- Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT.- Improved Cryptanalysis of the Common Scrambling Algorithm Stream Cipher.- Testing Stream Ciphers by Finding the Longest Substring of a Given Density.- New Correlations of RC4 PRGA Using Nonzero-Bit Differences.- Hash Functions.- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders.- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security.- Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256.- Inside the Hypercube.- Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others.- On the Weak Ideal Compression Functions.- Invited Lecture.- Hardening the Network from the Friend Within.- Public Key Cryptography.- Reducing the Complexity in the Distributed Computation of Private RSA Keys.- Efficiency Bounds for Adversary Constructions in Black-Box Reductions.- Building Key-Private Public-Key Encryption Schemes.- Multi-recipient Public-Key Encryption from Simulators in Security Proofs.- Fair Threshold Decryption with Semi-Trusted Third Parties.- Conditional Proxy Broadcast Re-Encryption.- Security on Hybrid Encryption with the Tag-KEM/DEM Framework.- Protocols.- A Highly Scalable RFID Authentication Protocol.- Strengthening the Securityof Distributed Oblivious Transfer.- Towards Denial-of-Service-Resilient Key Agreement Protocols.- A Commitment-Consistent Proof of a Shuffle.- Implementation.- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography.- Random Order m-ary Exponentiation.- Jacobi Quartic Curves Revisited.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |