Information security and privacy : 12th Australasian Conference, ACISP 2007 Townsville, Australia, July 2-4, 2007 : proceedings

• Main Authors: ACISP, Pieprzyk, Josef, Ghodosi, Hossein, Dawson, Ed (Edward)
• Format: eBook Book
• Language: English
• Published: Berlin Springer 2007; Springer Berlin / Heidelberg
• Edition: 1
• Series: Lecture Notes in Computer Science
• Subjects: Computer security; Computer security > Congresses; Congresses; Data protection; Data protection > Congresses; Privacy, Right of > Congresses
• ISBN: 3540734570; 9783540734574

Here is a highly relevant book that covers a wide array of key aspects in information security. It constitutes the refereed proceedings of the 12th Australasian Conference on Information Security and Privacy held in Townsville, Australia in July 2007. The 33 revised full papers presented were carefu...

Table of Contents:

• Intro -- Preface -- Organization -- Table of Contents -- An Analysis of the Hermes8 Stream Ciphers -- On the Security of the LILI Family of Stream Ciphers Against Algebraic Attacks -- Strengthening NLS Against Crossword Puzzle Attack -- A New Strategy for Finding a Differential Path of SHA-1 -- Preimage Attack on the Parallel FFT-Hashing Function -- Second Preimages for Iterated Hash Functions and Their Implications on MACs -- On Building Hash Functions from Multivariate Quadratic Equations -- An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication -- Soft Generation of Secure Biometric Keys -- Flaws in Some Secret Sharing Schemes Against Cheating -- Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n - 1 Cheaters -- Related-Key Amplified Boomerang Attacks on the Full-Round Eagle-64 and Eagle-128 -- Analysis of the SMS4 Block Cipher -- Forgery Attack to an Asymptotically Optimal Traitor Tracing Scheme -- TCHo: A Hardware-Oriented Trapdoor Cipher -- Anonymity on Paillier's Trap-Door Permutation -- Generic Certificateless Key Encapsulation Mechanism -- Double-Size Bipartite Modular Multiplication -- Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography -- Construction of Threshold (Hybrid) Encryption in the Random Oracle Model: How to Construct Secure Threshold Tag-KEM from Weakly Secure Threshold KEM -- Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards -- Combining Prediction Hashing and MDS Codes for Efficient Multicast Stream Authentication -- Certificateless Signature Revisited -- Identity-Committable Signatures and Their Extension to Group-Oriented Ring Signatures -- Hash-and-Sign with Weak Hashing Made Secure -- Sandwich" Is Indeed Secure: How to Authenticate a Message with Just One Hashing
• Threshold Anonymous Group Identification and Zero-Knowledge Proof -- Non-interactive Manual Channel Message Authentication Based on eTCR Hash Functions -- A Practical System for Globally Revoking the Unlinkable Pseudonyms of Unknown Users -- Efficient and Secure Comparison for On-Line Auctions -- Practical Compact E-Cash -- Use of Dempster-Shafer Theory and Bayesian Inferencing for Fraud Detection in Mobile Communication Networks -- On Proactive Perfectly Secure Message Transmission -- Author Index
• Intro -- Title -- Preface -- Organization -- Table of Contents -- An Analysis of the Hermes8 Stream Ciphers -- Introduction -- Description of Hermes8F -- Alternative Description of Hermes8F -- Cryptanalysis of Hermes8F -- Analysis of Hermes8 -- Equivalent Keys in Hermes8 -- Algebraic Structure -- Algebraic Structure of a Variant of Hermes8 -- Conclusion -- On the Security of the LILI Family of Stream Ciphers Against Algebraic Attacks -- Introduction -- Description -- LILI-128 Keystream Generator -- LILI-II Keystream Generator -- Algebraic Analysis of the LILI Family of Stream Ciphers -- Finding Low Degree Multiples of f_d -- Attack 1 : Guessing the Controlling Register -- Attack 2 : Keystream Decimation -- Fast Algebraic Attacks -- Algebraic Analysis of the LILI-II Stream Cipher -- Algebraic Representation for the LILI Family of Stream Ciphers -- Algebraic Attacks on LILI-II -- Fast Algebraic Attacks on LILI-II -- Initialization and Algebraic Attacks -- Direct Recovery of Key Bits -- Recovering the Key Bits Given the Internal State Bits -- Conclusion -- Algebraic Normal Form of LILI-II Boolean Function -- Strengthening NLS Against Crossword Puzzle Attack -- Introduction -- Preliminaries -- Proposed Boolean Operator: Slash -- Performance of {\em Slash} Against Linear Cryptanalysis -- Brief Description of NLS Stream Cipher -- Suggested Modification -- Brief Description of Crossword Puzzle (CP) Attack -- Analysis of NFSR and NLF -- Linear Approximation of \alpha_{t,(0)} and NFSR -- Linear Approximation of Modular Addition [3] -- Linear Approximation of Modular Slash -- Linear Approximation for NLF -- Complexity Comparison of CP Attack on the Original and Modified NLS -- Case for Konst = 0 -- Case for Konst \neq 0 -- Multiple Distinguisher -- Hardware and Time Complexity -- Conclusions -- A New Strategy for Finding a Differential Path of SHA-1
• Analysis of the SMS4 Block Cipher -- Introduction -- Notation -- Description of the SMS4 Block Cipher -- Algebraic Structure of SMS4 -- The SMS4 S-Box -- Embedding SMS4 -- A Reduced-Round Attack Using Integrals -- Weak Keys for Modified Round Key Constants -- Conclusions -- Forgery Attack to an Asymptotically OptimalTraitor Tracing Scheme -- Introduction -- Our Contribution -- Preliminaries -- Marking Assumption -- Feasible Set -- Collusion-Secure Code -- Traitor Tracing System -- The Upgraded CPP Scheme -- Two-User System -- Multi-user System -- Multi-user Traitor Tracing -- Forgery Attack and Countermeasure -- Forging Decryption Key -- Evading Tracing -- Countermeasure -- Discussion -- Structured Messages -- Stateless Assumption -- Codeword Length -- Conclusion -- TCHo: A Hardware-Oriented Trapdoor Cipher -- Introduction -- Preliminaries -- Notations -- Computational Problem -- Description of the TCHo Scheme -- Presentation -- Reliability -- Selecting the Parameters -- Security -- Construction of an IND-CCA Secure Scheme -- Implementation of TCHo -- Choice of Parameters -- Chosen Algorithms -- Software Implementation Results -- Hardware Implementation -- Comparison with Other Cryptosystems -- Conclusion -- On the Choice of the Code -- Anonymity on Paillier's Trap-Door Permutation -- Introduction -- Background -- Our Contribution -- Preliminaries -- A Family of Paillier's Trap-Door Permutations and That with a Common Domain -- Paillier's Bijective Functions -- A Family of Paillier's Trap-Door Permutations -- A Family of Paillier's Trap-Door Permutations with a Common Domain -- Applications to Public-Key Encryption with Anonymity -- Anonymity for Public-Key Encryption -- Our Proposed Schemes -- Security -- Generic Certificateless Key Encapsulation Mechanism -- Introduction -- Definition and Adversarial Model -- Certificateless KEM
• A Direct Construction without Random Oracles
• Verification Phase -- Security Analysis of the Protocol -- Fulfillment of Our Requirements -- Advantages of the Protocol -- Conclusion -- Soft Generation of Secure Biometric Keys -- Introduction -- Code-Offset Construction for Hamming Metric -- Code-Offset Construction for Euclidean Metric -- Security Aspects -- Security of Euclidean Metric Construction -- Code-Offset Euclidean Metric Construction with Wrap-Round Arithmetic -- Soft Two-Level Construction -- Conclusions -- Flaws in Some Secret Sharing Schemes Against Cheating -- Introduction -- Preliminaries -- Secret Sharing Schemes -- Secret Sharing Schemes Secure Against Cheating -- An Attack Against a Scheme in [7] -- An Attack Against a Scheme in [10] -- Fixing the Flaw in [10] -- Conclusion -- Efficient (k, n) Threshold Secret SharingSchemes Secure Against Cheating from n − 1Cheaters -- Introduction -- Preliminaries -- (k,n) Threshold Scheme -- Secret Sharing Schemes Secure Against Cheating -- Previous Work -- New Model of Secret Sharing Schemes Secure Against Cheating -- The Tompa and Woll Scheme [11] -- Proposed Scheme -- Validity Check of Reconstruction Result -- Modified Proposed Scheme -- Conclusion -- Related-Key Amplified Boomerang Attacks on the Full-Round Eagle-64 and Eagle-128 -- Introduction -- Preliminaries -- DDO-Boxes -- The Related-Key Amplified Boomerang Attack -- Eagle-64 and Eagle-128 -- Description of Eagle-64 -- Description of Eagle-128 -- Properties of Eagle-64 and Eagle-128 -- Related-Key Amplified Boomerang Attack on Eagle-64 -- A Full-Round Related-Key Amplified Boomerang Distinguisher of Eagle-64 -- Key Recovery Attack on the Full-Round Eagle-64 -- Related-Key Amplified Boomerang Attack on Eagle-128 -- A Full-Round Related-Key Amplified Boomerang Distinguisher of Eagle-128 -- Key Recovery Attack on the Full-Round Eagle-128 -- Conclusion -- DDO-boxes
• Introduction -- Description of SHA-[1][1] -- Notations -- The Outline of Wang's Attack -- Proposed Strategy for Finding Differential Path -- Strategy -- Proposed Algorithm -- Implementation and Experiment -- Implementation of Sub-Searches -- Experiment -- Conclusion -- Preimage Attack on the Parallel FFT-Hashing Function -- Introduction -- The Parallel FFT-Hashing Function -- Attack Strategy and Several Properties -- Preimage Attack on the Parallel FFT-Hashing Function -- Conclusion -- Second Preimages for Iterated Hash Functions and Their Implications on MACs -- Introduction -- The Notion of b-Block Bypass -- The Double Block-Length Hash Proposal DBLH -- Block Ciphers Following the FX Construction -- DBLH with FX -- Second Preimages for DX Based on a b-Block Bypass -- The Hash Function Design Strategy SMASH -- Implications of a b-Block Bypass for NMAC and HMAC -- Conclusion -- Proof of Theorem 2 -- Proof of Theorem 3 -- On Building Hash Functions from Multivariate Quadratic Equations -- Introduction -- Hash Functions and Quadratic Equations -- About Collision Resistance -- Construction of MQ-HASH -- Preliminaries -- The Compression Function of MQ-HASH -- The Security of MQ-HASH -- Preliminaries to the Study of Pre-image Resistance -- Pre-image Resistance of MQ-HASH -- Collision and Second Pre-image Resistance of MQ-HASH -- Establishing Parameters for MQ-HASH -- On the Injectivity of f -- On the Hardness of Inverting f -- Performance Considerations -- Deploying Random Systems -- Alternative Approaches -- Conclusions -- An Application of the Goldwasser-Micali Cryptosystem to Biometric Authentication -- Introduction -- Related Works -- Our Contributions -- Organization of This Work -- A New Security Model -- A New Biometric-Based Authentication Protocol -- Review of the Goldwasser-Micali Scheme -- Enrollment Phase
• Message Authentication Code -- Key Derivation Function (KDF) -- A Generic Construction of CL-KEM -- Hybrid Certificateless Encryption -- Our Certificateless Tag-KEM (CL-TKEM) -- Our Hybrid Certificateless Encryption -- Conclusion -- Double-Size Bipartite Modular Multiplication -- Introduction -- Modular Multiplications -- Bipartite Modular Multiplication -- Double-Size Techniques -- Previous Double-Size Modular Multiplications -- Double-Size Bipartite Modular Multiplication -- New Double-Size Techniques -- Bipartite Modular Multiplication Units -- Quotients of Bipartite Modular Multiplication -- 2n-Bit Integer Representations -- Double-Size Bipartite Modular Multiplications -- How to Compute Quotients of Bipartite Multiplications -- Software Approach -- Hardware Approach -- Remarkable Features -- Conclusion -- Proof of Proposition 1 -- Proof of Theorem 1 -- Proof of Theorem 2 -- Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography -- Introduction -- Scalar Multiplications in Elliptic Curve Cryptography -- Precomputing the Required Points -- Proposed Scheme -- Analysis -- Conclusion -- Pseudocode of the Proposed Scheme -- Proof of Theorem 1 -- Construction of Threshold (Hybrid) Encryption in the Random Oracle Model: How to Construct Secure Threshold Tag-KEM from Weakly Secure Threshold KEM -- Introduction -- Background -- Related Works and Motivation -- Our Contributions -- Preliminaries -- Threshold Encryption -- Threshold (Tag-)KEM -- Signature Scheme with Tight Security Reduction -- Construction of Secure Threshold Tag-KEM -- Instantiations -- Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards -- Introduction -- Definitions -- Notation -- Syntax of WIBE Schemes, WIB-KEMs and DEMs -- Security Notions -- Security of the Hybrid Construction -- A Generic Construction in the Random Oracle Model