Post-quantum secure multi-party private set-intersection in star network topology

被引:5
作者
Debnath, Sumit Kumar [1 ]
Choudhury, Tanmay [1 ]
Kundu, Nibedita [2 ]
Dey, Kunal [1 ]
机构
[1] Natl Inst Technol Jamshedpur, Dept Math, Jamshedpur 831014, Bihar, India
[2] LNM Inst Informat Technol, Dept Math, Jaipur 302031, Rajasthan, India
关键词
MPSI; Bloom filter; Post-quantum cryptography; Lattice-based cryptosystem; SCHEME;
D O I
10.1016/j.jisa.2020.102731
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In many realistic scenarios, participants wish to perform some secret set operations such as intersection, union, cardinality of intersection, etc. on their private data sets. Private Set Intersection (PSI) plays a major role in addressing such problems. PSI is one of the widely used secure multi-party computation technique that allows the participants to securely compute the intersection of their private input sets and nothing beyond that. It is generally executed between two parties. When the number of entities is more than two, it is known as multi-party PSI (MPSI). Today, the security of all the existing MPSI protocols are based on number theoretic assumptions. However, these will become insecure once large enough quantum computers are built. As a consequence, designing of quantum computer resistant MPSI becomes an interesting direction of research work. This paper addresses the issue by presenting the first post-quantum MPSI protocol in the so-called star network topology, using lattice-based public key encryption scheme. We utilize space-efficient probabilistic data structure (Bloom filter) as building blocks of our design. It attains security in standard model (without random oracles) under the decisional learning with errors (DLWE) assumption.
引用
收藏
页数:7
相关论文
共 34 条
  • [1] Adam Groce, 2019, IACR CRYPTOL EPRINT, V2019, P239
  • [2] Agrawal R., 2003, ACM SIGMOD 2003, P86, DOI DOI 10.1145/872757.872771
  • [3] Bendlin R, 2010, LECT NOTES COMPUT SC, V5978, P201, DOI 10.1007/978-3-642-11799-2_13
  • [4] SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS
    BLOOM, BH
    [J]. COMMUNICATIONS OF THE ACM, 1970, 13 (07) : 422 - &
  • [5] Cerulli Andrea, 2018, Applied Cryptography and Network Security. 16th International Conference, ACNS 2018. Proceedings: LNCS 10892, P280, DOI 10.1007/978-3-319-93387-0_15
  • [6] Fast Private Set Intersection from Homomorphic Encryption
    Chen, Hao
    Laine, Kim
    Rindal, Peter
    [J]. CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, : 1243 - 1255
  • [7] Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity
    Cheon, Jung Hee
    Jarecki, Stanislaw
    Seo, Jae Hong
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2012, E95A (08) : 1366 - 1378
  • [8] Combining Private Set-Intersection with Secure Two-Party Computation
    Ciampi, Michele
    Orlandi, Claudio
    [J]. SECURITY AND CRYPTOGRAPHY FOR NETWORKS, SCN 2018, 2018, 11035 : 464 - 482
  • [9] Dachman-Soled D, 2011, LECT NOTES COMPUT SC, V6715, P130, DOI 10.1007/978-3-642-21554-4_8
  • [10] De Cristofaro E., 2012, LNCS, V7344, P55, DOI [DOI 10.1007/978-3-642-30921-24, DOI 10.1007/978-3-642-30921-2_4]