ACISP 2021

1 - 3 December 2021 Virtual
The 26th Australasian Conference on
Information Security and Privacy
The conference proceedings are now available. Click Here.
 
Due to the pandemic, ACISP 2021 will be held as a virtual event.
 
Registration information is now available. Click Here.
 

About ACISP 2021

The 26th Australasian Conference on Information Security and Privacy (ACISP 2021) seeks original papers presenting novel research results in all aspects of information security and privacy. We welcome papers presenting theories, techniques, implementations, applications and practical experiences on a variety of topics. Topics of interest include, but are not limited to:

Topics of interest

  • Cryptology
  • Blockchain technology
  • Cryptocurrency
  • Post-quantum cryptography
  • Authentication
  • Access Control
  • Key management
  • Security protocols
  • Privacy enhancing technologies
  • Viruses and Malware
  • Cloud security
  • IoT security
  • Software security
  • Database security
  • System security
  • Network security
  • Security policy
  • Digital forensics
  • Lightweight security
  • Cyber-physical security
  • Security implementation
Please submission your manuscript at: https://easychair.org/conferences/?conf=acisp2021

Special Tracks

This year, we are organising two special tracks.
  • Special Track: Blockchain
    We invite papers on all aspects of Blockchain including, but not limited to:
    • Foundations
    • New Design
    • Consensus Algorithms
    • Attacks on Existing Systems
    • Privacy
    • Scalability
  • Special Track: AI/ML Security & Privacy
    We invite papers on all aspects of AI/ML Security & Privacy, but not limited to:
    • Foundations
    • Adversarial learning
    • Attacks on ML/AI systems
    • Privacy Preserving Machine Learning
    • Security Applications like Malware, Phishing, Anomaly detection
    • Vulnerability testing

Important Deadlines

  • Paper submission: February 15, 2021 February 25, 2021, 11:59pm AoE
  • Notification of Acceptance: April 6, 2021 April 15, 2021
  • Camera-ready Submission: April 20, 2021 May 15, 2021
  • Conference dates: July 7-9, 2021 1-3 December, 2021

Keynote Speakers

Josef Pieprzyk, CSIRO Data61, Australia
About: Dr Josef Pieprzyk is a Senior Principal Research Scientist at Data61, CSIRO and a Professor at Institute of Computer Science, Polish Academy of Sciences. His main research interest focus is Cryptology and Information Security and includes design and analysis of cryptographic algorithms (such as encryption, hashing and digital signatures), post-quantum cryptography, secure multiparty computations, cryptographic protocols, copyright protection, e-commerce, web security and cybercrime prevention.
Dr Pieprzyk is a Fellow of IACR. He is the Editor-in-Chief of the MDPI Cryptography journal. He is also a Member of the editorial boards for International Journal of Information Security (Springer), Journal of Mathematical Cryptology, International Journal of Applied Cryptography (Inderscience Publishers), Fundamenta Informaticae (IOS Press), International Journal of Security and Networks (Inderscience Publishers) and International Journal of Information and Computer Security (Inderscience Publishers). Dr Pieprzyk published 5 books, edited 10 books (conference proceedings), 6 book chapters, and more than 300 papers in refereed journals and refereed international conferences.

