International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - ASIACRYPT 2005, 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, December 4-8, 2005, Proceedings

Page	Title
1-20	Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
21-40	Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
41-58	Adapting Density Attacks to Low-Weight Knapsacks
59-78	Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
79-99	Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
100-120	Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations
121-135	Revealing Additional Information in Two-Party Computations
136-155	Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
156-173	Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
174-198	Updatable Zero-Knowledge Databases
199-216	Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
217-235	Quantum Anonymous Transmissions
236-252	Privacy-Preserving Graph Algorithms in the Semi-honest Model
253-272	Spreading Alerts Quietly and the Subgroup Escape Problem
273-292	A Sender Verifiable Mix-Net and a New Proof of a Shuffle
293-312	Universally Anonymizable Public-Key Encryption
313-332	Fast Computation of Large Distributions and Its Cryptographic Applications
333-352	An Analysis of the XSL Algorithm
353-372	New Applications of Time Memory Data Tradeoffs
373-394	Linear Cryptanalysis of the TSC Family of Stream Ciphers
395-411	A Practical Attack on the Fixed RC4 in the WEP Mode
412-424	A Near-Practical Attack Against B Mode of HBB
425-442	New Improvements of Davies-Murphy Cryptanalysis
443-461	A Related-Key Rectangle Attack on the Full KASUMI
462-473	Some Attacks Against a Double Length Hash Proposal
474-494	A Failure-Friendly Design Principle for Hash Functions
495-514	Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application
515-532	Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
533-548	Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
549-565	Modular Security Proofs for Key Agreement Protocols
566-584	A Simple Threshold Authenticated Key Exchange from Short Secrets
585-604	Examining Indistinguishability-Based Proof Models for Key Establishment Protocols
605-623	Server-Aided Verification: Theory and Practice
624-643	Errors in Computational Complexity Proofs for Protocols
644-661	Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature)
662-681	Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs
682-701	Universally Convertible Directed Signatures