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.
Author(s): Colin Boyd (auth.), Anne Canteaut, Kapaleeswaran Viswanathan (eds.)
Series: Lecture Notes in Computer Science 3348
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005
Language: English
Pages: 431
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Operating Systems; Computer Communication Networks; Management of Computing and Information Systems
Front Matter....Pages -
Design of Secure Key Establishment Protocols: Successes, Failures and Prospects....Pages 1-13
Secure Protocols for Complex Tasks in Complex Environments....Pages 14-16
Tripartite Key Exchange in the Canetti-Krawczyk Proof Model....Pages 17-32
The Marriage Proposals Problem: Fair and Efficient Solution for Two-Party Computations....Pages 33-47
On the Security of a Certified E-Mail Scheme....Pages 48-60
Multiplicative Homomorphic E-Voting....Pages 61-72
Chosen Ciphertext Attack on a New Class of Self-Synchronizing Stream Ciphers....Pages 73-83
Algebraic Attacks over GF ( q )....Pages 84-91
Results on Algebraic Immunity for Cryptographically Significant Boolean Functions....Pages 92-106
Generalized Boolean Bent Functions....Pages 107-119
On Boolean Functions with Generalized Cryptographic Properties....Pages 120-135
Information Theory and the Security of Binary Data Perturbation....Pages 136-147
Symmetric Authentication Codes with Secrecy and Unconditionally Secure Authenticated Encryption....Pages 148-161
Faster Variants of the MESH Block Ciphers....Pages 162-174
Related-Key Attacks on Reduced Rounds of SHACAL-2....Pages 175-190
Related-Key Attacks on DDP Based Ciphers: CIKS-128 and CIKS-128H....Pages 191-205
Cryptanalysis of Ake98....Pages 206-217
Designing an Efficient and Secure Public-Key Cryptosystem Based on Reducible Rank Codes....Pages 218-229
HEAD : Hybrid Encryption with Delegated Decryption Capability....Pages 230-244
A Provably Secure Elliptic Curve Scheme with Fast Encryption....Pages 245-259
Advances in Alternative Non-adjacent Form Representations....Pages 260-274
Attacks on Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups....Pages 275-289
Exact Analysis of Montgomery Multiplication....Pages 290-304
Cryptography, Connections, Cocycles and Crystals: A p-Adic Exploration of the Discrete Logarithm Problem....Pages 305-314
EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data....Pages 315-327
Impossibility of Construction of OWHF and UOWHF from PGV Model Based on Block Cipher Secure Against ACPCA....Pages 328-342
The Security and Performance of the Galois/Counter Mode (GCM) of Operation....Pages 343-355
Revisiting Fully Distributed Proxy Signature Schemes....Pages 356-370
New ID-Based Threshold Signature Scheme from Bilinear Pairings....Pages 371-383
Separable Linkable Threshold Ring Signatures....Pages 384-398
A New Black and White Visual Cryptographic Scheme for General Access Structures....Pages 399-413
Identification Algorithms for Sequential Traitor Tracing....Pages 414-429
Back Matter....Pages -
