Jiabo Wang

Dr. Jiabo Wang

Tsinghua University
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
15 June 2021 in IEEE Communications Letters
Verified
Journal Article
Closed access
JLJieni Lin
Jieni Lin
JQJunren Qin
Junren Qin
SLShanxiang Lyu
Shanxiang Lyu
BFBingwen Feng
Bingwen Feng
JWJiabo Wang
Jiabo Wang
Lattices have been conceived as a powerful tool for data hiding. While conventional studies and applications focus on achieving the optimal robustness versus distortion tradeoff, in some applications such as data hiding in medical/physiological signals, the primary concern is to achieve a minimum amount of distortion to the cover signal. In this letter, we revisit the celebrated quantization index modulation (QIM) scheme and propose a minimum-distortion version of it, referred to as MD-QIM. The crux of MD-QIM is to move the data point to only the boundary of the Voronoi region of the lattice point indexed by a message, which suffices for subsequent correct decoding. At any fixed code rate, the scheme achieves the minimum amount of distortion by sacrificing the robustness to the additive white Gaussian noise (AWGN) attacks. Simulation results confirm that our scheme significantly outperforms QIM in terms of mean square error (MSE), peak signal to noise ratio (PSNR) and percentage residual difference (PRD).

29 December 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Open access
LZLinru Zhang
Linru Zhang
XWXiangning Wang
Xiangning Wang
JWJiabo Wang
Jiabo Wang
RPRachael Pung
Rachael Pung
Huaxiong WangHuaxiong Wang
Huaxiong Wang
KLKwok-Yan Lam
Kwok-Yan Lam
Internet of Medical Things (IoMTs) is revolutionizing the healthcare industry regarding how diagnosis process takes place, how treatment is provided, and how public health policies are made. A real-world use case of IoMTs is to investigate how infectious diseases, e.g. COVID-19, spread in a population through social events. In this use case, people’s social contact records in certain venues are collected by sensors and saved locally; pandemic modellers, as third-party vendors, are desired to construct social contact network based on contacts records, and to simulate the process of disease transmission over the contact network by transmission modelling; results from the simulation will be provided to authorities for policymaking and pandemic control. However, concerns are raised on data breaches from modellers. In reality, sharing the data in clear with modellers is not allowed by regulations for the sake of privacy. In this work, we will be addressing the contradiction between data privacy and usability when vendors are involved in IoMTs. We propose a secure cloud-edge computing architecture based on an efficient fully homomorphic encryption (FHE) scheme. This architecture allows vendors to securely and “blindly” process medical data without compromising the quality of their service. Moreover, we apply the proposed architecture to the use case of pandemic modelling. By comparisons with a differential privacy-based solution, we demonstrate the favorable feasibility, accuracy and security of the proposed solution.

10 January 2023 in Cryptography
Verified
Journal Article
Open access
PDF file
IPIason Papadopoulos
Iason Papadopoulos
JWJiabo Wang
Jiabo Wang
In modern society, the Internet is one of the most used means of communication. Thus, secure information transfer is inevitably of major importance. Computers nowadays use encryption methods based on arithmetic operations to turn messages into ciphertexts that are practically impossible for an attacker to reverse-engineer using a classical computer. Lately, it has been proven that this is possible in a post-quantum setting where quantum computers of considerable size are available to attackers. With the advance of technology of quantum computers, it is now more necessary than ever before to construct encryption schemes that cannot be broken either using a classical or a quantum computer. The National Institute of Technology and Standards (NIST) has orchestrated a competition, and numerous encryption schemes have been proposed. The NIST has identified one algorithm to be standardized for the post-quantum era. This algorithm is called CRYSTALS-Kyber and is based on module learning with errors (MLWE). This paper investigates how to apply error correcting codes in order to create some excess decryption failure rate (DFR) and to take advantage of that in order to re-tune Kyber’s parameters in the pursuit of higher security. By applying Polar Codes, Kyber’s security was managed to be increased by 54.4% under a new set of parameters, while keeping the decryption failure rate well below the upper acceptable bound set by the NIST.

23 July 2021 in Entropy
Verified
Journal Article
Open access
PDF file
JWJiabo Wang
Jiabo Wang
Cong LingCong Ling
Cong Ling
There exists a natural trade-off in public key encryption (PKE) schemes based on ring learning with errors (RLWE), namely: we would like a wider error distribution to increase the security, but it comes at the cost of an increased decryption failure rate (DFR). A straightforward solution to this problem is the error-correcting code, which is commonly used in communication systems and already appears in some RLWE-based proposals. However, applying error-correcting codes to those cryptographic schemes is far from simply installing an add-on. Firstly, the residue error term derived by decryption has correlated coefficients, whereas most prevalent error-correcting codes with remarkable error tolerance assume the channel noise to be independent and memoryless. This explains why only simple error-correcting methods are used in existing RLWE-based PKE schemes. Secondly, the residue error term has correlated coefficients leaving accurate DFR estimation challenging even for uncoded plaintext. It can be found in the literature that a tighter DFR estimation can effectively create a DFR margin. Thirdly, most error-correcting codes are not well designed for safety considerations, e.g., syndrome decoding has a nonconstant time nature. A code good at error correcting might be weak under a variety of attacks. In this work, we propose a polar coding scheme for RLWE-based PKE. A relaxed “independence” assumption is used to derive an uncorrelated residue noise term, and a wireless communication strategy, outage, is used to construct polar codes. Furthermore, some knowledge about the residue noise is exploited to improve the decoding performance. With the parameterization of NewHope Round 2, the proposed scheme creates a considerable DRF margin, which gives a competitive security improvement compared to state-of-the-art benchmarks. Specifically, the security is improved by 28.8%, while a DFR of 2−149 is achieved a for code rate pf 0.25, n=1024,q= 12,289, and binomial parameter k=55. Moreover, polar encoding and decoding have a quasilinear complexity O(Nlog2N) and intrinsically support constant-time implementations.

24 September 2022 in Cryptography and Communications
Verified
Journal Article
Open access
PDF file
JWJiabo Wang
Jiabo Wang
Cong LingCong Ling
Cong Ling
The ring learning with errors (RLWE) problem can be used to construct efficient post-quantum public key encryption schemes. An error distribution, normally a Gaussian-like distribution, is involved in the RLWE problem. In this work we focus on using polar codes to alleviate a natural trade-off present in RLWE public key encryption schemes; namely, we would like a wider error distribution to increase security, but a wider error distribution comes at the cost of an increased probability of decryption error. The motivation of this work is to improve the bit-security level by using wider error distribution while keeping the target decryption failure rate achievable. The approach we proposed in this work is twofold. Firstly, we formulate RLWE public key encryption as a channel model with some noise terms known by the decoder. This makes our approach distinguished from existing research of this kind in the literature which ignores these known terms. Secondly, we design polar codes for the derived channel model. Theoretically and numerically, we show the proposed modeling and polar coding scheme contributes to a considerable bit-security level improvement compared with NewHope, a submission to National Institute of Standards and Technology (NIST), with almost the same parameters. Moreover, polar encoding and decoding support isochronous implementations in the sense that the timings of associated operations are irrelevant to the sensitive information.

31 March 2022 in Journal of Innovation and Social Science Research
Verified
Journal Article
Open access
JWJiabo Wang
Jiabo Wang
JYJing Yang
Jing Yang