This book constitutes the refereed proceedings of the 12th International Conference on Cryptology in India, INDOCRYPT 2011, held in Chennai, India, in December 2011. The 22 revised full papers presented together with the abstracts of 3 invited talks and 3 tutorials were carefully reviewed and selected from 127 submissions. The papers are organized in topical sections on side-channel attacks, secret-key cryptography, hash functions, pairings, and protocols.
Author(s): Vinod Vaikuntanathan (auth.), Steven Galbraith, Mridul Nandi (eds.)
Series: Lecture Notes in Computer Science 7668
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012
Language: English
Pages: 566
Tags: Data Encryption; Computer Communication Networks; Algorithm Analysis and Problem Complexity; Management of Computing and Information Systems; Systems and Data Security; Discrete Mathematics in Computer Science
Front Matter....Pages -
How to Compute on Encrypted Data....Pages 1-15
From Multiple Encryption to Knapsacks – Efficient Dissection of Composite Problems....Pages 16-16
Using the Cloud to Determine Key Strengths....Pages 17-39
A Unified Characterization of Completeness and Triviality for Secure Function Evaluation....Pages 40-59
On the Non-malleability of the Fiat-Shamir Transform....Pages 60-79
Another Look at Symmetric Incoherent Optimal Eavesdropping against BB84....Pages 80-99
On-Line/Off-Line Leakage Resilient Secure Computation Protocols....Pages 100-119
Leakage Squeezing of Order Two....Pages 120-139
ROSETTA for Single Trace Analysis....Pages 140-155
Collision Attack on the Hamsi-256 Compression Function....Pages 156-171
Generalized Iterated Hash Fuctions Revisited: New Complexity Bounds for Multicollision Attacks....Pages 172-190
A Differential Fault Attack on the Grain Family under Reasonable Assumptions....Pages 191-208
Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs....Pages 209-224
Faster Chosen-Key Distinguishers on Reduced-Round AES ....Pages 225-243
The Higher-Order Meet-in-the-Middle Attack and Its Application to the Camellia Block Cipher....Pages 244-264
Double-SP Is Weaker Than Single-SP: Rebound Attacks on Feistel Ciphers with Several Rounds....Pages 265-282
Automatic Search of Truncated Impossible Differentials for Word-Oriented Block Ciphers....Pages 283-302
High-Speed Parallel Implementations of the Rainbow Method in a Heterogeneous System....Pages 303-316
Computing Small Discrete Logarithms Faster....Pages 317-338
Embedded Syndrome-Based Hashing....Pages 339-357
Compact Hardware Implementations of the Block Ciphers mCrypton, NOEKEON, and SEA....Pages 358-377
Efficient Arithmetic on Elliptic Curves in Characteristic 2....Pages 378-398
A New Model of Binary Elliptic Curves....Pages 399-411
Analysis of Optimum Pairing Products at High Security Levels....Pages 412-430
Constructing Pairing-Friendly Genus 2 Curves with Split Jacobian....Pages 431-453
Faster Batch Forgery Identification....Pages 454-473
Implementing CFS....Pages 474-488
SipHash: A Fast Short-Input PRF....Pages 489-508
A Novel Permutation-Based Hash Mode of Operation FP and the Hash Function SAMOSA ....Pages 509-527
Resistance against Adaptive Plaintext-Ciphertext Iterated Distinguishers....Pages 528-544
Sufficient Conditions on Padding Schemes of Sponge Construction and Sponge-Based Authenticated-Encryption Scheme....Pages 545-563
Back Matter....Pages -
