Invited Talks | |
The Arithmetic Codex: Theory and Applications (Abstract) | p. 1 |
Lattice Reduction Algorithms: Theory and Practice | p. 2 |
Lattice-Based Cryptography | |
Efficient Authentication from Hard Learning Problems | p. 7 |
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices | p. 27 |
Implementation and Side Channels | |
Faster Explicit Formulas for Computing Pairings over Ordinary Curves | p. 48 |
Pushing the Limits: A Very Compact and a Threshold Implementation of AES | p. 69 |
Fully Leakage-Resilient Signatures | p. 89 |
A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices | p. 109 |
Homomorphic Cryptography | |
Implementing Gentry's Fully-Homomorphic Encryption Scheme | p. 129 |
Homomorphic Signatures for Polynomial Functions | p. 149 |
Semi-homomorphic Encryption and Multiparty Computation | p. 169 |
Signature Schemes | |
Tight Proofs for Signature Schemes without Random Oracles | p. 189 |
Adaptive Pseudo-free Groups and Applications | p. 207 |
Commuting Signatures and Verifiable Encryption | p. 224 |
Information-Theoretic Cryptography | |
Secure Authentication from a Weak Key, without Leaking Information | p. 246 |
Secret Keys from Channel Noise | p. 266 |
Almost Optimum t-Cheater Identifiable Secret Sharing Schemes | p. 284 |
Symmetric Key Cryptography | |
On Linear Hulls, Statistical Saturation Attacks, Present and a Cryptanalysis of Puffin | p. 303 |
Domain Extension for MACs Beyond the Birthday Barrier | p. 323 |
Attacks and Algorithms | |
Statistical Attack on RC4: Distinguishing WPA | p. 343 |
Improved Generic Algorithms for Hard Knapsacks | p. 364 |
Secure Computation | |
Two-Output Secure Computation with Malicious Adversaries | p. 386 |
Efficient Non-interactive Secure Computation | p. 406 |
Towards a Game Theoretic View of Secure Computation | p. 426 |
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption | p. 446 |
Composability | |
Concurrent Composition in the Bounded Quantum Storage Model | p. 467 |
Careful with Composition: Limitations of the Indifferentiability Framework | p. 487 |
Key Dependent Message Security | |
Efficient Circuit-Size Independent Public Key Encryption with KDM Security | p. 507 |
Key-Dependent Message Security: Generic Amplification and Completeness | p. 527 |
Public Key Encryption | |
Unbounded HIBE and Attribute-Based Encryption | p. 547 |
Decentralizing Attribute-Based Encryption | p. 568 |
Threshold and Revocation Cryptosystems via Extractable Hash Proofs | p. 589 |
Deniable Encryption with Negligible Detection Probability An Interactive Construction | p. 610 |
Author Index | p. 627 |
Table of Contents provided by Ingram. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.