Proceedings of ASIACRYPT 2005

Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log., Pascal Paillier, Damien Vergnaud, pp. 1-20

 PDF BibTeX

Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?, David Jao, Stephen D. Miller, Ramarathnam Venkatesan, pp. 21-40

 PDF BibTeX

Adapting Density Attacks to Low-Weight Knapsacks., Phong Q. Nguyen, Jacques Stern, pp. 41-58

 PDF BibTeX

Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains., Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra, pp. 59-78

 PDF BibTeX

Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation., Martin Hirt, Jesper Buus Nielsen, pp. 79-99

 PDF BibTeX

Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations., Nuttapong Attrapadung, Hideki Imai, pp. 100-120

 PDF BibTeX

Revealing Additional Information in Two-Party Computations., Andreas Jakoby, Maciej Liskiewicz, pp. 121-135

 PDF BibTeX

Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation., Vladimir Kolesnikov, pp. 136-155

 PDF BibTeX

Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes., Zhifang Zhang, Mulan Liu, Liangliang Xiao, pp. 156-173

 PDF BibTeX

Updatable Zero-Knowledge Databases., Moses Liskov, pp. 174-198

 PDF BibTeX

Simple and Tight Bounds for Information Reconciliation and Privacy Amplification., Renato Renner, Stefan Wolf, pp. 199-216

 PDF BibTeX

Quantum Anonymous Transmissions., Matthias Christandl, Stephanie Wehner, pp. 217-235

 PDF BibTeX

Privacy-Preserving Graph Algorithms in the Semi-honest Model., Justin Brickell, Vitaly Shmatikov, pp. 236-252

 PDF BibTeX

Spreading Alerts Quietly and the Subgroup Escape Problem., James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy, pp. 253-272

 PDF BibTeX

A Sender Verifiable Mix-Net and a New Proof of a Shuffle., Douglas Wikström, pp. 273-292

 PDF BibTeX

Universally Anonymizable Public-Key Encryption., Ryotaro Hayashi, Keisuke Tanaka, pp. 293-312

 PDF BibTeX

Fast Computation of Large Distributions and Its Cryptographic Applications., Alexander Maximov, Thomas Johansson, pp. 313-332

 PDF BibTeX

An Analysis of the XSL Algorithm., Carlos Cid, Gaëtan Leurent, pp. 333-352

 PDF BibTeX

New Applications of Time Memory Data Tradeoffs., Jin Hong, Palash Sarkar, pp. 353-372

 PDF BibTeX

Linear Cryptanalysis of the TSC Family of Stream Ciphers., Frédéric Muller, Thomas Peyrin, pp. 373-394

 PDF BibTeX

A Practical Attack on the Fixed RC4 in the WEP Mode., Itsik Mantin, pp. 395-411

 PDF BibTeX

A Near-Practical Attack Against B Mode of HBB., Joydip Mitra, pp. 412-424

 PDF BibTeX

New Improvements of Davies-Murphy Cryptanalysis., Sébastien Kunz-Jacques, Frédéric Muller, pp. 425-442

 PDF BibTeX

A Related-Key Rectangle Attack on the Full KASUMI., Eli Biham, Orr Dunkelman, Nathan Keller, pp. 443-461

 PDF BibTeX

Some Attacks Against a Double Length Hash Proposal., Lars R. Knudsen, Frédéric Muller, pp. 462-473

 PDF BibTeX

A Failure-Friendly Design Principle for Hash Functions., Stefan Lucks, pp. 474-494

 PDF BibTeX

Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application., Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai, pp. 495-514

 PDF BibTeX

Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps., Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater, pp. 515-532

 PDF BibTeX

Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps., Toru Nakanishi, Nobuo Funabiki, pp. 533-548

 PDF BibTeX

Modular Security Proofs for Key Agreement Protocols., Caroline Kudla, Kenneth G. Paterson, pp. 549-565

 PDF BibTeX

A Simple Threshold Authenticated Key Exchange from Short Secrets., Michel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval, pp. 566-584

 PDF BibTeX

Examining Indistinguishability-Based Proof Models for Key Establishment Protocols., Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock, pp. 585-604

 PDF BibTeX

Server-Aided Verification: Theory and Practice., Marc Girault, David Lefranc, pp. 605-623

 PDF BibTeX

Errors in Computational Complexity Proofs for Protocols., Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock, pp. 624-643

 PDF BibTeX

Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature)., Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo, pp. 644-661

 PDF BibTeX

Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs., Craig Gentry, David Molnar, Zulfikar Ramzan, pp. 662-681

 PDF BibTeX

Universally Convertible Directed Signatures., Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud, pp. 682-701

 PDF BibTeX