Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haining Luo

dblp:140/0908 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 67% Cryptographic primitives and cryptanalysis · 33%
Human-computer interaction and pervasive computing
1 paper
Human-robot interaction · 100%
Artificial intelligence
1 paper
Robot manipulation · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection
privacy-preserving query processing
0.812024
Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024
Privacy and data protection › privacy-preserving query processing
range query
0.812024
Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024
Cryptographic primitives and cryptanalysis
searchable encryption
0.812024
Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024
Robotics › Robot manipulation
dual-arm manipulation
0.312025
Interface Matters: Comparing First and Third-Person Perspective Interfaces for Bi-Manual Robot Behavioural Cloning · ICRA 2025
Medical and health informatics
electronic health records
0.212024
Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems · IEEE Trans. Serv. Comput. 2024

Methods — techniques the papers use, named apart from their topics

user study · 1.7behavioural cloning · 1.7index tree · 1.5attribute hierarchy · 1.5
YearPublicationVenuePosition
2026 Efficient Multiuser Searchable and Revocable Data Sharing Scheme for IoV
abstract
The Internet of Vehicles (IoV), as a critical component of future intelligent transportation systems, enables vehicles to generate and exchange massive volumes of sensing data in real time. To facilitate efficient data sharing and alleviate the burden of local storage, vehicle data is typically encrypted and outsourced to the cloud, with data availability ensured through searchable encryption. However, existing IoV data sharing frameworks offer limited support for secure multi-keyword search and dynamic user revocation. Moreover, most current solutions rely on public-key searchable encryption, which compromises the efficiency required for data processing in IoV environments. To address these challenges, we propose an efficient multi-user searchable and revocable data sharing scheme (EMUSR-SSE) tailored for IoV. EMUSR-SSE extends symmetric searchable encryption to support efficient multi-user access control and trustworthy multi-keyword search by designing a proxy matrix transformation mechanism integrated with Intel SGX. To enable flexible and scalable user revocation, EMUSR-SSE introduces a revocable dynamic sparse Merkle tree structure to manage multi-user permissions effectively. Furthermore, by leveraging the trusted execution environment within SGX and encrypting each data item individually, EMUSR-SSE significantly mitigates the risk of key leakage. Security analysis and experimental evaluations demonstrate that EMUSR-SSE achieves high efficiency and strong practical performance in dynamic IoV environments.
Ping Wang 0086, Fei Tang 0001, Haining Luo, Fengjie Peng, Huihui Zhu 0001, Ankui Jing, Yawen Huang
IEEE Internet Things J.3
2025 Interface Matters: Comparing First and Third-Person Perspective Interfaces for Bi-Manual Robot Behavioural Cloning
abstract
Despite the growing interest in Behavioural Cloning for robots, few existing research has explicitly explored the impact of user interfaces on the effectiveness of expert demonstrations. We investigate the importance of user interface design in Behavioural Cloning, highlighting the critical role that interfaces play in conveying human demonstrations and robotics capabilities. This study compares the effectiveness of first and third-person perspective interfaces for robot shoe-lacing, a highly dexterous, bi-manual manipulation task that involves deformable objects and requires high precision. Our study highlights the importance of considering the impact of interface design on expert demonstration quality in Behavioural Cloning applications. By providing a first-person perspective, we observed significant differences in demonstration execution time and consistency compared to the third-person perspective. These findings suggest that the choice of interface can influence the quality of expert demonstrations, which in turn affects the performance of learning algorithms.
Haining Luo, Rodrigo Chacon, Fernando E. Casado, Nico Lingg, Yiannis Demiris
ICRA1
2024 Efficient Privacy-Preserving Multi-Dimensional Range Query for Cloud-Assisted Ehealth Systems
abstract
In cloud-assisted electronic health (eHealth) systems, the exponential growth of electronic health records (EHRs) has prompted healthcare organizations to move it to the cloud. However, EHRs are encrypted before being outsourced for privacy. Although searchable encryption schemes for EHRs have been proposed, their search efficiency and functionality for massive EHRs with high-dimensional are still insufficient. In this paper, we adopt an attribute hierarchy structure for medical datasets, enabling efficient multi-dimensional range search and reducing high-dimensional EHRs to low-dimensional vectors. To further improve search efficiency, we design an index tree that require no additional storage and computational overhead, significantly improving efficiency in search, trapdoor generation, and index building. Our scheme is well-suited for large-scale medical data scenarios, especially in dealing with high-dimensional and massive datasets. Extensive experiments demonstrate the superiority of our scheme over existing solutions, particularly in large-scale medical data scenarios. Compared to the classic EDMRS scheme, our scheme has a computational overhead in index building and search that is only about 1/500 and 1/10 of EDMRS when the number of keywords and electronic health records is 3,000 and 6,000, respectively. Moreover, as medical data and keywords increase, our scheme shows slower computational overhead growth compared to EDMRS.
Fei Tang 0001, Xujun Zhou, Haining Luo, Guowei Ling, Jinyong Shan, Yunpeng Xiao 0001
IEEE Trans. Serv. Comput.3
2023 Bi-Manual Robot Shoe Lacing
abstract
Shoe lacing (SL) is a challenging sensorimotor task in daily life and a complex engineering problem in the shoe-making industry. In this paper, we propose a system for autonomous SL. It contains a mathematical definition of the SL task and searches for the best lacing pattern corresponding to the shoe configuration and the user preferences. We propose a set of action primitives and generate plans of action sequences according to the designed pattern. Our system plans the trajectories based on the perceived position of the eyelets and aglets with an active perception strategy, and deploys the trajectories on a bi-manual robot. Experiments demonstrate that the proposed system can successfully lace 3 different shoes in different configurations, with a completion rate of 92.0%, 91.6% and 77.5% for 6, 8 and 10-eyelet patterns respectively. To the best of our knowledge, this is the first demonstration of autonomous SL using a bi-manual robot.
Haining Luo, Yiannis Demiris
IROS1
2013 Mining User Interests in Web Logs of an Online News Service Based on Memory Model
abstract
User profiling plays an important role in online news recommendation systems. In this paper, we analyze the relationship between users' clicking behaviors and the category of the news story to model user's interests by mining web log data of an adaptive news system. We train a Memory-based User Profile (MUP), which imitates human being's learning, remembering and forgetting mechanisms, to predict users' potential interests dynamically. We mainly focus on experimental analysis to refine the MUP scheme. Firstly, we materialize the meanings of all parameters of MUP by important factors (i.e., absorbing factor, forgetting factor, timescale and learning strength) in human being's learning and forgetting process. Secondly, we demonstrate how to determine the values of parameters for different users to reflect their distinct learning and forgetting abilities. Thirdly, we derive a threshold from MUP's recursion formula, which can be used to simply distinguish long-term and short-term interests. Our evaluations are carried out on IdoIcan's web log data, results show MUP can model user's profile effectively.
Wei Wang 0339, Dongyan Zhao 0001, Haining Luo
NAS3