Efficient Cryptographic Solutions for Unbalanced Private Set Intersection in Mobile Communication
-
Published:2024-09-09
Issue:9
Volume:15
Page:554
-
ISSN:2078-2489
-
Container-title:Information
-
language:en
-
Short-container-title:Information
Author:
Feng Qian12, Du Shenglong12, Tan Wuzheng12, Weng Jian12
Affiliation:
1. College of Cyber Security, Jinan University, Guangzhou 510632, China 2. Guangdong Key Laboratory of Data Security and Privacy Preserving, Guangzhou 510632, China
Abstract
Private Set Intersection (PSI) is a cryptographic method in secure multi-party computation that allows entities to identify common elements in their datasets without revealing their private data. Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances. In real-world applications, dataset sizes and computational capacities often vary, particularly in the Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI protocols to these imbalances is crucial. This paper explores unbalanced PSI scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities. It introduces three innovative solutions for unbalanced PSI: an unbalanced PSI protocol based on the Cuckoo filter, an unbalanced PSI protocol based on single-cloud assistance, and an unbalanced PSI protocol based on dual-cloud assistance, with each subsequent solution addressing the shortcomings of the previous one. Depending on performance and security needs, different protocols can be employed for applications such as private contact discovery.
Funder
Guangdong Key Laboratory of Data Security and Privacy Preserving
Reference62 articles.
1. Efficient and secure testing of fully-sequenced human genomes;Bald;Biol. Sci. Initiat.,2000 2. Chen, H., Laine, K., and Rindal, P. (November, January 30). Fast private set intersection from homomorphic encryption. Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA. 3. Nagaraja, S., Mittal, P., Hong, C.Y., Caesar, M., and Borisov, N. (2010, January 11–13). BotGrep: Finding P2P Bots with Structured Graph Analysis. Proceedings of the 19th USENIX Security Symposium (USENIX Security 10), Washington, DC, USA. 4. Chen, H., Huang, Z., Laine, K., and Rindal, P. (2018, January 15–19). Labeled PSI from fully homomorphic encryption with malicious security. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada. 5. Kamara, S., Mohassel, P., Raykova, M., and Sadeghian, S. (2014, January 3–7). Scaling private set intersection to billion-element sets. Proceedings of the Financial Cryptography and Data Security: 18th International Conference, FC 2014, Christ Church, Barbados. Revised Selected Papers.
|
|