Information Security and Privacy

1. Front Matter

   PDF

2. Invited Lecture

   1. Is the Information Security King Naked?

      • Basie von Solms

      Pages 1-7

3. Network Security

   1. Measurement Study on Malicious Web Servers in the .nz Domain

      • Christian Seifert, Vipul Delwadia, Peter Komisarczuk, David Stirling, Ian Welch

      Pages 8-25

   2. A Combinatorial Approach for an Anonymity Metric

      • Dang Vinh Pham, Dogan Kesdogan

      Pages 26-43

   3. On Improving the Accuracy and Performance of Content-Based File Type Identification

      • Irfan Ahmed, Kyung-suk Lhee, Hyunjung Shin, ManPyo Hong

      Pages 44-59

4. Symmetric Key Encryption

   1. Attacking 9 and 10 Rounds of AES-256

      • Ewan Fleischmann, Michael Gorski, Stefan Lucks

      Pages 60-72

   2. Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network Structure

      • Jiali Choy, Guanhan Chew, Khoongming Khoo, Huihui Yap

      Pages 73-89

   3. Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT

      • Onur Özen, Kerem Varıcı, Cihangir Tezcan, Çelebi Kocair

      Pages 90-107

   4. Improved Cryptanalysis of the Common Scrambling Algorithm Stream Cipher

      • Leonie Simpson, Matt Henricksen, Wun-She Yap

      Pages 108-121

   5. Testing Stream Ciphers by Finding the Longest Substring of a Given Density

      • Serdar Boztaş, Simon J. Puglisi, Andrew Turpin

      Pages 122-133

   6. New Correlations of RC4 PRGA Using Nonzero-Bit Differences

      • Atsuko Miyaji, Masahiro Sukegawa

      Pages 134-152

5. Hash Functions

   1. Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders

      • Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu

      Pages 153-170

   2. Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

      • Mridul Nandi

      Pages 171-184

   3. Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256

      • Hongbo Yu, Xiaoyun Wang

      Pages 185-201

   4. Inside the Hypercube

      • Jean-Philippe Aumasson, Eric Brier, Willi Meier, María Naya-Plasencia, Thomas Peyrin

      Pages 202-213

   5. Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others

      • Yu Sasaki, Kazumaro Aoki

      Pages 214-231

   6. On the Weak Ideal Compression Functions

      • Akira Numayama, Keisuke Tanaka

      Pages 232-248

6. Invited Lecture

   1. Hardening the Network from the Friend Within

      • L. Jean Camp

      Pages 249-249

7. Public Key Cryptography

   1. Reducing the Complexity in the Distributed Computation of Private RSA Keys

      • Peter Lory

      Pages 250-263

   2. Efficiency Bounds for Adversary Constructions in Black-Box Reductions

      • Ahto Buldas, Aivo Jürgenson, Margus Niitsoo

      Pages 264-275

The 2009 Australasian Conference on Information Security and Privacy was the 14th in an annual series that started in 1996. Over the years ACISP has grown froma relativelysmall conferencewith a largeproportionof paperscoming from Australia into a truly international conference with an established reputation. ACISP 2009 was held at Queensland University of Technology in Brisbane, d- ing July 1–3, 2009. This year there were 106 paper submissions and from those 30 papers were accepted for presentation, but one was subsequently withdrawn. Authors of - cepted papers came from 17 countries and 4 continents, illustrating the inter- tional ?avorof ACISP. We would like to extend our sincere thanks to all authors who submitted papers to ACISP 2009. The contributed papers were supplemented by two invited talks from e- nent researchers in information security. Basie von Solms (University of Joh- nesburg), currently President of IFIP, raised the question of how well dressed is the information security king. L. Jean Camp (Indiana University) talked about how to harden the network from the friend within. We are grateful to both of them for sharing their extensive knowledge and setting challenging questions for the ACISP 2009 delegates. We were fortunate to have an energetic team of experts who formed the Program Committee. Their names may be found overleaf, and we thank them warmly for their considerable e?orts. This team was helped by an even larger number of individuals who reviewedpapers in their particularareasof expertise.

• AES
• block ciphers
• broadcast encryption
• cluster analysis
• collision resistant
• common scrambling algorithm
• cryptanalysis
• cryptographic attacks
• cryptography
• cryptosystems
• data security
• differential attack
• differential probability
• network security
• privacy
• algorithm analysis and problem complexity

• Information Security Institute, Queensland University of Technology, Brisbane, Australia

  Colin Boyd

• Information Security Institute, Queensland Univ. of Technology, Brisbane, Australia

  Juan González Nieto

Policies and ethics