Shujin Ye
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Shujin Ye has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Hai Liu
Hang Seng University of Hong Kong
2 shared publications - Tse-Tin Chan
The Education University of Hong Kong
2 shared publications - Chen Zhang
The Hang Seng University of Hong Kong
1 shared publication - Chris Y. T. Ma
The Department of Computer Science, The Hang Seng University of Hong Kong, Hong Kong, China
1 shared publication - Yue Wang
The Education University of Hong Kong
1 shared publication
Latest Publications
- 23 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (4) , 1343-1358
Optimal Packing for Encrypted and Compressed Key-Value Stores With Pattern-Analysis Security
Rising concerns about data privacy and volume have driven the development of encrypted and compressed key-value (KV) storage systems. To defend against pattern-analysis attacks, the length and access frequency distributions of packs should appear uniform to adversaries. The design of the packing algorithm is crucial because it determines both pack length and frequency distributions, thereby impacting the overhead for hiding pack pattern information. Existing algorithms focus on minimizing length differences, leading to large variations in pack frequency and thus causing large bandwidth overhead. In this paper, we study the optimal packing problem for encrypted and compressed KV stores, aiming to minimize the overheads for protecting both pack length and frequency information. We propose DualPacking, a two-dimensional packing algorithm with an approximation ratio that depends on the length and frequency distributions of KV pairs. We further develop an encrypted and compressed KV storage system that adapts well to dynamic updates of outsourced stores. Finally, we formally analyze the security of our design and implement it on Redis and RocksDB. Experimental results indicate that, compared to existing packing algorithms, our design reduces the bandwidth overhead by up to 25% and the storage overhead for pack length protection by 33%, confirming its superior efficiency.
- 23 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 13 (4) , 1343-1358
Optimal Packing for Encrypted and Compressed Key-Value Stores With Pattern-Analysis Security
Rising concerns about data privacy and volume have driven the development of encrypted and compressed key-value (KV) storage systems. To defend against pattern-analysis attacks, the length and access frequency distributions of packs should appear uniform to adversaries. The design of the packing algorithm is crucial because it determines both pack length and frequency distributions, thereby impacting the overhead for hiding pack pattern information. Existing algorithms focus on minimizing length differences, leading to large variations in pack frequency and thus causing large bandwidth overhead. In this paper, we study the optimal packing problem for encrypted and compressed KV stores, aiming to minimize the overheads for protecting both pack length and frequency information. We propose DualPacking, a two-dimensional packing algorithm with an approximation ratio that depends on the length and frequency distributions of KV pairs. We further develop an encrypted and compressed KV storage system that adapts well to dynamic updates of outsourced stores. Finally, we formally analyze the security of our design and implement it on Redis and RocksDB. Experimental results indicate that, compared to existing packing algorithms, our design reduces the bandwidth overhead by up to 25% and the storage overhead for pack length protection by 33%, confirming its superior efficiency.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. PP (15455955) , 1
Motion Coordination of Swarm Robots for Mobile Target Search
With the rapid advancement of robotics technologies, a group of robots are able to communicate with one another by wireless transmissions and form a robot swarm. Robot swarm has many applications and a typical one is target search in which swarm robots are sent to places that might be dangerous for human workers, and they coordinate with one another to search for targets such as survivors in a disaster. However, motion coordination of swarm robots for target search has received little attention especially when the targets are mobile. In this work, we develop a motion coordination algorithm for swarm robots to search for targets in an unknown area. Our basic idea is to divide the search area into grids and build a gray-scale map in which each grid is associated with a gray scale indicating the efficiency of searching targets in this grid. The Voronoi diagram is adopted to coordinate swarm robots to search different portions of the search area for maximizing search efficiency. By theoretical analysis, our motion coordination algorithm is validated to ensure that all static targets are guaranteed to be found. We derive an upper-bound on the total time for robots to traverse all the grids in the search area. Extensive simulations are conducted and the results show that the proposed motion coordination algorithm outperforms the state-of-the-art and achieves a success rate of over 90% in finding all mobile targets with low search latency.
- 20 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. PP (15455955) , 1
Motion Coordination of Swarm Robots for Mobile Target Search
With the rapid advancement of robotics technologies, a group of robots are able to communicate with one another by wireless transmissions and form a robot swarm. Robot swarm has many applications and a typical one is target search in which swarm robots are sent to places that might be dangerous for human workers, and they coordinate with one another to search for targets such as survivors in a disaster. However, motion coordination of swarm robots for target search has received little attention especially when the targets are mobile. In this work, we develop a motion coordination algorithm for swarm robots to search for targets in an unknown area. Our basic idea is to divide the search area into grids and build a gray-scale map in which each grid is associated with a gray scale indicating the efficiency of searching targets in this grid. The Voronoi diagram is adopted to coordinate swarm robots to search different portions of the search area for maximizing search efficiency. By theoretical analysis, our motion coordination algorithm is validated to ensure that all static targets are guaranteed to be found. We derive an upper-bound on the total time for robots to traverse all the grids in the search area. Extensive simulations are conducted and the results show that the proposed motion coordination algorithm outperforms the state-of-the-art and achieves a success rate of over 90% in finding all mobile targets with low search latency.