Keynote Title: Asymmetric Numeral System and Cryptography
Abstract Asymmetric numeral system (ANS) is a compression algorithm invented by Jarek Duda. Unlike the well-known Huffman compression, it works for a source with an arbitrary probability distribution of its symbols. ANS has been widely adopted by the major IT players such as Apple, Microsoft and Google. A recent explosion of Internet applications (in particular, teleconferencing) puts security of compression in the spotlight.
The presentation talks about joint compression and encryption (also called compcrypt) using ANS. We first introduce ANS and explore its mathematical and probabilistic properties. Then we show how to tweak a plain ANS to obtain a lightweight compcrypt algorithm that provides confidentiality and a low-level of integrity. The solution requires a pseudorandom bit generator (PRBG) that does not need to be cryptographically strong. We also discuss compcrypt with 128-bit security for both confidentiality and integrity. This solution applies the Keccak permutation.
Ron Steinfeld, Monash University, Australia
About: Ron Steinfeld received his Ph.D. degree in Computer Science in 2003 from Monash University, Australia. Since 2020, he is an Associate Professor at the Department of Software Systems and Cybersecurity, Monash University, Australia. Following his Ph.D. Ron worked as a postdoctoral research fellow in cryptography and information security at Macquarie University, Australia, holding the positions of Macquarie University Research Fellow in cryptography and information security (2007-2009), and ARC Australian Research Fellow in cryptography and information security (2009- 2012). Ron completed his ARC Research Fellowship at Monash University (2012-2014), where he was Senior Lecturer until 2019. His main research interests are in the design and analysis of cryptographic algorithms and protocols, and in particular in the area of quantum-safe cryptography and its applications. He has over 20 years of research experience in cryptography and information security. He has published more than 80 research papers in international refereed conferences and journals, more than 10 of which have each been cited over 100 times. He received the ASIACRYPT 2015 best paper award. He has served on the technical Program Committee of numerous international conferences in cryptography, is an editorial board member of the journal ‘Designs Codes and Cryptography’, and consulted in cryptography design for the software industry.

Keynote Title: Practical Lattice-Based Zero-Knowledge Proofs and Applications
Abstract We discuss some recent developments in design and analysis of practical lattice-based zero-knowledge proofs (ZKP) and their applications. In particular, we review research challenges of Schnorr-like ZKPs in the lattice setting and in particular the progress on efficient lattice-based Schnorr-like proofs for important non-linear polynomial relations, such as binary/range proofs and one-out-of-many proofs. We also discuss recent work on applications and optimization of such proof systems as building blocks for practical advanced cryptographic protocols such as ring signatures and privacy-preserving blockchain cryptocurrency payment protocols.
Pierangela Samarati, Università degli Studi di Milano, Italy
About: Pierangela Samarati is a Professor at the Department of Computer Science of the Università degli Studi di Milano, Italy. Her main research interests are on data and applications security and privacy, especially in emerging scenarios. She has participated in several projects involving different aspects of information protection. On these topics, she has published more than 280 peer-reviewed articles in international journals, conference proceedings, and book chapters. She has been Computer Scientist at SRI, CA (USA) and visiting researcher at Stanford University, CA (USA), and at George Mason University, VA (USA). She is the chair of the IEEE Systems Council Technical Committee on Security and Privacy in Complex Information Systems (TCSPCIS), of the ERCIM Security and Trust Management Working Group (STM), and of the ACM Workshop on Privacy in the Electronic Society (WPES). She is ACM Distinguished Scientist (named 2009) and IEEE Fellow (named 2012). She has received the ESORICS Outstanding Research Award (2018), the IEEE Computer Society Technical Achievement Award (2016), the IFIP WG 11.3 Outstanding Research Contributions Award (2012), and the IFIP TC11 Kristian Beckman Award (2008).

Keynote Title: Data security and privacy in emerging scenarios
Abstract The rapid advancements in Information and Communication Technologies (ICTs) have been greatly changing our society, with clear societal and economic benefits. Mobile technology, Cloud, Big Data, Internet of things, services and technologies that are becoming more and more pervasive and conveniently accessible, towards to the realization of a smart society. At the heart of this evolution is the ability to collect, analyze, process and share an ever-increasing amount of data, to extract knowledge for offering personalized and advanced services. A major concern, and potential obstacle, towards the full realization of such evolution is represented by security and privacy issues. I will illustrate some security and privacy issues arising in emerging scenarios, focusing on the problem of managing data while guaranteeing protection of data stored or processed by external providers.
Nishanth Chandran, Microsoft Research, India
About: Nishanth Chandran is a Principal Researcher at Microsoft Research, India. His research interests are in problems related to cryptography, secure computation and cloud security. Prior to this, Nishanth was a Researcher at AT&T Labs, and before that he was a Post-doctoral Researcher at MSR Redmond.
Nishanth is a recipient of the 2010 Chorafas Award for exceptional achievements in research and his research has received coverage in science journals and in the media at venues such as Nature and MIT Technology Review. He has published several papers in top computer science conferences and journals such as Crypto, Eurocrypt, IEEE S&P, CCS, STOC, FOCS, SIAM Journal of Computing, Journal of the ACM, and so on. His work on position-based cryptography was selected as one of the top 3 works and invited to QIP 2011 as a plenary talk. Nishanth has served on the technical program committee of many of the top cryptography conferences on several occasions and holds several US Patents. Nishanth received his Ph.D. in Computer Science from UCLA, M.S. in Computer Science from UCLA, and B.E. in Computer Science and Engineering from Anna University (Hindustan College of Engineering), Chennai.

