Cloud-Assisted Private Set Intersection via Multi-Key Fully Homomorphic Encryption

被引:3
作者
Fan, Cunqun [1 ,2 ]
Jia, Peiheng [3 ]
Lin, Manyun [1 ,2 ]
Wei, Lan [1 ,2 ]
Guo, Peng [1 ,2 ]
Zhao, Xiangang [1 ,2 ]
Liu, Ximeng [4 ]
机构
[1] China Meteorol Adm, Natl Satellite Meteorol Ctr, Natl Ctr Space Weather, Key Lab Radiometr Calibrat & Validat Environm Sate, Beijing 100081, Peoples R China
[2] Innovat Ctr Feng Yun Meteorol Satellite FYSIC, Beijing 100081, Peoples R China
[3] Shanxi Normal Univ, Sch Math & Comp Sci, Taiyuan 030031, Peoples R China
[4] Fuzhou Univ, Coll Comp & Data Sci, Fuzhou 350108, Peoples R China
关键词
private set intersection; homomorphic encryption; multi-key TFHE; cloud computing; privacy protection; SCHEME;
D O I
10.3390/math11081784
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
With the development of cloud computing and big data, secure multi-party computation, which can collaborate with multiple parties to deal with a large number of transactions, plays an important role in protecting privacy. Private set intersection (PSI), a form of multi-party secure computation, is a formidable cryptographic technique that allows the sender and the receiver to calculate their intersection and not reveal any more information. As the data volume increases and more application scenarios emerge, PSI with multiple participants is increasingly needed. Homomorphic encryption is an encryption algorithm designed to perform a mathematical-style operation on encrypted data, where the decryption result of the operation is the same as the result calculated using unencrypted data. In this paper, we present a cloud-assisted multi-key PSI (CMPSI) system that uses fully homomorphic encryption over the torus (TFHE) encryption scheme to encrypt the data of the participants and that uses a cloud server to assist the computation. Specifically, we design some TFHE-based secure computation protocols and build a single cloud server-based private set intersection system that can support multiple users. Moreover, security analysis and performance evaluation show that our system is feasible. The scheme has a smaller communication overhead compared to existing schemes.
引用
收藏
页数:20
相关论文
共 53 条
  • [1] Efficient Delegated Private Set Intersection on Outsourced Private Datasets
    Abadi, Aydin
    Terzis, Sotirios
    Metere, Roberto
    Dong, Changyu
    [J]. IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2019, 16 (04) : 608 - 624
  • [2] VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
    Abadi, Aydin
    Terzis, Sotirios
    Dong, Changyu
    [J]. FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2016, 2017, 9603 : 149 - 168
  • [3] O-PSI: Delegated Private Set Intersection on Outsourced Datasets
    Abadi, Aydin
    Terzis, Sotirios
    Dong, Changyu
    [J]. ICT SYSTEMS SECURITY AND PRIVACY PROTECTION, 2015, 455 : 3 - 17
  • [4] Security and Privacy in Cloud Computing: Technical Review
    Abdulsalam, Yunusa Simpa
    Hedabou, Mustapha
    [J]. FUTURE INTERNET, 2022, 14 (01)
  • [5] Aburukba R., 2022, P 2022 INT S NETW CO, P1
  • [6] On the concrete hardness of Learning with Errors
    Albrecht, Martin R.
    Player, Rachel
    Scott, Sam
    [J]. JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2015, 9 (03) : 169 - 203
  • [7] Attribute-based fine-grained access control for outscored private set intersection computation
    Ali, Mohammad
    Mohajeri, Javad
    Sadeghi, Mohammad-Reza
    Liu, Ximeng
    [J]. INFORMATION SCIENCES, 2020, 536 : 222 - 243
  • [8] [Anonymous], 2012, P 27 ANN ACM S APPL
  • [9] Brakerski Zvika, 2014, ACM Transactions on Computation Theory, V6, DOI 10.1145/2633600
  • [10] Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
    Brakerski, Zvika
    Perlman, Renen
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2016, PT I, 2016, 9814 : 190 - 213