CONTENTS -- Preface -- Organizing Committees -- Fuzzy Identity-based Encryption: New and Efficient Schemes J. Baek, W. Susilo and J. Zhou -- 1. Introduction -- 2. Preliminaries -- 3. Proposed Fuzzy IBE Schemes -- 4. Comparisons -- 5. Concluding Remarks -- References -- A Functional View of Upper Bounds on Codes A. Barg and D. Nogin -- 1. Introduction -- 2. Functional approach -- 2.1. Notation. -- 2.2. Construction of polynomials. -- 2.2.1. The MRRW polynomial. -- 2.2.2. Levenshtein polynomials, n = 2k + 1: -- 2.2.3. Levenshtein polynomials, n = 2k + 2: -- 3. Spectral method -- References -- A Method of Construction of Balanced Functions with Optimum Algebraic Immunity C. Carlet -- 1. Introduction -- 2. Preliminaries -- 3. The general method -- 4. Constructing functions with optimum algebraic immunity -- 5. Study of the Walsh transforms of the constructed functions and their nonlinearity -- 6. Constructing functions with optimum algebraic immunity, in odd numbers of variables -- References -- Enumeration of a Class of Sequences Generated by Inversions A. C e seml_io glu, W. Meidl and A. Topuzo glu -- 1. Introduction -- 2. Preliminaries -- 3. Proofs of Theorems 1.1 and 1.2 -- 4. Remarks -- References -- A Critical Look at Cryptographic Hash Function Literature S. Contini, R. Steinfeld, J. Pieprzyk and K. Matusiewicz -- 1. Introduction -- 2. A Brief History of Cryptographic Hashing -- 2.1. Definitions of Hash Functions -- 2.2. Random Oracles -- 2.3. Other Requirements for Hash Functions -- 2.4. Summary -- 3. Ordinary Hash Functions Versus Hash Function Families -- 3.1. Ordinary Hash Functions -- 3.1.1. Definitions and Implications of Security Properties -- 3.2. Hash Functions Families -- 4. What to Do about all the Cryptographic Hash Function Definitions? -- 5. Moving Forward -- 6. Conclusion -- References -- Appendix A.

7. Security Requirement De nitions -- Scalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects Y. M. Chee and C. J. Colbourn -- 1. Introduction -- 2. Testing Under a Generalized MAF Model -- 3. Optimal Crosstalk Test Arrays -- 4. Implementation -- 4.1. Testing Data Buses -- 4.2. Testing Address Buses -- 5. Significance -- 6. Conclusion -- Acknowledgments -- References -- An Improved Distinguisher for Dragon J. Y. Cho and J. Pieprzyk -- 1. Introduction -- 2. A brief description of Dragon -- 3. A linear distinguisher for Dragon -- 3.1. Approximations of functions G and H -- 3.1.1. Approximations of the function H -- 3.1.2. Approximations of the function G -- 3.2. Linear approximations of modular addition -- 3.3. Linear approximation of the function F -- 3.3.1. The approximation of a0 -- 3.3.2. The approximation of e0 -- 3.4. Building the distinguisher -- 3.5. Our results -- 4. Improving the distinguisher -- 4.1. Experiments -- 5. Conclusion -- Acknowledgment -- References -- Appendix A. Proof of Theorem 3.1 -- Appendix B. Proof of Corollary 3.1 -- Appendix C. Proof of Lemma 4.1 -- Constructing Perfect Hash Families Using a Greedy Algorithm C. J. Colbourn -- 1. Introduction -- 2. Density and a Greedy Algorithm -- 3. Computational Results -- 4. Conclusions -- Acknowledgements -- References -- Two-Weight Codes Punctured from Irreducible Cyclic Codes C. Ding, J. Luo and H. Niederreiter -- 1. Introduction -- 2. The class of two-weight codes -- 3. Concluding remarks -- References -- On the Joint Linear Complexity of Linear Recurring Multisequences F. Fu, H. Niederreiter and F. Ozbudak -- 1. Introduction -- 2. Preliminaries -- 3. Expectation and variance -- 4. Counting function -- Acknowledgments -- References.