Keynote Title: Cryptographic Techniques for Secure Inference and AI Model Validation
Abstract Secure Inference allows model owners to provide AI inference as a service to clients with the guarantee that model owners learn nothing about the client's sensitive data while also ensuring that the clients only learn the prediction of the model on their data and nothing else. This primitive also forms the basis for Secure AI Model Validation that can enable AI vendors to test the accuracy of their models on private test datasets without exposing their models in the clear.
In this task, I will describe Microsoft's EzPC system. Through this, I will survey recent works that have enabled EzPC to be a practical and usable system for the above tasks - ranging from efficient 2-party secure computation protocols and function secret sharing techniques for ML applications, to compiler support from popular ML frameworks.
Aggelos Kiayias, University of Edinburgh, UK
About: Aggelos Kiayias FRSE is chair in Cyber Security and Privacy and director of the Blockchain Technology Laboratory at the University of Edinburgh, Scotland, UK. He is also the Chief Scientist at blockchain technology company IOHK and Associate Professor of Cryptography and Security at the University of Athens. His research interests are in computer security, information security, applied cryptography and foundations of cryptography with a particular emphasis in blockchain technologies and distributed systems, e-voting and secure multiparty protocols as well as privacy and identity management. He has received an ERC Starting Grant, a Marie Curie fellowship, an NSF Career Award, and a Fulbright Fellowship. He holds a Ph.D. from the City University of New York and he is a graduate of the Mathematics department of the University of Athens. He has over 150 publications in journals and conference proceedings in the area. He has served as the program chair of the Cryptographers’ Track of the RSA conference in 2011 and the Financial Cryptography and Data Security conference in 2017, as well as the general chair of Eurocrypt 2013. He also served as the program chair of Real World Crypto Symposium 2020 and the Public-Key Cryptography Conference 2020. He is in the editorial boards of ACM Transactions on Privacy and Security and IEEE Transactions on Dependable and Secure Computing as well as in the advisory board of Cryptoeconomic Systems. In 2021 he was elected fellow of the Royal Society of Edinburgh.

Keynote Title: Resource Based Multiparty Protocols - Decentralizing Information Technology
Abstract The bitcoin blockchain, introduced more than a decade ago, gave the first instance of a multiparty protocol that maintains its security via the incentive driven participation of a fluctuating set of resource holders. This raises the question whether it can be possible to realise any multiparty functionality out of the self-interest of computer node operators who enroll themselves to support the system’s operation in exchange of rewards that are provided in the system’s digital currency. In this talk we cast this as a general paradigm for designing and deploying multiparty protocols. We give two examples of this paradigm: the Ouroboros protocol as deployed in the Cardano blockchain and the Nym Mix-net. We discuss design challenges, solutions and open questions as well as we look at what lies ahead in decentralizing information technology services.
David Liebowitz, Penten, Australia 
About: David Liebowitz is the Head of Technology and Innovation for the Applied AI business unit in Penten, a Canberra based cyber security company, and an Adjunct Senior Lecturer at UNSW Sydney. David develops applications of machine learning to cyber challenges within Defence and National Security. He holds a DPhil in Computer Vision from the University of Oxford, spent a year at the Royal Institute of Technology in Stockholm and has held a number of research and management positions at technology companies including Seeing Machines, General Dynamics Mediaware and Northrop Grumman.

