Lin / Zhou / Yung | Information Security and Cryptology | Buch | 978-3-319-16744-2 | sack.de

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

Reihe: Security and Cryptology

Lin / Zhou / Yung

Information Security and Cryptology

10th International Conference, Inscrypt 2014, Beijing, China, December 13-15, 2014, Revised Selected Papers
2015
ISBN: 978-3-319-16744-2
Verlag: Springer International Publishing

10th International Conference, Inscrypt 2014, Beijing, China, December 13-15, 2014, Revised Selected Papers

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

Reihe: Security and Cryptology

ISBN: 978-3-319-16744-2
Verlag: Springer International Publishing


This book constitutes the thoroughly refereed post-conference proceedings of the 10th International Conference on Information Security and Cryptology, Inscrypt 2014, held in Beijing, China, in December 2014. The 29 revised full papers presented were carefully reviewed and selected from 93 submissions. The papers are organized in topical sections on privacy and anonymity, multiparty and outsource computation, signature and security protocols, lattice and public key cryptography, block cipher and hash function, authentication and encryption, elliptic curve, and cryptographic primitive and application.
Lin / Zhou / Yung Information Security and Cryptology jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


An Efficient Privacy-Preserving E-coupon System.- Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications.- Security of Direct Anonymous Authentication Using TPM 2.0 Signature.- Revocation in Publicly Verifiable Outsourced Computation.- Private Aggregation with Custom Collusion Tolerance.- Ring Signatures of Constant Size Without Random Oracles.- Universally Composable Identity Based Adaptive Oblivious Transfer with Access Control.- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge.- A Model-Driven Security Requirements Approach to Deduce Security Policies Based on OrBAC.- Optimal Proximity Proofs.- Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions.- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization.- Fully Homomorphic Encryption with Auxiliary Inputs.- Trapdoors for Ideal Lattices with Applications.- Speeding Up the Search Algorithm for the Best Differential and Best Linear Trails.- The Boomerang Attacks on BLAKE and BLAKE2.- Second Preimage Analysis of Whirlwind.- Boomerang Attack on Step-Reduced SHA-512.- Collision Attack on 4-Branch, Type-2 GFN Based Hash Functions Using Sliced Biclique Cryptanalysis Technique.- Rig: A Simple, Secure and Flexible Design for Password Hashing.- Efficient Hardware Accelerator for AEGIS-128 Authenticated Encryption.- Fully Collusion-Resistant Traceable Key-Policy Attribute-Based Encryption with Sub-linear Size Ciphertexts.- Integrating Ciphertext-Policy Attribute-Based Encryption with Identity-Based Ring Signature to Enhance Security and Privacy in Wireless Body Area Networks.- Parallelized Software Implementation of Elliptic Curve Scalar Multiplication.- A Note on Diem’s Proof.- Stand-by Attacks on E-ID Password Authentication.- Stegomalware: Playing Hide and Seek with Malicious Components in Smartphone Apps.- A Lightweight Security Isolation Approach for Virtual Machines Deployment.- A Novel Approach to True Random NumberGeneration in Wearable Computing Environments Using MEMS Sensors.



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.