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 Cardinality (PSI-CA) is a cryptographic method in secure multi-party computation that allows entities to identify the cardinality of the intersection 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 Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI-CA protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI-CA protocols to these imbalances is crucial. This paper explores unbalanced 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.This paper, based on the concept of commutative encryption, introduces Cuckoo filter, cloud computing technology, and homomorphic encryption, among other technologies, to construct three novel solutions for unbalanced Private Set Intersection Cardinality (PSI-CA): an unbalanced PSI-CA protocol based on Cuckoo filter, an unbalanced PSI-CA protocol based on single-cloud assistance, and an unbalanced PSI-CA protocol based on dual-cloud assistance. Depending on performance and security requirements, different protocols can be employed for various applications.
Funder
Guangdong Key Laboratory of Data Security and Privacy Preserving
National Natural Science Foundation of China
Reference44 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. A Survey on Set Intersection Computation for Privacy Protection;Li;J. Comput. Res. Dev.,2022
5. Meadows, C. (1986, January 7–9). A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party. Proceedings of the 7th IEEE Symposium on Security and Privacy, Oakland, CA, USA.