Keynote Title: Machine Learning for Realistic Cyber Deception
Abstract Deception is an increasingly popular cyber security technology that uses fakes IT assets to discover intrusion and data theft. Deception can also trick intruders into revealing their intent and tools. The key to successful deception and its security benefits is the realism of the assets. This talk looks at recent work on building realistic fakes by learning from real data and their application in cyber deception.

Program Schedule [Download] [Proceedings]

schedule overview

Session 1: Cryptographic Foundations

  1. Leakage Resilient Cheating Detectable Secret Sharing Schemes: Sabyasachi Dutta and Reihaneh Safavi-Naini (University of Calgary, Canada)
  2. Chosen Ciphertext Secure Functional Encryption from Constrained Witness PRF : Tapas Pal and Ratna Dutta (Indian Institute of Technology Kharagpur, India)
  3. Updatable Trapdoor SPHFs: Modular Construction of Updatable Zero-Knowledge Arguments and More: Behzad Abdolmaleki (Max Planck Institute for Security and Privacy, Bochum, Germany) and Daniel Slamanig (AIT Austrian Institute of Technology, Vienna, Austria)
  4. Small Superset and Big Subset Obfuscation: Steven D. Galbraith and Trey Li (University of Auckland, Auckland, New Zealand)

Session 2: Encryption

  1. Broadcast Authenticated Encryption with Keyword Search: Xueqiao Liu (University of Wollongong, Wollongong, Australia), Kai He (Dongguan University of Technology, China), Guomin Yang (University of Wollongong, Wollongong, Australia), Willy Susilo(University of Wollongong, Wollongong, Australia), Joseph Tonien (University of Wollongong, Wollongong, Australia) and Qiong Huang (South China Agricultural University, China)
  2. An Anonymous Trace-and-Revoke Broadcast Encryption Scheme : Olivier Blazy (XLIM, University of Limoges, CNRS, Limoges, France), Sayantan Mukherjee (XLIM, University of Limoges, CNRS, Limoges, France), Huyen Nguyen (ENS de Lyon, Laboratoire LIP, France), Hieu Phan (Telecom Paris, Institut Polytechnique de Paris, France) and Damien Stehlé (ENS de Lyon, Laboratoire LIP, France & Institut Universitaire de France)
  3. Security Analysis of End-to-End Encryption for Zoom Meetings : Takanori Isobe (University of Hyogo, Hyogo, Japan, National Institute of Information and Communications Technology, Tokyo, Japan, PRESTO, Japan Science and Technology Agency, Tokyo, Japan), Ryoma Ito National Institute of Information and Communications Technology, Japan)
  4. CCA Secure Attribute-Hiding Inner Product Encryption from Minimal Assumption : Tapas Pal and Ratna Dutta (Indian Institute of Technology Kharagpur, India)

Session 3: Post Quantum Cryptography - Encryption

  1. Puncturable Identity-based Encryption from Lattices : Priyanka Dutta, Willy Susilo, Dung Hoang Duong and Partha Sarathi Roy (University of Wollongong, Australia)
  2. Optimizing Bootstrapping and Evaluating Large FHE Gates in the LWE-based GSW-FHE : Chao Liu (Shandong University, China), Anyu Wang (Tsinghua University, China) and Zhongxiang Zheng (Tsinghua University, China)
  3. Forward-Secure Group Encryptions from Lattices : Jing Pan (Xidian University, China), Xiaofeng Chen (Xidian University, China &State Key Laboratory of Cryptology, China) , Fangguo Zhang (Sun Yat-sen University, Guangzhou & Guangdong Province Key Laboratory of Information Security Technology, China) and Willy Susilo (University of Wollongong, Australia)
  4. Anonymous Lattice Identity-Based Encryption with Traceable Identities : Xavier Boyen (QUT, Brisbane, Australia), Ernest Foo (Griffth University, Brisbane, Australia) and Qinyi Li (Griffth University, Brisbane, Australia)

