Efficient Secure Cardinality Query Based on Private Set Intersection

Ruofan Li, Zhenfu Cao, Xiaolei Dong, Jiachen Shen, Yunbo Yang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

With the development of cloud service technology, more and more organizations are attracted by its convenience and cost-effectiveness. However, it raises substantial security concerns, particularly around the secure execution of SQL state-ments on outsourced platforms. This paper delves into private set intersection (PSI) with an emphasis on cardinality(PSI-CA). We aim to propose a novel PSI-CA scheme, a two-party PSI protocol without the homomorphic encryption method. A highlight of our contribution is the introduction of an innovative oblivious pseudo-random function (OPRF) designed to minimize computational and communication burdens.

Original languageEnglish
Title of host publicationProceedings - 2024 2nd International Conference on Intelligent Control and Computing, IC-C 2024
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages25-31
Number of pages7
ISBN (Electronic)9798350351873
DOIs
StatePublished - 2024
Event2nd International Conference on Intelligent Control and Computing, IC-C 2024 - Hybrid, Guangzhou, China
Duration: 29 Mar 202431 Mar 2024

Publication series

NameProceedings - 2024 2nd International Conference on Intelligent Control and Computing, IC-C 2024

Conference

Conference2nd International Conference on Intelligent Control and Computing, IC-C 2024
Country/TerritoryChina
CityHybrid, Guangzhou
Period29/03/2431/03/24

Keywords

  • privacy
  • PSI
  • PSI-CA
  • query

Fingerprint

Dive into the research topics of 'Efficient Secure Cardinality Query Based on Private Set Intersection'. Together they form a unique fingerprint.

Cite this