Publications of asiacrypt 2010

Page	Title
1-19	Rotational Rebound Attacks on Reduced Skein
20-37	Finding Second Preimages of Short Messages for Hamsi-256
38-55	Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl
56-75	Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2
76-93	Collision Attacks against the Knudsen-Preneel Compression Functions
94-111	Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions
112-129	The World Is Not Enough: Another Look on Second-Order DPA
130-145	Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems
146-157	A Byte-Based Guess and Determine Attack on SOSEMANUK
158-176	Improved Single-Key Attacks on 8-Round AES-192 and AES-256
177-194	Constant-Size Commitments to Polynomials and Their Applications
195-212	Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
213-231	Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
232-249	Generic Compilers for Authenticated Key Exchange
250-267	A Forward-Secure Symmetric-Key Derivation Protocol - How to Improve Classical DUKPT
268-282	Efficient String-Commitment from Weak Bit-Commitment
283-302	On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
303-320	Random Oracles with(out) Programmability
321-340	Short Pairing-Based Non-interactive Zero-Knowledge Arguments
341-358	Short Non-interactive Zero-Knowledge Proofs
359-376	Optimistic Concurrent Zero Knowledge
377-394	Faster Fully Homomorphic Encryption
395-412	A Group Signature Scheme from Lattice Assumptions
413-430	Lattice-Based Blind Signatures
431-447	The Round Complexity of Verifiable Secret Sharing: The Statistical Case
448-465	General Perfectly Secure Message Transmission Using Linear Codes
466-482	On Invertible Sampling and Adaptive Security
483-500	Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition
501-518	A Closer Look at Anonymity and Robustness in Encryption Schemes
519-538	Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
539-556	The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
557-576	The Degree of Regularity of HFE Systems
577-594	Structured Encryption and Controlled Disclosure
595-612	Leakage Resilient ElGamal Encryption
613-631	Efficient Public-Key Cryptography in the Presence of Key Leakage