Yang Yang (Singapore Management University), Guomin Yang (Singapore Management University), Yingjiu Li (University of Oregon, USA), Pengfei Wu (Singapore Management University), Rui Shi (Hainan University, China), Minming Huang (Singapore Management University), Jian Weng (Jinan University, Guangzhou, China), HweeHwa Pang (Singapore Management University), Robert H. Deng (Singapore Management University)

Service discovery is a fundamental process in wireless networks, enabling devices to find and communicate with services dynamically, and is critical for the seamless operation of modern systems like 5G and IoT. This paper introduces PriSrv+, an advanced privacy and usability-enhanced service discovery protocol for modern wireless networks and resource-constrained environments. PriSrv+ builds upon PriSrv (NDSS'24), by addressing critical limitations in expressiveness, privacy, scalability, and efficiency, while maintaining compatibility with widely-used wireless protocols such as mDNS, BLE, and Wi-Fi.

A key innovation in PriSrv+ is the development of Fast and Expressive Matchmaking Encryption (FEME), the first matchmaking encryption scheme capable of supporting expressive access control policies with an unbounded attribute universe, allowing any arbitrary string to be used as an attribute. FEME significantly enhances the flexibility of service discovery while ensuring robust message and attribute privacy. Compared to PriSrv, PriSrv+ optimizes cryptographic operations, achieving 7.62x faster for encryption and 6.23x faster for decryption, and dramatically reduces ciphertext sizes by 87.33%. In addition, PriSrv+ reduces communication costs by 87.33% for service broadcast and 86.64% for anonymous mutual authentication compared with PriSrv. Formal security proofs confirm the security of FEME and PriSrv+. Extensive evaluations on multiple platforms demonstrate that PriSrv+ achieves superior performance, scalability, and efficiency compared to existing state-ofthe-art protocols.

View More Papers

DQN-IDS: A Deep Reinforcement Learning Approach for Open Set-Enabled...

Shreyash Tiwari (Computer and Information Science, University of Massachusetts Dartmouth), Nathaniel D. Bastian (Electrical Engineering and Computer Science, United States Military Academy), Gokhan Kul (Computer and Information Science, University of Massachusetts Dartmouth)

Read More

Practical Traceable Over-Threshold Multi-Party Private Set Intersection

Le Yang (School of Cyber Science and Technology, University of Science and Technology of China), Weijing You (Fujian Provincial Key Laboratory of Network Security and Cryptology, College of Computer and Cyber Security, Fujian Normal University), Huiyang He (School of Cyber Science and Technology, University of Science and Technology of China), Kailiang Ji (NIO Inc), Jingqiang…

Read More

CoT-DPG: A Co-Training based Dynamic Password Guessing Method

Chenyang Wang (National University of Defense Technology), Fan Shi (National University of Defense Technology), Min Zhang (National University of Defense Technology), Chengxi Xu (National University of Defense Technology), Miao Hu (National University of Defense Technology), Pengfei Xue (National University of Defense Technology), Shasha Guo (National University of Defense Technology), jinghua zheng (National University of Defense…

Read More