Advances in Cryptology – ASIACRYPT 2008: 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings

Martin Hirt, Ueli Maurer, Vassilis Zikas (auth.), Josef Pieprzyk (eds.)3540892540, 9783540892540

This book constitutes the refereed proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2008, held in Melbourne, Australia, in December 2008.

The 33 revised full papers presented together with the abstract of 1 invited lecture were carefully reviewed and selected from 208 submissions. The papers are organized in topical sections on muliti-party computation, cryptographic protocols, cryptographic hash functions, public-key cryptograhy, lattice-based cryptography, private-key cryptograhy, and analysis of stream ciphers.

Table of contents :
Front Matter….Pages –
MPC vs. SFE : Unconditional and Computational Security….Pages 1-18
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes….Pages 19-36
Graph Design for Secure Multiparty Computation over Non-Abelian Groups….Pages 37-53
Some Perspectives on Complexity-Based Cryptography….Pages 54-54
A Modular Security Analysis of the TLS Handshake Protocol….Pages 55-73
Ambiguous Optimistic Fair Exchange….Pages 74-89
Compact Proofs of Retrievability….Pages 90-107
On the Security of HB # against a Man-in-the-Middle Attack….Pages 108-124
Hash Functions from Sigma Protocols and Improvements to VSH….Pages 125-142
Slide Attacks on a Class of Hash Functions….Pages 143-160
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography….Pages 161-178
Universally Composable Adaptive Oblivious Transfer….Pages 179-197
A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting….Pages 198-215
Towards Robust Computation on Encrypted Data….Pages 216-233
Efficient Protocols for Set Membership and Range Proofs….Pages 234-252
Preimage Attacks on 3, 4, and 5-Pass HAVAL….Pages 253-271
How to Fill Up Merkle-Damgård Hash Functions….Pages 272-289
Limits of Constructive Security Proofs….Pages 290-307
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption….Pages 308-325
Twisted Edwards Curves Revisited….Pages 326-343
On the Validity of the Φ -Hiding Assumption in Cryptographic Protocols….Pages 344-354
Chosen Ciphertext Security with Optimal Ciphertext Overhead….Pages 355-371
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems….Pages 372-389
Rigorous and Efficient Short Lattice Vectors Enumeration….Pages 390-405
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits….Pages 406-424
An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity….Pages 425-440
An Improved Impossible Differential Attack on MISTY1….Pages 441-454
Generalized Identity Based and Broadcast Encryption Schemes….Pages 455-470
Speeding Up the Pollard Rho Method on Prime Fields….Pages 471-488
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems….Pages 489-505
OAEP Is Secure under Key-Dependent Messages….Pages 506-523
Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks….Pages 524-538
A New Attack on the LEX Stream Cipher….Pages 539-556
Breaking the F-FCSR-H Stream Cipher in Real Time….Pages 557-569
Back Matter….Pages –