International Association for Cryptologic Research

Publications by Conference

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

Preface and frontmatter

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