Session 4: Privacy

  1. Optimal Randomized Partial Checking for Decryption Mix Nets: Thomas Haines (Norwegian University of Science and Technology, Norway) and Johannes Mueller (University of Luxembourg, Luxembourg)
  2. A Novel Proof of Shuffle: Exponentially Secure Cut-and-Choose: Thomas Haines (Norwegian University of Science and Technology, Norway) and Johannes Mueller (University of Luxembourg, Luxembourg)
  3. Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC: Hikaru Tsuchida (University of Tsukuba, Japan& NEC Corporation, Japan) and Takashi Nishide (University of Tsukuba, Japan)
  4. Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer: Geoffroy Couteau (CNRS, IRIF, Université de Paris, France), Bill Roscoe (University of Oxford, UK) and Peter Ryan (University of Luxembourg, Luxembourg)

Session 5: Blockchain - Protocols and Foundations

  1. A Secure Cross-Shard View-Change Protocol for Sharding Blockchains : Yizhong Liu, Jianwei Liu, Yiming Hei, Yu Xia and Qianhong Wu (Beihang University, Beijing, China)
  2. Efficient Unique Ring Signature for Blockchain Privacy Protection : Anh The Ta (AI Lab, FPT Software Ltd. Vietnam), Thanh Xuan Khuc (Institute of Cryptography Science and Technology, Hanoi, Vietnam), Tuong Ngoc Nguyen (University of Wollongong Australia), Huy Quoc Le (University of Wollongong Australia, CSIRO Data61, Sydney), Dung Hoang Duong (University of Wollongong Australia), Willy Susilo (University of Wollongong Australia), Kazuhide Fukushima (KDDI Research, Inc., Japan) and Shinsaku Kiyomoto (KDDI Research, Inc., Japan)
  3. Redactable Transactions in Consortium Blockchain: Controlled by Multi-Authority CP-ABE : Zongyang Zhang (Beihang University, Beijing, China & Wuhan University, China), Tong Li (Beihang University, Beijing, China), Zhuo Wang (Beihang University, Beijing, China) and Jianwei Liu (Beihang University, Beijing, China)
  4. Concise Mercurial Subvector Commitments: Definitions and Constructions : Yannan Li (University of Wollongong, Wollongong, Australia), Willy Susilo(University of Wollongong, Wollongong, Australia), Guomin Yang(University of Wollongong, Wollongong, Australia), Tran Viet Xuan Phuong(University of Wollongong, Wollongong, Australia), Yong Yu (Xi'an University of Posts & Telecommunications, Xi'an, China) and Dongxi Liu (Data61, CSIRO, Australia)

Session 6: Privacy for Machine Learning

  1. ALRS: An Adversarial Noise Based Privacy-Preserving Data Sharing Mechanism : Jikun Chen (Shanghai Jiao Tong University, Shanghai, China), Ruoyu Deng (Shanghai Jiao Tong University, Shanghai, China) Hongbin Chen (Shanghai Jiao Tong University, Shanghai, China), Na Ruan (Shanghai Jiao Tong University, Shanghai, China) , Yao Liu (University of South Florida, Tampa, USA) , Chao Liu (Beijing Qihoo 360 Technology Co. Ltd., Beijing, China) and Chunhua Su (University of Aizu, Fukushima, Japan)
  2. Non-Interactive, Secure Veri able Aggregation for Decentralized, Privacy-Preserving Learning : Carlo Brunetta (Chalmers University of Technology, Gothenburg, Sweden), Georgia Tsaloli (Chalmers University of Technology, Gothenburg, Sweden) , Bei Liang (Beijing Institute of Mathematical Sciences and Applications, Beijing, China), Gustavo Banegas (Polytechnique de Paris, Palaiseau, France) and Aikaterini Mitrokotsa (Chalmers University of Technology, Gothenburg, Sweden)
  3. Towards Visualizing and Detecting Audio Adversarial Examples for Automatic Speech Recognition : Wei Zong, Yang-Wai Chow and Willy Susilo (University of Wollongong, Australia)
  4. Oriole: Thwarting Privacy against Trustworthy Deep Learning Models : Liuqiao Chen (East China Normal University, China), Hu Wang (University of Adelaide, Australia), Benjamin Zi Hao Zhao (University of Adelaide, Australia), Minhui Xue (University of Adelaide, Australia) and Haifeng Qian (East China Normal University, China)

