ACISP 2008, 21-23 April, Sydney, Australia Tentative Program
7 July 2008
8:45-9:00 Opening
9:00-10:00: Invited Speach - New Paradigms for Password Security
Xavier Boyen
Voltage Inc., USA
10:00-10:30: Tea Break Authentication:
10:30-10:55: Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same-Origin Policy
Sebastian Gajek and Mark Manulis and Joerg Schwenk Horst Goertz Institute for IT-Security and UCL Crypto Group
10:55-11:20: Secure Biometric Authentication With Improved Accuracy
M. Barbosa, S. Cauchy, T. Brouard and S. Melo de Sousa Universidade do Minho, Université François Rabelais de Tours, Université François Rabelais de Tours, Universidade da Beira Interior
11:20-11:45: A Critical Analysis and Improvement of AACS Drive-Host Authentication Jiayuan Sui and Douglas R. Stinson University of Waterloo
Key Management:
11:45-12:10: Comparing the pre- and post-specified peer models for key agreement Alfred Menezes and Berkant Ustaoglu University of Waterloo
12:10-12:35: Efficient One-round Key Exchange in the Standard Model
Colin Boyd, Yvonne Cliff, Juan Gonzalez Nieto, Kenneth G. Paterson Queensland University of Technology, Australia; Royal Holloway University of London, UK
12:35-1:45: Lunch break
Public key Cryptography:
1:45-2:10: On the Improvement of the BDF Attack on LSBS-RSA
Hung-Min Sun, Mu-En Wu, Huaxiong Wang, and Jian Guo National Tsing Hua University, Taiwan; Nanyang Technological University, Singapore.
2:10-2:35: Public-Key Cryptosystems with Primitive Power Roots of Unity
Takato Hirano, Koichiro Wada, Keisuke Tanaka Tokyo Institute of Technology, Japan
2:35-3:00 Relationship between Two Approaches for Defining the Standard Model PA-ness
Isamu Teranishi and Wakaha Ogata NEC; Tokyo Institute of Technology, Japan
3:00-3:30: Tea Break
Privacy, Anonymity, and Secure Communication:
3:30-3:55: Distributed Verification of Mixing - Local Forking Proofs Model
Jacek Cichon, Marek Klonowski, Miroslaw Kutylowski Wroclaw University of Technology
3:55-4:20: Fully-simulatable Oblivious Set Transfer
Huafei Zhu I2r,A-star, Singapore
4:20-4:45: Efficient Disjointness Test for Private Datasets
Qingsong Ye, Huaxiong Wang, Josef Pieprzyk and Xian-Mo Zhang Macquarie University, Australia
4:45-5:10: Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary
Arpita Patra, Ashish Choudhary, Madhu Gayatri, and C. Pandu Rangan IIT Madras, India
8 July 2008
9:00-10:00: Invited Speach - Cryptographic Hashing at Crossroads
Josef Pieprzyk, Macquarie University, Australia
10:00-10:30: Tea Break
Block Ciphers:
10:30-10:55: Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers
Debra L. Cook and Moti Yung and Angelos D. Keromytis Columbia University and Google and Columbia Univeristy
10:55-11:20: Multidimensional Linear Cryptanalysis of Reduced Round Serpent
Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg Helsinki University of Technology, Finland; Nokia
11:20-11:45: Cryptanalysis of Reduced-Round SMS4 Block Cipher
Lei Zhang, Wentao Zhang, Wenling Wu Institute of Software, Chinese Academy of Sciences, China; Graduate University of Chinese Academy of Sciences. China
11:45-12:10: On the Unprovable Security of 2-Key XCBC
Peng Wang and Dengguo Feng and Wenling Wu and Liting Zhang Institution of Software of Chinese Academy of Sciences, China
12:10-1:30: Lunch break
Hash Functions:
1:30-1:55: Looking Back at a New Hash Function
Olivier Billet, Matt Robshaw, Yannick Seurin, and Lisa Yin
1:55-2:20: Non-Linear Reduced Round Attacks Against SHA-2 Hash family
Somitra Kumar Sanadhya and Palash Sarkar Indian Statistical Institute, Kolkata, India
2:20-2:45: Collisions for Round-Reduced LAKE
Florian Mendel and Martin Schläffer Graz University of Technology
2:45-3:10: Preimage Attack on Step-Reduced MD5
Yu Sasaki and Kazumaro Aoki NTT Corporation
3:10-3:40: Tea Break
Stream Ciphers:
3:40-4:05: Linear Distinguishing Attack on Shannon
Risto Hakala and Kaisa Nyberg Helsinki University of Technology
4:05-4:30: Recovering RC4 Permutation from 2048 Keystream Bytes if $j$ is Stuck
Subhamoy Maitra and Goutam Paul Indian Statistical Institute and Jadavpur University
4:30-4:55 Related-Key Chosen IV Attacks on Grain-v1 and Grain-128
Yuseop Lee, Kitae Jeong, Jaechul Sung and Seokhie Hong Korea University, Korea; University of Seoul, Korea.
7:00-9:30: Conference Banquet
9 July 2008
9:00-10:00: Invited Speach - Trust and Confidence: The inter-relationships
of operating in the online environment, Nigel PHAIR,
Australian High Tech Crime Centre, Canberra,
Centre for Transnational Crime Prevention,
University of Wollongong, Australia
10:00-10:30: Tea Break
Network Security:
10:30-10:55: Signature Generation and Detection of Malware Families
Sai Sathyanarayan and Pankaj Kohli and Bezawada Bruhadeshwar International Institute of Information Technology, Hyderabad, India
10:55-11:20: Reducing Payload Scans for Attack Signature Matching Using Rule Classification
Sunghyun Kim, Heejo Lee Korea University
11:20-11:45: Implicit Detection of Hidden Processes with a Feather-weight Hardware-Assisted Virtual Machine Monitor
Yan Wen, Jinjing Zhao, Huaimin Wang, and Jiannong Cao National University of Defense Technology, Beijing Institute of System Engineering
11:45-12:10: FormatShield: A Binary Rewriting Defense Against Format String Attacks Pankaj Kohli, Bezawada Bruhadeshwar C-STAR, International Institute of Information Technology, Hyderabad, India
12:10-1:30: Lunch break
Database Security:
1:30-1:55: Advanced Permission-Role Relationship in Role-Based Access Control
Min Li, Hua Wang and Xiaoxun Sun University of Southern Queensland
1:55-2:20: Enhancing Micro-Aggregation Technique by Utilizing Dependence-Based Information in Secure Statistical Databases
B. John Oommen and Ebaa Fayyoumi Carleton University, Ottawa, Canada: K1S 5B6
Elliptic Curve and Basic Primitives I:
2:20-2:45: Montgomery Residue Representation Fault-Tolerant Computation in GF(2^{k})
Silvana Medos and Serdar Boztas RMIT, Australia
2:45-3:10: A New Approach for Computing Double-Base Chains
Christophe Doche and Laurent Habsieger Macquarie University, Australia; Institut Camille Jordan, CNRS UMR 5208 Université Lyon 1, France
3:10-3:40: Tea break Elliptic
Curve and Basic Primitives II:
3:40:-4:05: Extractors for Jacobians of Binary Genus-2 Hyperelliptic Curves
Reza Rezaeian Farashahi Dept. of Mathematics and Computer Science, TU Eindhoven
4:05-4:30: Efficient Modular Arithmetic in Adapted Modular Number System using Lagrange Representation
Christophe Negre and Thomas Plantard Team DALI, University of Perpignan, France and University of Wollongong, Australia.