Author:
Qiu Shuo, ,Zhang Zheng,Liu Yanan,Yan Hao,Cheng Yuan
Abstract
<abstract><p>Private Set Intersection (PSI), which is a hot topic in recent years, has been extensively utilized in credit evaluation, medical system and so on. However, with the development of big data era, the existing traditional PSI cannot meet the application requirements in terms of performance and scalability. In this work, we proposed two secure and effective PSI (SE-PSI) protocols on scalable datasets by leveraging deterministic encryption and Bloom Filter. Specially, our first protocol focuses on high efficiency and is secure under a semi-honest server, while the second protocol achieves security on an economic-driven malicious server and hides the set/intersection size to the server. With experimental evaluation, our two protocols need only around 15 and 24 seconds respectively over one million-element datasets. Moreover, as a novelty, a <italic>multi-round</italic> mechanism is proposed for the two protocols to improve the efficiency. The implementation demonstrates that our <italic>two-round</italic> mechanism can enhance efficiency by almost twice than two basic protocols.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Computational Mathematics,General Agricultural and Biological Sciences,Modeling and Simulation,General Medicine
Reference38 articles.
1. Q. Tang, Public key encryption supporting plaintext equality test and user-specified authorization, Secur. Commun. Networks, 5 (2012), 1351–1362. doi: 10.1002/sec.418.
2. D. Kales, C. Rechberger, T. Schneider, M. Senker, C. Weinert, Mobile private contact discovery at scale, in 28th USENIX Security Symposium (USENIX Security 19), (2019), 1447–1464.
3. P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti, G. Tsudik, Countering gattaca: Efficient and secure testing of fully-sequenced human genomes, in Proceedings of the 18th ACM Conference on Computer and Communications Security, (2011), 697–702. doi: 10.1145/2046707.2046785.
4. M. Ion, B. Kreuter, E. Nergiz, S. Patel, S. Saxena, K. Seth, et al., Private intersection-sum protocol with applications to attributing aggregate ad conversions, IACR Cryptol. ePrint Arch., (2017), 738.
5. E. D. Cristofaro, G. Tsudik, Practical private set intersection protocols with linear complexity, Lect. Notes Comput. Sci., 6052 (2010), 143–159. doi: 10.1007/978-3-642-14577-3_13.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献