ORCID Profile
0000-0001-8057-4060
Current Organisation
University of Wollongong
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Data Format | Computer System Security | Data Encryption | Data security and protection | Cryptography | Cybersecurity and privacy
Expanding Knowledge in the Information and Computing Sciences | Expanding Knowledge in Technology |
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)
Date: 2018
Publisher: Springer International Publishing
Date: 2017
Publisher: Elsevier BV
Date: 02-2021
Publisher: Akademiai Kiado Zrt.
Date: 06-2014
DOI: 10.1556/SSCMATH.51.2014.2.1265
Abstract: We introduce Kurosh elements in ision rings based on the idea of a conjecture of Kurosh. Using this, we generalize a result of Faith in {xc[3]} and of Herstein in {xc[6]}.
Publisher: Springer International Publishing
Date: 2020
Publisher: World Scientific Pub Co Pte Lt
Date: 04-2017
DOI: 10.1142/S0219498817500773
Abstract: We present a conjectured formula for the representation of zeta function of the Heisenberg group over [Formula: see text], where [Formula: see text] is the ring of integers of some number field. We confirm the conjecture for [Formula: see text].
Publisher: Springer International Publishing
Date: 2016
Publisher: IEEE
Date: 11-2019
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2017
Publisher: American Mathematical Society (AMS)
Date: 03-2017
DOI: 10.1090/TRAN/6879
Abstract: Let G G be a finitely generated nilpotent group. The representation zeta function ζ G ( s ) \\zeta _G(s) of G G enumerates twist isoclasses of finite-dimensional irreducible complex representations of G G . We prove that ζ G ( s ) \\zeta _G(s) has rational abscissa of convergence α ( G ) \\alpha (G) and may be meromorphically continued to the left of α ( G ) \\alpha (G) and that, on the line { s â C ⣠R e ( s ) = α ( G ) } \\{s\\in \\mathbb {C} \\mid \\mathrm {Re}(s) = \\alpha (G)\\} , the continued function is holomorphic except for a pole at s = α ( G ) s=\\alpha (G) . A Tauberian theorem yields a precise asymptotic result on the representation growth of G G in terms of the position and order of this pole. We obtain these results as a consequence of a result establishing uniform analytic properties of representation zeta functions of torsion-free finitely generated nilpotent groups of the form G ( O ) \\mathbf {G}(\\mathcal {O}) , where G \\mathbf {G} is a unipotent group scheme defined in terms of a nilpotent Lie lattice over the ring O \\mathcal {O} of integers of a number field. This allows us to show, in particular, that the abscissae of convergence of the representation zeta functions of such groups and their pole orders are invariants of G \\mathbf {G} , independent of O \\mathcal {O} .
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Springer International Publishing
Date: 2017
Publisher: Elsevier BV
Date: 06-2021
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Elsevier BV
Date: 09-2022
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2022
Publisher: Walter de Gruyter GmbH
Date: 09-2016
Abstract: Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertexts so that it also enables efficient matrix multiplication over the packed ciphertexts. Our packing method generalizes Yasuda et al.âs methods (Security Comm. Networks 2015 and ACISP 2015), which are for secure inner product. We also implement our methods and give a comparison with previous packing methods.
Publisher: Springer Science and Business Media LLC
Date: 06-02-2016
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)
Date: 09-2019
Publisher: Institution of Engineering and Technology (IET)
Date: 03-2020
Publisher: IEEE
Date: 11-2019
Publisher: Springer International Publishing
Date: 2022
Publisher: Institute of Electronics, Information and Communications Engineers (IEICE)
Date: 2017
Publisher: Informa UK Limited
Date: 08-12-2016
Publisher: Institution of Engineering and Technology (IET)
Date: 05-2020
Publisher: Walter de Gruyter GmbH
Date: 17-09-2014
Abstract: We prove that if the probabilistic zeta function P G ( s ) ${P_G(s)}$ of a finitely generated profinite group G is rational and all but finitely many nonabelian composition factors of G are groups of Lie type in a fixed characteristic or sporadic simple groups, then G contains only finitely many maximal subgroups.
Start Date: 09-2021
End Date: 08-2025
Amount: $331,898.00
Funder: Australian Research Council
View Funded ActivityStart Date: 03-2022
End Date: 02-2025
Amount: $462,000.00
Funder: Australian Research Council
View Funded ActivityStart Date: 10-2023
End Date: 10-2026
Amount: $391,412.00
Funder: Australian Research Council
View Funded ActivityStart Date: 09-2020
End Date: 09-2023
Amount: $199,857.00
Funder: Australian Research Council
View Funded Activity