Progress in Cryptology - INDOCRYPT 2009 : 10th International Conference on Cryptology in India, New Delhi, India, December 13-16, 2009, Proceedings - Bimal Kumar Roy

Progress in Cryptology - INDOCRYPT 2009

10th International Conference on Cryptology in India, New Delhi, India, December 13-16, 2009, Proceedings

By: Bimal Kumar Roy (Editor), Nicolas Sendrier (Editor)

Paperback | 24 November 2009

At a Glance

Paperback


$84.99

or 4 interest-free payments of $21.25 with

 or 

Ships in 5 to 7 business days

Post-Quantum Cryptology.- Secure Parameters for SWIFFT.- FSBday.- Key Agreement Protocols.- Reusing Static Keys in Key Agreement Protocols.- A Study of Two-Party Certificateless Authenticated Key-Agreement Protocols.- Side Channel Attacks.- Fault Analysis of Rabbit: Toward a Secret Key Leakage.- On Physical Obfuscation of Cryptographic Algorithms.- Cache Timing Attacks on Clefia.- Symmetric Cryptology.- Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode.- On the Symmetric Negabent Boolean Functions.- Improved Meet-in-the-Middle Attacks on AES.- Hash Functions.- Related-Key Rectangle Attack of the Full HAS-160 Encryption Mode.- Second Preimage Attack on SHAMATA-512.- Towards Secure and Practical MACs for Body Sensor Networks.- Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions.- A Distinguisher for the Compression Function of SIMD-512.- Number Theoretic Cryptology.- Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree.- Software Implementation of Pairing-Based Cryptography on Sensor Networks Using the MSP430 Microcontroller.- A New Hard-Core Predicate of Paillier's Trapdoor Function.- Lightweight Cryptology.- Private Interrogation of Devices via Identification Codes.- RFID Distance Bounding Multistate Enhancement.- Two Attacks against the F f RFID Protocol.- Signature Protocols.- Efficient Constructions of Signcryption Schemes and Signcryption Composability.- On Generic Constructions of Designated Confirmer Signatures.- Verifiably Encrypted Signatures from RSA without NIZKs.- Identity Based Aggregate Signcryption Schemes.- Multiparty Computation.- Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.- Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems.- Oblivious Multi-variate Polynomial Evaluation.

More in Mathematical Theory of Computation

Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$129.75

13%
OFF
AI Engineering : Building Applications with Foundation Models - Chip Huyen
Foundation Mathematics - K. A. Stroud

RRP $128.99

$109.99

15%
OFF
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz
AI Value Creators : Beyond the Generative AI User Mindset - Dario Gil
Applied Mathematics with F# - Sudipta Mukherjee
Hands-On Generative AI with Transformers and Diffusion Models - Apolinario Passos
Practical Weak Supervision : Doing More with Less Data - Amit Bahree