Shangqi Lai

Shangqi Lai

Auto-generated profile, based on publicly available information

Shangqi Lai

The University of Melbourne

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 October 2018
Verified
Conference Paper
Open access
SLShangqi Lai
Shangqi Lai
SPSikhar Patranabis
Sikhar Patranabis
Amin SakzadAmin Sakzad
Amin Sakzad
JLJoseph K. Liu
Joseph K. Liu
DMDebdeep Mukhopadhyay
Debdeep Mukhopadhyay
CZCong Zuo
Cong Zuo
The recently proposed Oblivious Cross-Tags (OXT) protocol (CRYPTO 2013) has broken new ground in designing efficient searchable symmetric encryption (SSE) protocol with support for conjunctive keyword search in a single-writer single-reader framework. While the OXT protocol offers high performance by adopting a number of specialised data-structures, it also trades-off security by leaking 'partial' database information to the server. Recent attacks have exploited similar partial information leakage to breach database confidentiality. Consequently, it is an open problem to design SSE protocols that plug such leakages while retaining similar efficiency. In this paper, we propose a new SSE protocol, called Hidden Cross-Tags (HXT), that removes 'Keyword Pair Result Pattern' (KPRP) leakage for conjunctive keyword search. We avoid this leakage by adopting two additional cryptographic primitives - Hidden Vector Encryption (HVE) and probabilistic (Bloom filter) indexing into the HXT protocol. We propose a 'lightweight' HVE scheme that only uses efficient symmetric-key building blocks, and entirely avoids elliptic curve-based operations. At the same time, it affords selective simulation-security against an unbounded number of secret-key queries. Adopting this efficient HVE scheme, the overall practical storage and computational overheads of HXT over OXT are relatively small (no more than 10% for two keywords query, and 21% for six keywords query), while providing a higher level of security.

27 January 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
YZYifeng Zheng
Yifeng Zheng
SLShangqi Lai
Shangqi Lai
YLYi Liu
Yi Liu
XYXingliang Yuan
Xingliang Yuan
XYXun Yi
Xun Yi
CWCong Wang
Cong Wang
Federated learning has recently emerged as a paradigm promising the benefits of harnessing rich data from diverse sources to train high quality models, with the salient features that training datasets never leave local devices. Only model updates are locally computed and shared for aggregation to produce a global model. While federated learning greatly alleviates the privacy concerns as opposed to learning with centralized data, sharing model updates still poses privacy risks. In this paper, we present a system design which offers efficient protection of individual model updates throughout the learning procedure, allowing clients to only provide obscured model updates while a cloud server can still perform the aggregation. Our federated learning system first departs from prior works by supporting lightweight encryption and aggregation, and resilience against drop-out clients with no impact on their participation in future rounds. Meanwhile, prior work largely overlooks bandwidth efficiency optimization in the ciphertext domain and the support of security against an actively adversarial cloud server, which we also fully explore in this paper and provide effective and efficient mechanisms. Extensive experiments over several benchmark datasets (MNIST, CIFAR-10, and CelebA) show our system achieves accuracy comparable to the plaintext baseline, with practical performance.

1 November 2019 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
SKShabnam Kasra Kermanshahi
Shabnam Kasra Kermanshahi
Joseph LiuJoseph Liu
Joseph Liu
RSRon Steinfeld
Ron Steinfeld
SNSurya Nepal
Surya Nepal
SLShangqi Lai
Shangqi Lai
CZCong Zuo
Cong Zuo
We propose a multi-client Symmetric Searchable Encryption (SSE) scheme based on the single-user protocol [3] . The scheme allows any user to generate a search query by interacting with any θ is a threshold parameter) `helping' users. It preserves the privacy of a database content against the server assuming a leakage of up to θ-1 users' keys to the server while hiding the query from the θ-1 `helping users'. To achieve the query privacy, we design a new distributed key-homomorphic pseudorandom function (PRF) that hides the PRF input (search keyword) from the `helping' users. We present a concrete construction of our randomizable distributed PRF. By distributing the utilized keys among the users, the need for a constant online presence of the data owner to provide services to the users is eliminated, while providing resilience against a user key exposure. We extended our scheme to support user revocation in two different scenarios. In addition, we give a solution for fast update of the encryption key with the overhead significantly smaller than the re-encryption and re-uploading the database. Moreover, our scheme is secure against passive and active collusion between the server and a subset of users.

10 June 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
PZPeng Zhang
Peng Zhang
THTeng Huang
Teng Huang
XSXiaoqiang Sun
Xiaoqiang Sun
WZWei Zhao
Wei Zhao
HLHongwei Liu
Hongwei Liu
Joseph LiuJoseph Liu
Joseph Liu
The clustering algorithm is a useful tool for analyzing medical data. For instance, the k-means clustering can be used to study precipitating factors of a disease. In order to implement the clustering algorithm efficiently, data computation is outsourced to cloud servers, which may leak the private data. Encryption is a common method for solving this problem. But cloud servers are difficult to calculate ciphertexts from multiple parties. Hence, we choose multi-key fully homomorphic encryption (FHE), which supports computations on the ciphertexts that have different secret keys, to protect the private data. In this paper, based on Chen's multi-key FHE scheme, we first propose secure squared euclidean, comparison, minimum, and average protocols. Then, we design the basic and advanced schemes for implementing the secure multi-party k-means clustering algorithm. In the basic scheme, the implementation of homomorphic multiplication includes the process of transforming ciphertexts under different keys. In order to implement homomorphic multiplication efficiently, the advanced scheme uses an improved method to transform ciphertexts. Meanwhile, almost all computations are completely outsourced to cloud servers. We prove that the proposed protocols and schemes are secure and feasible. Simulation results also show that our improved method is helpful for improving the homomorphic multiplication of Chen's multi-key FHE scheme.

2 July 2019
Verified
Conference Paper
Open access
PDF file
SLShangqi Lai
Shangqi Lai
XYXingliang Yuan
Xingliang Yuan
SSShi-Feng Sun
Shi-Feng Sun
JLJoseph K. Liu
Joseph K. Liu
YLYuhong Liu
Yuhong Liu
DLDongxi Liu
Dongxi Liu

11 March 2021 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
SLShangqi Lai
Shangqi Lai
XYXingliang Yuan
Xingliang Yuan
SSShi-Feng Sun
Shi-Feng Sun
Joseph LiuJoseph Liu
Joseph Liu
RSRon Steinfeld
Ron Steinfeld
DLDongxi Liu
Dongxi Liu
Network Function Virtualisation (NFV) advances the adoption of composable software middleboxes. Accordingly, cloud data centres become major NFV vendors for enterprise traffic processing. Due to the privacy concern of traffic redirection to the cloud, secure middlebox systems (e.g., BlindBox) draw much attention; they can process encrypted packets against encrypted rules directly. However, most of the existing systems supporting pattern matching based network functions require the enterprise gateway to tokenise packet payloads via sliding windows. Such tokenisation induces a considerable communication overhead, which can be over 100× to the packet size. To overcome this bottleneck, in this article, we propose the first bandwidth-efficient encrypted pattern matching protocol for secure middleboxes. We resort to a primitive called symmetric hidden vector encryption (SHVE), and propose a variant of it, aka SHVE+, to achieve constant and moderate communication cost. To speed up, we devise encrypted filters to reduce the number of accesses to SHVE+ during matching highly. We formalise the security of our proposed protocol and conduct comprehensive evaluations over real-world rulesets and traffic dumps. The results show that our design can inspect a packet over 20 k rules within 100 $\mu$ s. Compared to prior work, it brings a saving of 94 percent in bandwidth consumption.