Session 7: Blockchain - Analysis and Attack

  1. Transparency or Anonymity Leak : Monero Mining Pools Data Publication : Dimaz Ankaa Wijaya (Monash University, Australia, Data61, CSIRO, Australia & Deakin University, Australia), Joseph K. Liu (Monash University, Australia), Ron Steinfeld (Monash University, Australia) and Dongxi Liu (Data61, CSIRO, Australia)
  2. Mind the Scraps: Attacking Blockchain based on Selfdestruct : Wei-Yang Chiu and Weizhi Meng (Technical University of Denmark, Denmark)
  3. A Blockchain-enabled Federated Learning Model for Privacy Preservation : System Design : Minfeng Qi (Swinburne University of Technology, Melbourne, Australia), Ziyuan Wang (Swinburne University of Technology, Melbourne, Australia), Fan Wu (Swinburne University of Technology, Melbourne, Australia), Rob Hanson (CSIRO Data61, Sydney, Australia), Shiping Chen (CSIRO Data61, Sydney, Australia), Yang Xiang (Swinburne University of Technology, Melbourne, Australia) and Liming Zhu (CSIRO Data61, Sydney, Australia)

Session 8: Symmetric Primitive & Post Quantum Cryptography I

  1. Algebraic Attacks on Round-Reduced Keccak : Fukang Liu (East China Normal University, Shanghai, China & University of Hyogo, Hyogo, Japan), Takanori Isobe (University of Hyogo, Hyogo, Japan, National Institute of Information and Communications Technology, Tokyo, Japan, PRESTO, Japan Science and Technology Agency, Tokyo, Japan), Willi Meier (FHNW, Windisch, Switzerland) and Zhonghao Yang (East China Normal University, Shanghai, China)
  2. On MILP-based Automatic Search for Bit-Based Division Property for Ciphers with (large) Linear Layers : Muhammad Elsheikh and Amr M. Youssef (Concordia University, Montréal, Québec, Canada)
  3. Lattice-based Secure Biometric Authentication for Hamming Distance : Jung Hee Cheon (Seoul National University, Seoul, Republic of Korea & CryptoLab, Seoul, Republic of Korea), Dongwoo Kim (Western Digital Research, USA), Duhyeong Kim (Intel Labs, USA), Joohee Lee (Samsung SDS, Seoul, Republic of Korea), Junbum Shin (CryptoLab, Seoul, Republic of Korea)) and Yongsoo Song (Seoul National University, Seoul, Republic of Korea)
  4. A Trustless GQ Multi-Signature Scheme with Identifiable Abort : Handong Cui and Tsz Hon Yuen (University of Hong Kong, Hong Kong, SAR)

Session 9: Symmetric Primitives & Post Quantum Cryptography II

  1. Constructions of Iterative Near-MDS Matrices with the Lowest XOR Count: Xiaodan Li and Wenling Wu (University of Chinese Academy of Sciences, Beijing, China)
  2. Forced Independent Optimized Implementation of 4-Bit S-Box : Yanhong Fan (Shandong University, China), Weijia Wang ((Shandong University, China), Zhihu Li (China Electric Power Research Institute, Beijing, China), Zhenyu Lu (Shandong University, China), Siu Ming Yiu (University of Hong Kong, Hong Kong) and Meiqin Wang (Shandong University, China)
  3. Distinguishing and Key Recovery Attacks on the Reduced-Round SNOW-V : Jin Hoki (University of Hyogo, Japan), Takanori Isobe (University of Hyogo, Hyogo, Japan, National Institute of Information and Communications Technology, Tokyo, Japan, PRESTO, Japan Science and Technology Agency, Tokyo, Japan), Ryoma Ito National Institute of Information and Communications Technology, Japan), Fukang Liu (University of Hyogo, Japan) and Kosei Sakamoto (University of Hyogo, Japan)
  4. Verifiable Obtained Random Subsets for Improving SPHINCS+: Mahmoud Yehia, Riham Altawy and T. Aaron Gulliver (University of Victoria, Canada.)

Registration

Registration for ACISP 2021 is open now. A standard price of A$30 applies to all registrations, including author, non-author, student, non-student etc. At least one registration is needed for each accepted paper.
 
