Secure and Efficient Private Set Intersection Cardinality Using Bloom Filter

被引:66
作者
Debnath, Sumit Kumar [1 ]
Dutta, Ratna [1 ]
机构
[1] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
来源
INFORMATION SECURITY, ISC 2015 | 2015年 / 9290卷
关键词
(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
相关论文
共 12 条
  • [1] [Anonymous], 2012, ASIACCS
  • [2] Ateniese G, 2011, LECT NOTES COMPUT SC, V6571, P156, DOI 10.1007/978-3-642-19379-8_10
  • [3] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS
    BLOOM, BH
    [J]. COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 422 - &
  • [4] Camenisch J, 2009, LECT NOTES COMPUT SC, V5628, P108, DOI 10.1007/978-3-642-03549-4_7
  • [5] De Cristofaro E, 2012, INT C CRYPT NETW SEC, V7712, P218
  • [6] De Cristofaro E, 2010, LECT NOTES COMPUT SC, V6477, P213, DOI 10.1007/978-3-642-17373-8_13
  • [7] Dong C, 2013, P 2013 ACM SIGSAC C, P789
  • [8] Goldreich O., 2009, Foundations of Cryptography, Basic Applications, V2
  • [9] PROBABILISTIC ENCRYPTION
    GOLDWASSER, S
    MICALI, S
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) : 270 - 299
  • [10] Hazay C., 2015, 20154 IACR CRYPT EPR, V2015, P4