ORCID Profile
0000-0002-4949-7738
Current Organisation
Singapore Management University
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.
Computer System Security | Data Format | Data Encryption | Data Format not elsewhere classified | Computer Software |
Expanding Knowledge in the Information and Computing Sciences | Communication Networks and Services not elsewhere classified | Information Processing Services (incl. Data Entry and Capture) | Expanding Knowledge in Technology
Publisher: MDPI AG
Date: 08-12-2015
DOI: 10.3390/INFO6040833
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Elsevier BV
Date: 11-2014
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2022
Publisher: Springer Science and Business Media LLC
Date: 24-07-2017
Publisher: Oxford University Press (OUP)
Date: 14-11-2020
Abstract: In this paper, we introduce a new construction for linkable secret handshake that allows authenticated users to perform handshake anonymously within allowable times. We define formal security models for the new construction, and prove that it can achieve session key security, anonymity, untraceability and linkable affiliation-hiding. In particular, the proposed construction ensures that (i) anyone can trace the real identities of dishonest users who perform handshakes for more than k times and (ii) an optimal communication cost between authorized users is achieved by exploiting the proof of knowledges.
Publisher: Elsevier BV
Date: 11-2008
Publisher: Elsevier BV
Date: 06-2007
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer International Publishing
Date: 2021
Publisher: Wiley
Date: 05-07-2014
DOI: 10.1002/CPE.3094
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2018
Publisher: Inderscience Publishers
Date: 2017
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2015
Publisher: Elsevier BV
Date: 2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Springer Science and Business Media LLC
Date: 25-07-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2020
Publisher: Association for Computing Machinery (ACM)
Date: 22-05-2020
DOI: 10.1145/3379464
Abstract: Outsourcing helps relocate data from the cyber-physical system (CPS) for efficient storage at low cost. Current server-based outsourcing mainly focuses on the benefits of servers. This cannot attract users well, as their security, efficiency, and economy are not guaranteed. To solve with this issue, a hybrid outsourcing model that exploits both cloud server and edge devices to store data is needed. Meanwhile, the requirements of security and efficiency are different under specific scenarios. There is a lack of a comprehensive solution that considers all of the above issues. In this work, we overcome the above issues by proposing the first hybrid user-centric data outsourcing (HUCDO) scheme. It allows users to outsource data securely, efficiently, and economically via different CPSs. Brielly, our contributions consist of theories, implementations, and evaluations. Our theories include the first homomorphic collision-resistant chameleon hash (HCCH) and homomorphic designated-receiver signcryption (HDRS). As implementations, we instantiate how to use our proposals to outsource small- or large-scale data through distinct CPS, respectively. Additionally, a blockchain with proof-of-discrete-logarithm (B-PoDL) is instantiated to help improve our performance. Last, as demonstrated by our evaluations, our proposals are secure, efficient, and economic for users to implement while outsourcing their data via CPSs.
Publisher: Springer International Publishing
Date: 2015
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2020
Publisher: Oxford University Press (OUP)
Date: 10-09-2020
Abstract: Subversion of cryptography has received wide attentions especially after the Snowden Revelations in 2013. Most of the currently proposed subversion attacks essentially rely on the freedom of randomness choosing in the cryptographic protocol to hide backdoors embedded in the cryptosystems. Despite the fact that significant progresses in this line of research have been made, most of them mainly considered the classical setting, while the research gap regarding subversion attacks against post-quantum cryptography remains tremendous. Inspired by this observation, we investigate a subversion attack against existing protocol that is proved post-quantum secure. Particularly, we show an efficient way to undetectably subvert the well-known lattice-based encryption scheme proposed by Regev (STOC 2005). Our subversion enables the subverted algorithm to stealthily leak arbitrary messages to the outsider who knows the backdoor. Through theoretical analysis and experimental observations, we demonstrate that the subversion attack against the LWE encryption scheme is feasible and practical.
Publisher: Springer International Publishing
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2020
Publisher: Springer Berlin Heidelberg
Date: 2016
Publisher: Elsevier BV
Date: 2011
Publisher: IEEE
Date: 06-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2019
Publisher: ACM
Date: 24-05-2021
Publisher: Elsevier BV
Date: 10-2021
Publisher: Association for Computing Machinery (ACM)
Date: 04-2014
DOI: 10.1145/2584681
Abstract: We revisit the problem of secure cross-domain communication between two users belonging to different security domains within an open and distributed environment. Existing approaches presuppose that either the users are in possession of public key certificates issued by a trusted certificate authority (CA), or the associated domain authentication servers share a long-term secret key. In this article, we propose a generic framework for designing four-party password-based authenticated key exchange (4PAKE) protocols. Our framework takes a different approach from previous work. The users are not required to have public key certificates, but they simply reuse their login passwords, which they share with their respective domain authentication servers. On the other hand, the authentication servers, assumed to be part of a standard PKI, act as ephemeral CAs that certify some key materials that the users can subsequently use to exchange and agree on as a session key. Moreover, we adopt a compositional approach. That is, by treating any secure two-party password-based key exchange (2PAKE) protocol and two-party asymmetric-key/symmetric-key-based key exchange (2A/SAKE) protocol as black boxes, we combine them to obtain generic and provably secure 4PAKE protocols.
Publisher: Elsevier BV
Date: 05-2018
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Springer Science and Business Media LLC
Date: 22-06-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Elsevier BV
Date: 08-2017
Publisher: Springer Science and Business Media LLC
Date: 07-06-2013
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
Publisher: Wiley
Date: 14-06-2014
DOI: 10.1002/SEC.816
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer Science and Business Media LLC
Date: 12-2012
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2023
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2017
Publisher: Oxford University Press (OUP)
Date: 26-04-2019
Abstract: Thanks to the ease of access and low expenses, it is now popular for people to store data in cloud servers. To protect sensitive data from being leaked to the outside, people usually encrypt the data in the cloud. However, management of these encrypted data becomes a challenging problem, e.g. data classification. Besides, how to selectively share data with other users is also an important and interesting problem in cloud storage. In this paper, we focus on ciphertext-policy attribute based encryption with equality test (CP-ABEET). People can use CP-ABEET to implement not only flexible authorization for the access to encrypted data, but also efficient data label classification, i.e. test of whether two encrypted data contain the same message. We construct an efficient CP-ABEET scheme, and prove its security based on a reasonable number-theoretic assumption. Compared with the only existing CP-ABEET scheme, our construction is more efficient in key generation, and has shorter attribute-related secret keys and better security.
Publisher: Springer Science and Business Media LLC
Date: 03-2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2007
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11935308_7
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer International Publishing
Date: 2018
Publisher: IEEE
Date: 04-2013
Publisher: Elsevier BV
Date: 2014
Publisher: Springer Science and Business Media LLC
Date: 02-11-2017
Publisher: Springer International Publishing
Date: 2018
Publisher: Informa UK Limited
Date: 25-03-2017
Publisher: Springer International Publishing
Date: 2016
Publisher: Oxford University Press (OUP)
Date: 25-10-2018
Publisher: Springer Berlin Heidelberg
Date: 2008
Publisher: Springer Science and Business Media LLC
Date: 09-09-2017
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Science and Business Media LLC
Date: 14-10-2015
Publisher: Elsevier BV
Date: 02-2021
Publisher: Oxford University Press (OUP)
Date: 14-01-2021
Abstract: In this paper, we introduce a new construction for unlinkable secret handshake that allows a group of users to perform handshakes anonymously. We define formal security models for the proposed construction and prove that it can achieve session key security, anonymity and affiliation hiding. In particular, the proposed construction ensures that (i) anonymity against protocol participants (including group authority) is achieved since a hierarchical identity-based signature is used in generating group user’s pseudonym-credential pairs and (ii) revocation is achieved using a secret sharing-based revocation mechanism.
Publisher: Springer Berlin Heidelberg
Date: 2007
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11496137_23
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
Publisher: Wiley
Date: 14-07-2016
DOI: 10.1002/SEC.1529
Publisher: Springer International Publishing
Date: 2016
Publisher: World Scientific Pub Co Pte Lt
Date: 09-2017
DOI: 10.1142/S0129054117400159
Abstract: Attribute-based authenticated key exchange (AB-AKE) is a useful primitive that allows a group of users to establish a shared secret key and at the same time enables fine-grained access control. A straightforward approach to design an AB-AKE protocol is to extend a key exchange protocol using an attribute-based authentication technique. However, insider security is a challenge security issue for AB-AKE in the multi-party setting and cannot be solved using the straightforward approach. In addtion, many existing key exchange protocols for the multi-party setting (e.g., the well-known Burmester-Desmedt protocol) require multiple broadcast rounds to complete the protocol. In this paper, we propose a novel one-round attribute-based key exchange (OAKE) protocol in the multi-party setting. We define the formal security models, including session key security, insider security and user privacy, for OAKE, and prove the security of the proposed protocol under some standard assumptions in the random oracle model.
Publisher: World Scientific Pub Co Pte Lt
Date: 06-2019
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11745853_23
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2010
Publisher: ACM
Date: 30-05-2016
Publisher: Springer Berlin Heidelberg
Date: 2016
Publisher: WORLD SCIENTIFIC
Date: 04-2011
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Hindawi Limited
Date: 06-08-2018
DOI: 10.1155/2018/6925019
Abstract: Proxy signature is a useful cryptographic primitive that has been widely used in many applications. It has attracted a lot of attention since it was introduced. There have been lots of works in constructing efficient and secure proxy signature schemes. In this paper, we identify a new attack that has been neglected by many existing proven secure proxy signature schemes. We demonstrate this attack by launching it against an identity-based proxy signature scheme which is proven secure. We then propose one method that can effectively prevent this attack. The weakness in some other proxy signature schemes can also be fixed by applying the same method.
Publisher: ACM
Date: 03-11-2014
Publisher: Elsevier BV
Date: 11-2008
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2019
Publisher: Springer International Publishing
Date: 2015
Publisher: IEEE
Date: 09-2015
Publisher: Springer International Publishing
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2020
Publisher: Springer International Publishing
Date: 2017
Publisher: IEEE
Date: 08-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2023
Publisher: Oxford University Press (OUP)
Date: 28-04-2020
Abstract: Hierarchical identity-based signature (HIBS) plays a core role in a large community as it significantly reduces the workload of the root private key generator. To make HIBS still available and secure in post-quantum era, constructing lattice-based schemes is a promising option. In this paper, we present an efficient HIBS scheme in polynomial rings. Although there are many lattice-based signatures proposed in recent years, to the best of our knowledge, our HIBS scheme is the first ring-based construction. In the center of our construction are two new algorithms to extend lattice trapdoors to higher dimensions, which are non-trivial and of independent interest. With these techniques, the security of the new scheme can be proved, assuming the hardness of the Ring-SIS problem. Since operations in the ring setting are much faster than those over integers and the new construction is the first ring-base HIBS scheme, our scheme is more efficient and practical in terms of computation and storage cost when comparing to the previous constructions.
Publisher: Springer Science and Business Media LLC
Date: 19-07-2016
Publisher: Elsevier BV
Date: 10-2022
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2016
Publisher: Springer International Publishing
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Elsevier BV
Date: 02-2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Elsevier BV
Date: 08-2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2014
Publisher: ACM
Date: 22-03-2011
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2016
Publisher: Springer Science and Business Media LLC
Date: 25-01-2016
Publisher: Springer Science and Business Media LLC
Date: 24-08-2011
Publisher: Oxford University Press (OUP)
Date: 28-09-2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2018
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Publisher: Elsevier BV
Date: 09-2011
Publisher: Springer International Publishing
Date: 2021
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2022
Publisher: Oxford University Press (OUP)
Date: 03-11-2018
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11600930_50
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2022
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11556992_16
Publisher: Springer International Publishing
Date: 2015
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11506157_35
Publisher: Elsevier BV
Date: 2019
Publisher: Elsevier BV
Date: 07-2020
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer International Publishing
Date: 2014
Publisher: Elsevier BV
Date: 03-2018
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: MDPI AG
Date: 04-04-2018
DOI: 10.3390/SYM10040095
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2019
Publisher: Springer International Publishing
Date: 2017
Publisher: Elsevier BV
Date: 03-2011
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer International Publishing
Date: 2016
Publisher: Elsevier BV
Date: 04-2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-2022
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Springer International Publishing
Date: 2014
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2011
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Oxford University Press (OUP)
Date: 17-11-2013
Publisher: Springer International Publishing
Date: 2021
Publisher: MDPI AG
Date: 29-12-2016
DOI: 10.3390/S17010053
Publisher: Springer International Publishing
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2017
Publisher: Springer Berlin Heidelberg
Date: 2009
Publisher: Elsevier BV
Date: 05-2019
Publisher: Springer International Publishing
Date: 2019
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2016
Publisher: Elsevier BV
Date: 03-2022
Publisher: Elsevier BV
Date: 03-2022
Publisher: Springer Berlin Heidelberg
Date: 2010
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2021
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 03-2016
Publisher: Elsevier BV
Date: 08-2019
Publisher: Springer International Publishing
Date: 2016
Publisher: Oxford University Press (OUP)
Date: 04-01-2011
Publisher: Springer International Publishing
Date: 2015
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer Science and Business Media LLC
Date: 09-2018
Publisher: Springer Berlin Heidelberg
Date: 2016
Publisher: Springer International Publishing
Date: 2017
Publisher: arXiv
Date: 2019
Publisher: Springer International Publishing
Date: 2017
Publisher: Elsevier BV
Date: 2015
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer International Publishing
Date: 2014
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2016
Start Date: 09-2021
End Date: 08-2025
Amount: $331,898.00
Funder: Australian Research Council
View Funded ActivityStart Date: 06-2020
End Date: 06-2024
Amount: $342,074.00
Funder: Australian Research Council
View Funded ActivityStart Date: 01-2015
End Date: 06-2018
Amount: $315,000.00
Funder: Australian Research Council
View Funded Activity