Article
Computer Science, Information Systems
Nazatul Haque Sultan, Nesrine Kaaniche, Maryline Laurent, Ferdous Ahmed Barbhuiya
Summary: This paper proposes a novel expressive authorized keyword search scheme based on ciphertext-policy attribute-based encryption. It supports multi-owner and multi-user scenarios, enables conjunctive keyword search, and has efficient performance.
IEEE TRANSACTIONS ON CLOUD COMPUTING
(2022)
Article
Computer Science, Information Systems
Yuan Zhang, Chunxiang Xu, Jianbing Ni, Hongwei Li, Xuemin (Sherman) Shen
Summary: This paper presents a secure PEKS scheme called SEPSE, which can defend against keyword guessing attacks by allowing users to encrypt keywords with dedicated key servers and supporting key renewal. Furthermore, SEPSE can resist online KGA through a public blockchain, enabling key servers to learn the number of keyword requests made by users.
IEEE TRANSACTIONS ON CLOUD COMPUTING
(2021)
Article
Computer Science, Theory & Methods
Jiabei Wang, Rui Zhang, Jianhao Li, Yuting Xiao
Summary: Metadata plays a crucial role in data organizing, finding, and understanding, but balancing between protection and functionality is challenging. This paper proposes a secure and flexible mechanism for processing metadata, addressing the dilemma between encryption and usability. The proposed scheme, MD-AKS, enables authorized keyword search over encrypted data with metadata, ensuring privacy and addressing previous research gaps. Theoretical comparisons and experimental results demonstrate the effectiveness and scalability of the proposed approach.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2022)
Article
Computer Science, Information Systems
Peiming Xu, Jiahui Chen, Yiwei Yang, Jianting Ning
Summary: In the context of multiuser search scenarios over encrypted cloud data, the multiuser searchable encryption (MUSE) technology provides a feasible solution for privacy protection and operability. However, current MUSE technologies have practical limitations regarding secure channels, trusted third parties (TTPs), and resistance to keyword guessing attacks (KGAs). To address these issues, this article proposes a practical solution called DuMSE, which eliminates the need for secure channels and TTPs while also resisting KGAs. Additionally, a dynamic solution called dDuMSE is introduced to support dynamically updating data.
IEEE INTERNET OF THINGS JOURNAL
(2023)
Article
Computer Science, Information Systems
Biwen Chen, Libing Wu, Sherali Zeadally, Debiao He
Summary: Efficient and secure search of sensitive data in cloud storage is a challenging problem. Searchable encryption technique provides a solution that preserves data confidentiality and usability. However, traditional PEKS schemes are vulnerable to inside keyword guessing attacks. To address this problem, the notion of Dual-server Public-key Authenticated Encryption with Keyword Search (DPAEKS) is introduced, which leverages two non-cooperating servers to resist inside keyword guessing attacks and supports authentication. A construction of DPAEKS without bilinear pairings is provided.
IEEE TRANSACTIONS ON CLOUD COMPUTING
(2022)
Article
Computer Science, Theory & Methods
Hongbo Li, Qiong Huang, Jianye Huang, Willy Susilo
Summary: To improve the quality of medical care and reduce unnecessary medical errors, electronic medical records (EMRs) are widely applied in hospital information systems. However, the increasing EMRs bring heavy storage burden to hospitals. Cloud server can save the hospital local storage and realize EMRs sharing among external researchers. This paper proposes a secure and efficient cloud storing and sharing method called PAUKS.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2023)
Article
Computer Science, Theory & Methods
Fucai Luo, Haiyan Wang, Changlu Lin, Xingfu Yan
Summary: The widespread adoption of cloud computing and exponential growth of data necessitate secure data sharing and querying. Existing attribute-based keyword search (ABKS) schemes suffer from high end-to-end delay and vulnerability to quantum computer attacks and keyword guessing attacks (KGA). In this paper, we propose a new concept called attribute-based authenticated encryption with keyword search (ABAEKS) and an efficient ABAEKS scheme to address these vulnerabilities. Our ABAEKS has low end-to-end delay, is resistant to quantum computer attacks and KGA, and outperforms current state-of-the-art ABKS schemes, as shown in our comprehensive performance evaluation.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2023)
Article
Computer Science, Hardware & Architecture
Mohammed Raouf Senouci, Ilyas Benkhaddra, Abdelkader Senouci, Fagen Li
Summary: Data security and privacy have become major concerns for companies providing cloud storage services due to increasing data breaches. CLPEKS encryption allows for keyword search over encrypted data while maintaining privacy, with a new proposed scheme showing improved performance and resistance against various keyword guessing attacks.
JOURNAL OF SYSTEMS ARCHITECTURE
(2021)
Article
Computer Science, Information Systems
Yang Lu, Jiguo Li, Yichen Zhang
Summary: Searchable public key encryption (SPKE) is a new cryptographic framework that allows keyword searches on untrusted storage servers while protecting communication privacy. The certificate-based searchable encryption framework can effectively resist keyword guessing attacks, achieve implicit authentication, and eliminate the need for a secure channel.
IEEE TRANSACTIONS ON SERVICES COMPUTING
(2021)
Article
Computer Science, Hardware & Architecture
Chengyu Hu, Zhen Li, Pengtao Liu, Rupeng Yang, Shanqing Guo, Hailong Zhang
Summary: This paper introduces a verifiable PEKS scheme that can efficiently verify the completeness and correctness of search results, considering security against side-channel attacks. The enhanced scheme can withstand attacks where adversaries obtain leakage information, and introduces a designated tester to enhance security against keyword guessing attacks.
MOBILE NETWORKS & APPLICATIONS
(2021)
Article
Computer Science, Hardware & Architecture
Jiguo Li, Min Wang, Yang Lu, Yichen Zhang, Huaqun Wang
Summary: To ensure security and privacy in cloud data storage, attribute-based keyword search (ABKS) allows data owners to upload encrypted data and authorize specific users to retrieve it. However, the vulnerability to keyword guessing attacks is a key issue, which is addressed in this paper by using data owner's private key to sign keywords and prevent unauthorized keyword generation. The proposed ABKS scheme is secure against chosen-plaintext attacks and demonstrates practical performance.
COMPUTER STANDARDS & INTERFACES
(2021)
Article
Computer Science, Information Systems
Feng Li, Jianfeng Ma, Yinbin Miao, Qi Jiang, Ximeng Liu, Kim-Kwang Raymond Choo
Summary: Searchable Symmetric Encryption (SSE) has attracted attention for enabling users to search encrypted data without decryption. However, existing SSE schemes suffer from low search efficiency and lack support for multi-keyword search, dynamic updates, and result verification. To address these issues, we propose a Verifiable and Dynamic Multi-keyword Search (VDMS) scheme using bitmap and RSA accumulator, offering efficient, verifiable, and updated multi-keyword search. The scheme employs bitmap as a data structure for indexes to improve search efficiency and reduce storage space. The combination of RSA accumulator and bitmap ensures result correctness. Security analysis shows that VDMS is adaptively secure against Chosen-Keyword Attacks (CKA), and experiments using real-world data demonstrate its efficiency and feasibility.
IEEE TRANSACTIONS ON CLOUD COMPUTING
(2023)
Article
Computer Science, Hardware & Architecture
Z. H. E. JIANG, K. A. ZHANG, L. I. A. N. G. L. I. A. N. G. WANG, J. I. A. N. T. I. N. G. NING
Summary: This paper introduces the concept of public key authenticated encryption with keyword search (PAEKS) and proposes a new primitive called forward secure public-key authenticated encryption with keyword search (FS-PAEKS). It also presents an efficient FS-PAEKS scheme supporting conjunctive query and demonstrates its forward security against chosen keyword attacks and keyword guessing attacks.
Article
Computer Science, Information Systems
Liwang Sun, Zhenfu Cao, Xiaolei Dong, Jiachen Shen
Summary: This article discusses the challenges of data storage and privacy protection in the Industrial Internet of Things (IIoT) environment and proposes a new Multi-recipient Certificateless Authenticated Encryption with Keyword Search (MCLAEKS) scheme that is efficient and capable of resisting attacks.
INFORMATION SCIENCES
(2023)
Article
Computer Science, Hardware & Architecture
Xiangyu Pan, Fagen Li
Summary: The paper discusses the concepts related to Public-key Encryption with Keyword Search (PEKS), introduces the new security models Multi-Ciphertext Indistinguishability (MCI) and Multi-Trapdoor Indistinguishability (MTI), and the proposed solution PAEKS is capable of achieving both MCI-security and MTI-security simultaneously.
JOURNAL OF SYSTEMS ARCHITECTURE
(2021)
Article
Computer Science, Theory & Methods
Hongbo Li, Qiong Huang, Jianye Huang, Willy Susilo
Summary: To improve the quality of medical care and reduce unnecessary medical errors, electronic medical records (EMRs) are widely applied in hospital information systems. However, the increasing EMRs bring heavy storage burden to hospitals. Cloud server can save the hospital local storage and realize EMRs sharing among external researchers. This paper proposes a secure and efficient cloud storing and sharing method called PAUKS.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2023)
Article
Computer Science, Hardware & Architecture
Shijin Chen, Willy Susilo, Yudi Zhang, Bo Yang, Mingwu Zhang
Summary: This paper proposes a flexible mechanism to provide privacy-preserving anomaly counting for time-series data in edge-assisted crowdsensing. It ensures the privacy of sensing data and anomaly counting results for data providers and requesters.
COMPUTER STANDARDS & INTERFACES
(2023)
Article
Computer Science, Information Systems
Jianghong Wei, Xiaofeng Chen, Jianfeng Wang, Willy Susilo, Ilsun You
Summary: This paper focuses on zero round-trip time (0-RTT) key exchange protocols and introduces a new cryptographic primitive called puncturable identity-based matchmaking key encapsulation mechanism (PIB-MKEM). Based on PIB-MKEM, a generic 0-RTT key exchange protocol with forward secrecy, mutual authentication, and replay resistance is proposed. The implementation of PIB-MKEM is also provided with extensive evaluations.
INFORMATION SCIENCES
(2023)
Article
Computer Science, Information Systems
Suryakanta Panda, Samrat Mondal, Ashok Kumar Das, Willy Susilo
Summary: Attribute-based encryption (ABE) is widely used for secure and efficient data sharing. However, ABE faces challenges in applications that require collaboration among data users due to its fixed access policy. This work introduces a proxy re-encryption mechanism to address this issue and has formally proven the security of the proposed system. Revocation of delegation rights is also demonstrated in the proposed system.
INTERNATIONAL JOURNAL OF INFORMATION SECURITY
(2023)
Article
Computer Science, Information Systems
Jingwei Lu, Hongbo Li, Jianye Huang, Sha Ma, Man Ho Allen Au, Qiong Huang
Summary: Transforming data into ciphertexts and storing them in the cloud database is a secure way to simplify data management. Certificateless public key authenticated encryption with keyword search (CLPAEKS) is a variant of PEKS that simplifies certificate management and resists keyword guessing attacks. This paper proposes an improved security model and a new CLPAEKS scheme that is secure under the improved security model based on the intractability of the DBDH problem and the DDH problem.
Article
Computer Science, Information Systems
Jinguang Han, Liqun Chen, Willy Susilo, Liquan Chen, Ge Wu
Summary: This paper proposes a delegatable FE-IP (DFE-IP) scheme which supports decryption delegation when authorized users are unavailable to access the system, without requiring re-encryption of ciphertexts. It also provides temporary delegation and flexible revocation.
INFORMATION SCIENCES
(2023)
Proceedings Paper
Computer Science, Artificial Intelligence
Shang Wang, Yansong Gao, Anmin Fu, Zhi Zhang, Yuqing Zhang, Willy Susilo, Dongxi Liu
Summary: This study proposes a new class of viable source-specific backdoor attacks called CASSOCK, which improves the attack performance of existing source-specific backdoor attacks by designing triggers with heterogeneous transparency to craft poisoned and cover datasets.
PROCEEDINGS OF THE 2023 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, ASIA CCS 2023
(2023)
Proceedings Paper
Computer Science, Information Systems
Wei Zong, Yang-Wai Chow, Willy Susilo, Kien Do, Svetha Venkatesh
Summary: This paper presents TrojanModel, a practical Trojan attack against Automatic Speech Recognition (ASR) systems, which achieves high attack success rates using unsuspicious sounds as triggers, such as background music, without requiring retraining of the target model.
2023 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, SP
(2023)
Article
Computer Science, Theory & Methods
Xueqiao Liu, Guomin Yang, Willy Susilo, Kai He, Robert H. Deng, Jian Weng
Summary: This paper proposes a computation framework for protecting sensitive data privacy, which can be applied to computation tasks with multiple input sources and/or multiple output recipients. The framework ensures privacy for the entire computation process and supports basic operations in Boolean circuits. In addition, it presents a privacy-preserving Bloom Filter and a multi-keyword searchable encryption scheme based on the proposed framework.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2023)
Article
Computer Science, Hardware & Architecture
Abderrahmane Nitaj, Willy Susilo, Joseph Tonien
Summary: This paper investigates a specific family of enhanced substitution boxes for the Advanced Encryption Standard. These modified S-boxes have the maximal periodicity property, with each input having the maximum orbit length of 256. The parameters for achieving this maximal periodicity property are completely determined. The new enhanced S-boxes also exhibit improved bit avalanche property.
COMPUTER STANDARDS & INTERFACES
(2024)
Article
Computer Science, Hardware & Architecture
Guohua Tian, Jianghong Wei, Miroslaw Kutylowski, Willy Susilo, Xinyi Huang, Xiaofeng Chen
Summary: This paper introduces the concept of verifiable redactable blockchain (VRBC) and proposes a novel authentication data structure and an efficient VRBC scheme to achieve efficient validity verification and consistent blockchain ledger. Optimized strategies are introduced and the scheme is extended to transaction-level and permissionless VRBC. Finally, the feasibility of the proposed scheme is demonstrated through security analysis and performance evaluation.
IEEE TRANSACTIONS ON COMPUTERS
(2023)
Article
Computer Science, Theory & Methods
Jun Shen, Xiaofeng Chen, Zheli Liu, Willy Susilo
Summary: Blockchain technology has been praised for its immutability, but it is desired to make blockchains mutable to comply with legal and moral restrictions. We propose a verifiable and redactable blockchain for the first time, allowing fully editing operations while ensuring the verifiability of the blockchain state. Our approach utilizes a double trapdoor chameleon hash family for computationally efficient and key-exposure resistant block editing, and combines trapdoorless universal accumulators and the largest sequence number principle for blockchain state verification. We provide comprehensive analysis and extensive experiments to demonstrate the security and feasibility of our proposed redactable blockchain.
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY
(2023)
Article
Computer Science, Hardware & Architecture
Yanmei Cao, Jianghong Wei, Yang Xiang, Willy Susilo, Xiaofeng Chen
Summary: Deniable encryption (DE) allows private communication even when adversaries force participants to reveal their secret keys. However, existing DE systems do not consider potential abuse by malicious users. This paper proposes an abuse-resistant DE scheme and provides formal definitions and security analysis. The proposed scheme outperforms existing work in terms of functionality and ciphertext rate.
COMPUTER STANDARDS & INTERFACES
(2024)
Article
Computer Science, Hardware & Architecture
Shuaining Gao, Xinjian Chen, Hongbo Li, Willy Susilo, Qiong Huang
Summary: This paper proposes a new lattice-based group signature scheme that combines the timestamp with Verifier Local Revocation (VLR) using the complete tree technique. The scheme achieves post-quantum security, almost full anonymity, and traceability, as well as backward unlinkability and effectively reduces the size of the revocation list.
COMPUTER STANDARDS & INTERFACES
(2024)
Article
Computer Science, Information Systems
Xia Liang, Jie Guo, Peide Liu
Summary: This paper investigates a novel consensus model based on social networks to manage manipulative and overconfident behaviors in large-scale group decision-making. By proposing a novel clustering model and improved methods, the consensus reaching is effectively facilitated. The feedback mechanism and management approach are employed to handle decision makers' behaviors. Simulation experiments and comparative analysis demonstrate the effectiveness of the model.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Xiang Li, Haiwang Guo, Xinyang Deng, Wen Jiang
Summary: This paper proposes a method based on class gradient networks for generating high-quality adversarial samples. By introducing a high-level class gradient matrix and combining classification loss and perturbation loss, the method demonstrates superiority in the transferability of adversarial samples on targeted attacks.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Lingyun Lu, Bang Wang, Zizhuo Zhang, Shenghao Liu
Summary: Many recommendation algorithms only rely on implicit feedbacks due to privacy concerns. However, the encoding of interaction types is often ignored. This paper proposes a relation-aware neural model that classifies implicit feedbacks by encoding edges, thereby enhancing recommendation performance.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Jaehong Yu, Hyungrok Do
Summary: This study discusses unsupervised anomaly detection using one-class classification, which determines whether a new instance belongs to the target class by constructing a decision boundary. The proposed method uses a proximity-based density description and a regularized reconstruction algorithm to overcome the limitations of existing one-class classification methods. Experimental results demonstrate the superior performance of the proposed algorithm.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Hui Tu, Shifei Ding, Xiao Xu, Haiwei Hou, Chao Li, Ling Ding
Summary: Border-Peeling algorithm is a density-based clustering algorithm, but its complexity and issues on unbalanced datasets restrict its application. This paper proposes a non-iterative border-peeling clustering algorithm, which improves the clustering performance by distinguishing and associating core points and border points.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Long Tang, Pan Zhao, Zhigeng Pan, Xingxing Duan, Panos M. Pardalos
Summary: In this work, a two-stage denoising framework (TSDF) is proposed for zero-shot learning (ZSL) to address the issue of noisy labels. The framework includes a tailored loss function to remove suspected noisy-label instances and a ramp-style loss function to reduce the negative impact of remaining noisy labels. In addition, a dynamic screening strategy (DSS) is developed to efficiently handle the nonconvexity of the ramp-style loss.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Raghunathan Krishankumar, Sundararajan Dhruva, Kattur S. Ravichandran, Samarjit Kar
Summary: Health 4.0 is gaining global attention for better healthcare through digital technologies. This study proposes a new decision-making framework for selecting viable blockchain service providers in the Internet of Medical Things (IoMT). The framework addresses the limitations in previous studies and demonstrates its applicability in the Indian healthcare sector. The results show the top ranking BSPs, the importance of various criteria, and the effectiveness of the developed model.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Tao Tan, Hong Xie, Liang Feng
Summary: This paper proposes a heterogeneous update idea and designs HetUp Q-learning algorithm to enlarge the normalized gap by overestimating the Q-value corresponding to the optimal action and underestimating the Q-value corresponding to the other actions. To address the limitation, a softmax strategy is applied to estimate the optimal action, resulting in HetUpSoft Q-learning and HetUpSoft DQN. Extensive experimental results show significant improvements over SOTA baselines.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Chao Yang, Xianzhi Wang, Lina Yao, Guodong Long, Guandong Xu
Summary: This paper proposes a dynamic transformer-based architecture called Dyformer for multivariate time series classification. Dyformer captures multi-scale features through hierarchical pooling and adaptive learning strategies, and improves model performance by introducing feature-map-wise attention mechanisms and a joint loss function.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Xiguang Li, Baolu Feng, Yunhe Sun, Ammar Hawbani, Saeed Hammod Alsamhi, Liang Zhao
Summary: This paper proposes an enhanced scatter search strategy, using opposition-based learning, to solve the problem of automated test case generation based on path coverage (ATCG-PC). The proposed ESSENT algorithm selects the path with the lowest path entropy among the uncovered paths as the target path and generates new test cases to cover the target path by modifying the dimensions of existing test cases. Experimental results show that the ESSENT algorithm outperforms other state-of-the-art algorithms, achieving maximum path coverage with fewer test cases.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Shirin Dabbaghi Varnosfaderani, Piotr Kasprzak, Aytaj Badirova, Ralph Krimmel, Christof Pohl, Ramin Yahyapour
Summary: Linking digital accounts belonging to the same user is crucial for security, user satisfaction, and next-generation service development. However, research on account linkage is mainly focused on social networks, and there is a lack of studies in other domains. To address this, we propose SmartSSO, a framework that automates the account linkage process by analyzing user routines and behavior during login processes. Our experiments on a large dataset show that SmartSSO achieves over 98% accuracy in hit-precision.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Renchao Wu, Jianjun He, Xin Li, Zuguo Chen
Summary: This paper proposes a memetic algorithm with fuzzy-based population control (MA-FPC) to solve the joint order batching and picker routing problem (JOBPRP). The algorithm incorporates batch exchange crossover and a two-level local improvement procedure. Experimental results show that MA-FPC outperforms existing algorithms in terms of solution quality.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Guoxiang Zhong, Fagui Liu, Jun Jiang, Bin Wang, C. L. Philip Chen
Summary: In this study, we propose the AMFormer framework to address the problem of mixed normal and anomaly samples in deep unsupervised time-series anomaly detection. By refining the one-class representation and introducing the masked operation mechanism and cost sensitive learning theory, our approach significantly improves anomaly detection performance.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Jin Zhou, Kang Zhou, Gexiang Zhang, Ferrante Neri, Wangyang Shen, Weiping Jin
Summary: In this paper, the authors focus on the issue of multi-objective optimisation problems with redundant variables and indefinite objective functions (MOPRVIF) in practical problem-solving. They propose a dual data-driven method for solving this problem, which consists of eliminating redundant variables, constructing objective functions, selecting evolution operators, and using a multi-objective evolutionary algorithm. The experiments conducted on two different problem domains demonstrate the effectiveness, practicality, and scalability of the proposed method.
INFORMATION SCIENCES
(2024)
Article
Computer Science, Information Systems
Georgios Charizanos, Haydar Demirhan, Duygu Icen
Summary: This article proposes a new fuzzy logistic regression framework that addresses the problems of separation and imbalance while maintaining the interpretability of classical logistic regression. By fuzzifying binary variables and classifying subjects based on a fuzzy threshold, the framework demonstrates superior performance on imbalanced datasets.
INFORMATION SCIENCES
(2024)
