Much of the information on this web page was provided courtesy of Michael Ley and the DBLP Project

---

ASIACRYPT 2005: Chennai, India

Bimal K. Roy, (Ed.):
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.

---

Algebra and Number Theory

• Pascal Paillier, Damien Vergnaud:
  Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log. 1-20
  BibTeX
• David Jao, Stephen D. Miller, Ramarathnam Venkatesan:
  Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?. 21-40
  BibTeX
• Phong Q. Nguyen, Jacques Stern:
  Adapting Density Attacks to Low-Weight Knapsacks. 41-58
  BibTeX
• Vassil S. Dimitrov, Laurent Imbert, Pradeep Kumar Mishra:
  Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains. 59-78
  BibTeX

Multiparty Computation

• Martin Hirt, Jesper Buus Nielsen:
  Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. 79-99
  BibTeX
• Nuttapong Attrapadung, Hideki Imai:
  Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations. 100-120
  BibTeX
• Andreas Jakoby, Maciej Liskiewicz:
  Revealing Additional Information in Two-Party Computations. 121-135
  BibTeX

Zero Knowledge and Secret Sharing

• Vladimir Kolesnikov:
  Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation. 136-155
  BibTeX
• Zhifang Zhang, Mulan Liu, Liangliang Xiao:
  Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes. 156-173
  BibTeX
• Moses Liskov:
  Updatable Zero-Knowledge Databases. 174-198
  BibTeX

Information and Quantum Theory

• Renato Renner, Stefan Wolf:
  Simple and Tight Bounds for Information Reconciliation and Privacy Amplification. 199-216
  BibTeX
• Matthias Christandl, Stephanie Wehner:
  Quantum Anonymous Transmissions. 217-235
  BibTeX

Privacy and Anonymity

• Justin Brickell, Vitaly Shmatikov:
  Privacy-Preserving Graph Algorithms in the Semi-honest Model. 236-252
  BibTeX
• James Aspnes, Zoë Diamadi, Kristian Gjøsteen, René Peralta, Aleksandr Yampolskiy:
  Spreading Alerts Quietly and the Subgroup Escape Problem. 253-272
  BibTeX
• Douglas Wikström:
  A Sender Verifiable Mix-Net and a New Proof of a Shuffle. 273-292
  BibTeX
• Ryotaro Hayashi, Keisuke Tanaka:
  Universally Anonymizable Public-Key Encryption. 293-312
  BibTeX

Cryptanalytic Techniques

• Alexander Maximov, Thomas Johansson:
  Fast Computation of Large Distributions and Its Cryptographic Applications. 313-332
  BibTeX
• Carlos Cid, Gaëtan Leurent:
  An Analysis of the XSL Algorithm. 333-352
  BibTeX

Stream Cipher Cryptanalysis

• Jin Hong, Palash Sarkar:
  New Applications of Time Memory Data Tradeoffs. 353-372
  BibTeX
• Frédéric Muller, Thomas Peyrin:
  Linear Cryptanalysis of the TSC Family of Stream Ciphers. 373-394
  BibTeX
• Itsik Mantin:
  A Practical Attack on the Fixed RC4 in the WEP Mode. 395-411
  BibTeX
• Joydip Mitra:
  A Near-Practical Attack Against B Mode of HBB. 412-424
  BibTeX

Block Ciphers and Hash Functions

• Sébastien Kunz-Jacques, Frédéric Muller:
  New Improvements of Davies-Murphy Cryptanalysis. 425-442
  BibTeX
• Eli Biham, Orr Dunkelman, Nathan Keller:
  A Related-Key Rectangle Attack on the Full KASUMI. 443-461
  BibTeX
• Lars R. Knudsen, Frédéric Muller:
  Some Attacks Against a Double Length Hash Proposal. 462-473
  BibTeX
• Stefan Lucks:
  A Failure-Friendly Design Principle for Hash Functions. 474-494
  BibTeX

Bilinear Maps

• Yumiko Hanaoka, Goichiro Hanaoka, Junji Shikata, Hideki Imai:
  Identity-Based Hierarchical Strongly Key-Insulated Encryption and Its Application. 495-514
  BibTeX
• Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater:
  Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps. 515-532
  BibTeX
• Toru Nakanishi, Nobuo Funabiki:
  Verifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps. 533-548
  BibTeX

Key Agreement

• Caroline Kudla, Kenneth G. Paterson:
  Modular Security Proofs for Key Agreement Protocols. 549-565
  BibTeX
• Michel Abdalla, Olivier Chevassut, Pierre-Alain Fouque, David Pointcheval:
  A Simple Threshold Authenticated Key Exchange from Short Secrets. 566-584
  BibTeX
• Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock:
  Examining Indistinguishability-Based Proof Models for Key Establishment Protocols. 585-604
  BibTeX

Provable Security

• Marc Girault, David Lefranc:
  Server-Aided Verification: Theory and Practice. 605-623
  BibTeX
• Kim-Kwang Raymond Choo, Colin Boyd, Yvonne Hitchcock:
  Errors in Computational Complexity Proofs for Protocols. 624-643
  BibTeX

Signatures

• Joonsang Baek, Reihaneh Safavi-Naini, Willy Susilo:
  Universal Designated Verifier Signature Proof (or How to Efficiently Prove Knowledge of a Signature). 644-661
  BibTeX
• Craig Gentry, David Molnar, Zulfikar Ramzan:
  Efficient Designated Confirmer Signatures Without Random Oracles or General Zero-Knowledge Proofs. 662-681
  BibTeX
• Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud:
  Universally Convertible Directed Signatures. 682-701
  BibTeX

Copyright © , IACR