Invited Talks -- Design of Secure Key Establishment Protocols: Successes, Failures and Prospects -- Secure Protocols for Complex Tasks in Complex Environments -- Cryptographic Protocols -- Tripartite Key Exchange in the Canetti-Krawczyk Proof Model -- The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations -- Applications -- On the Security of a Certified E-Mail Scheme -- Multiplicative Homomorphic E-Voting -- Stream Ciphers -- Chosen Ciphertext Attack on a New Class of Self-Synchronizing Stream Ciphers -- Algebraic Attacks over GF(q) -- Cryptographic Boolean Functions -- Results on Algebraic Immunity for Cryptographically Significant Boolean Functions -- Generalized Boolean Bent Functions -- On Boolean Functions with Generalized Cryptographic Properties -- Foundations -- Information Theory and the Security of Binary Data Perturbation -- Symmetric Authentication Codes with Secrecy and Unconditionally Secure Authenticated Encryption -- Block Ciphers -- Faster Variants of the MESH Block Ciphers -- Related-Key Attacks on Reduced Rounds of SHACAL-2 -- Related-Key Attacks on DDP Based Ciphers: CIKS-128 and CIKS-128H -- Cryptanalysis of Ake98 -- Public Key Encryption -- Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes -- HEAD: Hybrid Encryption with Delegated Decryption Capability -- A Provably Secure Elliptic Curve Scheme with Fast Encryption -- Efficient Representations -- Advances in Alternative Non-adjacent Form Representations -- Public Key Cryptanalysis -- Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups -- Exact Analysis of Montgomery Multiplication -- Cryptography, Connections, Cocycles and Crystals: A p-Adic Exploration of the Discrete Logarithm Problem -- Modes of Operation -- EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data -- Impossibility of Construction of OWHF and UOWHF from PGV Model Based on Block Cipher Secure Against ACPCA -- The Security and Performance of the Galois/Counter Mode (GCM) of Operation -- Signatures -- Revisiting Fully Distributed Proxy Signature Schemes -- New ID-Based Threshold Signature Scheme from Bilinear Pairings -- Separable Linkable Threshold Ring Signatures -- Traitor Tracing and Visual Cryptography -- A New Black and White Visual Cryptographic Scheme for General Access Structures -- Identification Algorithms for Sequential Traitor Tracing.

The INDOCRYPT series of conferences started in 2000. INDOCRYPT 2004 was the ?fth one in this series. The popularity of this series is increasing every year. The number of papers submitted to INDOCRYPT 2004 was 181, out of which 147 papers conformed to the speci?cations in the call for papers and, therefore, were accepted to the review process. Those 147 submissions were spread over 22 countries. Only 30 papers were accepted to this proceedings. We should note that many of the papers that were not accepted were of good quality but only the top 30 papers were accepted. Each submission received at least three independent - views. The selection process also included a Web-based discussion phase. We made e?orts to compare the submissions with other ongoing conferences around the world in order to ensure detection of double-submissions, which were not - lowed by the call for papers. We wish to acknowledge the use of the Web-based review software developed by Bart Preneel, Wim Moreau, and Joris Claessens in conducting the review process electronically. The software greatly facilitated the Program Committee in completing the review process on time. We would like to thank C´ edric Lauradoux and the team at INRIA for their total support in c- ?guring and managing the Web-based submission and review softwares. We are unable to imagine the outcome of the review process without their participation. This year the invited talks were presented by Prof. Colin Boyd and Prof.