Item type Location Call Number Status Date Due
E-Book E-Book AUM Main Library 005.82 (Browse Shelf) Not for loan

Bits and Booleans -- Semi-bent Functions from Oval Polynomials -- Efficient Generation of Elementary Sequences -- Homomorphic Encryption -- On the Homomorphic Computation of Symmetric Cryptographic Primitives -- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme -- On the Relationship between Functional Encryption, Obfuscation and Fully Homomorphic Encryption -- Codes and Applications -- On Minimal and Quasi-minimal Linear Codes -- A Code-Based Undeniable Signature Scheme -- Cryptanalysis -- Filtered Nonlinear Cryptanalysis of Reduced-Round Serpent and the Wrong-Key Randomization Hypothesis -- Differential Cryptanalysis of Keccak Variants -- Recovering Private Keys Generated with Weak PRNGs -- Protecting against Leakage -- A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme -- High-Order Masking by Using Coding Theory and Its Application to AES -- Hash Functions -- Hashing Mode Using a Lightweight Blockcipher -- Indifferentiability of Double Length Compression Functions -- Security Amplification against Meet-in-the-Middle Attacks Using Whitening -- Key Issues -- Secure Key Management in the Cloud -- Estimating Key Sizes for High Dimensional Lattice-Based Systems -- Sub-linear Blind Ring Signatures without Random Oracles -- Constructions of Signcryption in the Multi-user Setting from Identity-Based Encryption -- Anonymous Constant-Size Ciphertext HIBE from Asymmetric Pairings.

This book constitutes the proceedings of the 14th IMA International Conference on Cryptography and Coding, IMACC 2013, held at Oxford, UK, in December 2013. The 20 papers presented were carefully reviewed and selected for inclusion in this book. They are organized in topical sections named: bits and booleans; homomorphic encryption; codes and applications; cryptanalysis; protecting against leakage; hash functions; key issues and public key primitives.

There are no comments for this item.

Log in to your account to post a comment.