Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter

被引:59
|
作者
Debnath, Sumit Kumar [1 ]
Dutta, Ratna [1 ]
机构
[1] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
来源
关键词
(A)PSI-CA; (A)PSI; Semi-honest adversary; Malicious adversary; Privacy; Bloom filter;
D O I
10.1007/978-3-319-23318-5_12
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We first present a Private Set Intersection Cardinality (PSICA) protocol followed by its authorized variant, APSI-CA, utilizing Bloom filter (BF). We further extend these to PSI and APSI protocols. All the constructions are proven to be secure in standard model with linear complexities. Moreover, our protocols hide the size of the client's private set which may be sensitive in application specific scenarios. The proposed PSI-CA and APSI-CA are the first to achieve security in standard model under the Quadratic Residuosity (QR) assumption with linear complexities.
引用
收藏
页码:209 / 226
页数:18
相关论文
共 50 条
  • [21] On Deploying Secure Computing: Private Intersection-Sum-with-Cardinality
    Ion, Mihaela
    Kreuter, Ben
    Nergiz, Ahmet Erhan
    Patel, Sarvar
    Saxena, Shobhit
    Seth, Karn
    Raykova, Mariana
    Shanahan, David
    Yung, Moti
    2020 5TH IEEE EUROPEAN SYMPOSIUM ON SECURITY AND PRIVACY (EUROS&P 2020), 2020, : 370 - 389
  • [22] Secure set intersection cardinality with application to association rule mining
    Vaidya, Jaideep
    Clifton, Chris
    JOURNAL OF COMPUTER SECURITY, 2005, 13 (04) : 593 - 622
  • [23] Cloud-Assisted Laconic Private Set Intersection Cardinality
    Wu, Axin
    Xin, Xiangjun
    Zhu, Jianhao
    Liu, Wei
    Song, Chang
    Li, Guoteng
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2024, 12 (01) : 295 - 305
  • [24] Outsourced Private Set Intersection Cardinality with Fully Homomorphic Encryption
    Tajima, Arisa
    Sato, Hiroki
    Yamana, Hayato
    PROCEEDINGS OF 2018 6TH INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS), 2018, : 292 - 299
  • [25] Approximating Private Set Union/Intersection Cardinality With Logarithmic Complexity
    Dong, Changyu
    Loukides, Grigorios
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2017, 12 (11) : 2792 - 2806
  • [26] Quantum Protocols for Private Set Intersection Cardinality and Union Cardinality Based on Entanglement Swapping
    Yongli Wang
    Peichu Hu
    Qiuliang Xu
    International Journal of Theoretical Physics, 2021, 60 : 3514 - 3528
  • [27] New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
    Debnath, Sumit Kumar
    Dutta, Ratna
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2016, 2017, 10157 : 254 - 284
  • [28] Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters
    Inbar, Roi
    Omri, Eran
    Pinkas, Benny
    SECURITY AND CRYPTOGRAPHY FOR NETWORKS, SCN 2018, 2018, 11035 : 235 - 252
  • [29] Quantum Protocols for Private Set Intersection Cardinality and Union Cardinality Based on Entanglement Swapping
    Wang, Yongli
    Hu, Peichu
    Xu, Qiuliang
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2021, 60 (09) : 3514 - 3528
  • [30] SE-PSI: Fog/Cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
    Qiu, Shuo
    Zhang, Zheng
    Liu, Yanan
    Yan, Hao
    Cheng, Yuan
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2022, 19 (02) : 1861 - 1876