ACISP 2021 Online Registration Form

Organising Committee

General Co-Chairs
Hui Cui, Murdoch University, Australia
Joseph Liu, Monash University, Australia
Surya Nepal, CSIRO Data61, Australia

Technical Program Co-Chairs
Joonsang Baek, University of Wollongong, Australia
Sushmita Ruj, CSIRO Data61, Australia

Publication Co-Chairs
Jongkil Kim, University of Wollongong, Australia
Yannan Li, University of Wollongong, Australia

Registration Chair
Xingliang Yuan, Monash University, Australia

Web Chair
Raj Gaire, CSIRO Data61, Australia

PC Members
Shashank Agrawal, Western Digital Research, USA
Elena Andreeva, KU Leuven, Belgium
Man Ho Au, The University of Hong Kong, Hong Kong
Carsten Baum, Aarhus University
Debrup Chakraborty, Indian Statistical institute, India
Anupam Chattopadhyay, Nanyang Technological University, Singapore
Xiaofeng Chen, Xidian University
Rongmao Chen, National University of Defense Technology
Chitchanok Chuengsatiansup, The University of Adelaide, Australia
Mauro Conti, University of Padua
Bernardo David, IT University of Copenhagen
Dung Hoang Duong, University of Wollongong, Australia
Keita Emura, National Institute of Information and Communications Technology
Muhammed F. Esgin, Monash University, Australia
Ernest Foo, Griffith University, Australia
Chaya Ganesh, Indian Institute of Science, India
Mengmeng Ge, Deakin University
Esha Ghosh, Microsoft Research
Vincent Gramoli, The University of Sydney, Australia
Clémentine Gritti, University of Canterbury
Martin Hell, Lund University
Swee-Huay Heng, Multimedia University, Malaysia
Sanjay Jha, The University of New South Wales, Australia
Han Jinguang, Queen's University Belfast, UK
Dongseong Kim, The University of Queensland, Australia
Hyoungshick Kim, Sungkyunkwan University
Veronika Kuchta, University of Queensland, Australia
Jianchang Lai, Fujian Normal University
Jooyoung Lee, Korea Advanced Institute of Science and Technology, South Korea
Dongxi Liu, CSIRO, Data61, Australia
Rongxing Lu, University of New Brunswick, Canada
Siqi Ma, The University of Queensland, Australia
Subhamoy Maitra, Indian Statistical Institute, India
Weizhi Meng, Department of Applied Mathematics and Computer Science, Technical Universtiy of Denmark, Denmark
Kirill Morozov, University of North Texas, USA
Khoa Nguyen, Nanyang Technological University, Singapore
Ariel Nof, Technion, Israel
Koji Nuida, The University of Tokyo, Japan
Elena Pagnin, Chalmers University of Technology
Josef Pieprzyk, CSIRO/Data61, Australia
Indrakshi Ray, Colorado State University
Chester Rebeiro, Indian Institute of Technology Madras, India
Partha Sarathi Roy, University of Wollongong, Australia
Reihaneh Safavi-Naini, University of Calgary, Canada
Sujoy Sinha Roy, University of Birmingham, UK
Kouichi Sakurai, Kyushu University
Amin Sakzad, Monash University, Australia
Pierangela Samarati, Universita' degli Studi di Milano, Italy
Binanda Sengupta, A*STAR, Singapore
Paul Stankovski Wagner, Lund University
Qiang Tang, New Jersey Institute of Technology, USA
Ni Trieu, Arizona State University, USA
Damien Vergnaud, Université Pierre et Marie Curie / Institut Universitaire de France, France
Cong Wang, City University of Hong Kong, Hong Kong
Minhui Xue, The University of Adelaide, Australia
Hailun Yan, EPFL, Lausanne, Switzerland
Yuval Yarom, The University of Adelaide and Data61, CSIRO, Australia
Xun Yi, RMIT University, Australia
Siu Ming Yiu, The University of Hong Kong, Hong Kong
Tsz Hon Yuen, The University of Hong Kong, Hong Kong
Jianying Zhou, Singapore University of Technology and Design, Singapore