Research on P2P Worn Detection Based on Information Correlation-PWDIC H. Hu, J. Zhang, F. Xiao and B. Liu -- 1. Introduction -- 2. P2P Worm -- 3. P2P Worm Detection Based On Information Correlation-PWDIC -- 3.1. The Behaviors of P2P Network -- 3.2. P2P Information Correlation Analysis -- 3.3. The Design of PWDIC Detection Model -- 3.4. The Realization of PWDIC -- 3.4.1. The realization of message classi cation layer function -- 3.4.2. The realization of rule generation layer function -- 3.4.3. The realization of warning layer function -- 3.4.4. The ow of detection -- 4. Simulated Experiment and the Result -- 4.1. Experiment environment -- 4.2. Experimental Simulation -- 4.2.1. Effect of the number of initial worm instances -- 4.2.2. The effect of detection and containment -- 4.3. Analyzed the Experiment Results -- 5. Conclusions -- References -- On the Relation among Various Security Models for Certi - cateless Cryptography Q. Huang and D. S. Wong -- 1. Introduction -- 1.1. A Summary of Results in This Paper -- 2. Definitions -- 2.1. Equivalence to the Original Seven-Algorithm Definition -- 3. Security Models -- 3.1. Malicious KGC Security vs. Strong Security -- 4. User Partial Key Replacement Attacks -- 5. Our Scheme -- 6. Conclusion -- Acknowledgement -- References -- Distance-Preserving Mappings T. Kl ve -- 1. Introduction -- 2. Basic notations and applications -- 2.1. Construction of permutation arrays by DPMs -- 2.2. Total distance increase -- 3. Particular constructions of DPMs from binary vectors -- 3.1. Mappings with k = 0 -- 3.2. Mappings with k = 1 (DIM) -- 3.3. Mappings with k = 2 -- 3.4. Mapping with arbitrary k -- 4. Mappings from ternary codes -- 4.1. Construction by Lin, Chang, Chen, and Kl ve -- 4.2. Construction by Lin, Tsai, and Wu -- 5. Open problems -- References.

Single Cycle Invertible Function and its Cryptographic Applications C. Li, B. Sun and Q. Dai -- 1. Introduction -- 2. New Class of Single Cycle Invertible Function -- 3. Analysis of the New Construction -- 4. New Way to Generate Longer State -- 5. Proposal: Construction for Stream Ciphers -- 6. Conclusion -- Acknowledgments -- References -- Concurrent Signatures without a Conventional Keystone Y. Mu, D. S. Wong, L. Chen, W. Susilo and Q. Wu -- 1. Introduction -- 1.1. Our Contribution -- 1.2. Technical approach -- 2. Revisiting de nition of concurrent signatures -- 2.1. Concurrent signature algorithms -- 2.2. Concurrent signature protocol -- 2.3. Unforgeability -- 2.4. Ambiguity -- 2.5. Partial fairness -- 2.6. Security of concurrent signatures -- 3. Generic construction -- 3.1. Signature of knowledge proof of discrete logarithm -- 3.2. The scheme -- 3.3. Discussions -- 3.4. Security Analysis -- 4. Conclusion -- References -- Authentication Codes in the Query Model R. Safavi-Naini, D. Tonien and P. R. Wild -- 1. Introduction -- 2. Passive Adversaries -- 3. The Query Model -- 3.1. Signature Queries -- 3.2. A Bound on the Probability of Success -- 3.3. A Bound on the Size of E -- 3.4. Verification queries -- 4. Conclusion -- References -- Collision in the DSA Function I. E. Shparlinski and R. Steinfeld -- 1. Motivation -- 2. Our Results -- 3. Preparations -- 4. Existence of Collisions -- 5. Finding Collisions -- References -- The Current Status in Design of Efficient Provably Secure Cryptographic Pseudorandom Generators R. Steinfeld -- 1. Introduction -- 2. Preliminary Definitions and Useful Lemmas -- 2.1. Definition of PRG Families and their Security -- 2.2. Useful General Lemmas in PRG Design -- 3. PRG Constructions from General One-Way Permutations/Functions -- 4. Efficient PRG Constructions from Specific One-Way Functions.

4.1. `Short Exponent' Discrete Log Based PRG -- 4.2. `Small Solution' RSA Based PRG -- 4.3. MQ-Based PRG -- 5. Comparison of Constructions -- 6. Conclusions -- References -- The Successive Minima Pro le of Multisequences L. Wang and H. Niederreiter -- 1. Introduction -- 2. Successive minima pro le -- 3. The asymptotic behavior of the successive minima pro le of multisequences -- 4. Almost perfect successive minima pro le -- Acknowledgments. -- References -- A Construction of Optimal Sets of FH Sequences J. Yin -- 1. Introduction -- 2. Mixed Difference Functions -- 3. The Construction -- References -- Author Index.