Geong Sen Poh

Dr. Geong Sen Poh

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
19 February 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
Jiguo LiJiguo Li
Jiguo Li
YZYichen Zhang
Yichen Zhang
Jianting NingJianting Ning
Jianting Ning
XHXinyi Huang
Xinyi Huang
GPGeong Sen Poh
Geong Sen Poh
DWDebang Wang
Debang Wang
The pervasive, ubiquitous, and heterogeneous properties of IoT make securing IoT systems a very challenging task. More so when access and storage are performed through a cloud-based IoT system. IoT data stored on cloud should be encrypted to ensure data privacy. It is also crucial to allow only authorized entities to access and decrypt the encrypted data. In this work, we propose a ciphertext-policy attribute-based encryption (CP-ABE) scheme that enables fine-grained access control of encrypted IoT data on cloud. CP-ABE is regarded as a highly promising approach to provide flexible and fine-grained access control, which is very much suited to secure cloud based IoT systems. We first present an access control system model of CloudIoT platform by using ABE. Based on the presented system model, we construct a ciphertext-policy hiding CP-ABE scheme, which guarantees the privacy of the users. We further construct a white-box traceable CP-ABE scheme with accountability in order to address the user key abuse and authorization center key abuse. Experiment illustrates the proposed systems are efficient.

20 June 2019 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
HLHoon Wei Lim
Hoon Wei Lim
GPGeong Sen Poh
Geong Sen Poh
JXJia Xu
Jia Xu
VCVarsha Chittawar
Varsha Chittawar
In privacy-enhancing technology, it has been inevitably challenging to strike a reasonable balance between privacy, efficiency and usability (utility). To this, we propose a highly practical solution for privacy-preserving integration and sharing of datasets among a group of participants. At the heart of our solution is a new interactive protocol, PrivateLink. Through PrivateLink, each participant is able to randomize her dataset via an independent and untrusted third party, such that the resulting dataset can be merged with other randomized datasets contributed by other participants in a privacy-preserving manner. Our approach does not require key sharing among participants in order to integrate different datasets. This, in turn, leads to a user-friendly and scalable solution. Moreover, the correctness of a randomized dataset returned by the third party can be securely verified by the participant. We further demonstrate PrivateLink’s general utilities, using it to construct a structure-preserving data integration protocol. This is particularly useful for private, fine-grained integration of network traffic data. We state security of our protocols under the well-established real-ideal simulation paradigm and demonstrate practicality by a prototype implementation on: (1) healthcare datasets and (2) DNS and NetFlow datasets.

12 August 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
Jianting NingJianting Ning
Jianting Ning
GPGeong Sen Poh
Geong Sen Poh
XHXinyi Huang
Xinyi Huang
RDRobert H. Deng
Robert H. Deng
SCShuwei Cao
Shuwei Cao
ECEe-Chien Chang
Ee-Chien Chang
Recently, reconstruction attacks on static encrypted database supporting range queries have been proposed. However, attacks on encrypted database within two updates in the similar setting have not been studied extensively. As far as we know, the only work is the update recovery attack presented by Grubbs et al. (CCS 2018). Following their seminal work, we present new update recovery attacks for dense dataset (i.e. at least one record corresponding to each value in the range), which enable a deeper understanding of the impact caused by leakages due to updates on dynamic encrypted database. Our first attack aims at recovering the value of a newly added record in the case of one database update. We further demonstrate that the attack can fully reconstruct the database counts if the updated value is either the minimum or maximum in the range. We then consider a setting where two distinct records are added separately, which leads to our second attack. We next extend our attacks to the setting where the update operation is deletion. To the best of our knowledge, update recovery attack on database supporting deletion has not been considered before. We demonstrate practicality of our attack via extensive simulations using real dataset.

7 June 2017 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
GPGeong Sen Poh
Geong Sen Poh
MMMoesfa Soeheila Mohamad
Moesfa Soeheila Mohamad
JCJi-Jian Chin
Ji-Jian Chin

4 July 2017 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
WLWai-Kong Lee
Wai-Kong Lee
RPRaphael C.-W. Phan
Raphael C.-W. Phan
GPGeong Sen Poh
Geong Sen Poh
BGBok-Min GoiBokMin
Bok-Min GoiBokMin