Privacy Protection Based on Special Identifiers of Intersection Base Computing Technology
Source abstract
Abstract
Private Set Intersection Cardinality (PSI-CA) and Private Set Union Cardinality (PSU-CA) are two cryptographic primitives whereby two or more parties are able to obtain the cardinalities of the intersection and the union of their respective private sets, and the privacy of their sets is preserved. In this paper, we propose a new privacy protection intersection cardinality protocol, which can quickly deal with set inequality and asymmetry problems and can obtain 100% correct results, and, in terms of efficiency, we are much faster than using the polynomial method. Our protocol adopts the Paillier addition homomorphic encryption scheme and applies the identifier guidance technology, using identifier determination, to the semi-homomorphic encryption ciphertext environment, excluding a large number of different options and quickly finding the base of the intersection of two sides.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Cryptography and Data Security · Privacy-Preserving Technologies in Data · Complexity and Algorithms in Graphs
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China
Intelligent System Science and Technology Innovation Center, Longmen Laboratory, Luoyang 471023, China
Sports Big Data Center, Department of Physical Education, Zhengzhou University, Zhengzhou 450001, China
Funding
Major Science and Technology Projects of Longmen Laboratory · National Natural Science Foundation of China · Key Scientific Research Project in Colleges and Universities of Henan Province of China · Key Science and Technology Project of Henan Province of China
References (23)
Show source-provided references
1. Micali, S., Goldreich, O., and Wigderson, A. (1987, January 1). How to play any mental game. Proceedings of the Nineteenth ACM symposium on Theory of Computing, STOC, New York, NY, USA.10.1145/28395.28420 ↗
2. Yao, A.C. (1982, January 3–5). Protocols for secure computations. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), Washington, DC, USA.10.1109/SFCS.1982.38 ↗
3. Secure computation of the kth-ranked element
4. Kiayias, A., and Mitrofanova, A. (March, January 28). Testing disjointness of private datasets. Proceedings of the International Conference on Financial Cryptography and Data Security, Roseau, Dominica.
5. Efficient and secure protocols for privacy-preserving set operations10.1145/1609956.1609965 ↗
6. Hohenberger, S., and Weis, S.A. (2006, January 28–30). Honest-verifier private disjointness testing without random oracles. Proceedings of the Privacy Enhancing Technologies: 6th International Workshop, PET 2006, Cambridge, UK. Revised Selected Papers 6.
7. Frikken, K. (2007, January 5–8). Privacy-preserving set union. Proceedings of the Applied Cryptography and Network Security: 5th International Conference, ACNS 2007, Zhuhai, China. Proceedings 5.
8. Hazay, C., and Nissim, K. (2010, January 26–28). Efficient set operations in the presence of malicious adversaries. Proceedings of the Public Key Cryptography–PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France. Proceedings 13.10.1007/978-3-642-13013-7_19 ↗
9. Egert, R., Fischlin, M., Gens, D., Jacob, S., Senker, M., and Tillmanns, J. (July, January 29). Privately computing set-union and set-intersection cardinality via bloom filters. Proceedings of the Information Security and Privacy: 20th Australasian Conference, ACISP 2015, Brisbane, QLD, Australia. Proceedings 20.10.1007/978-3-319-19962-7_24 ↗
10. Approximating Private Set Union/Intersection Cardinity with Logarithmic Complexity10.1109/TIFS.2017.2721360 ↗
11. Paillier, P. (1999, January 2–6). Public-key cryptosystems based on composite degree residuosity classes. Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Prague, Czech Republic.
12. Pinkas, B., Schneider, T., Tkachenko, O., and Yanai, A. (2019). Advances in Cryptology–EUROCRYPT 2019, Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, 19–23 May 2019, Springer International Publishing. Proceedings, Part III 38.
13. Pinkas, B., Schneider, T., Weinert, C., and Wieder, U. (May, January 29). Efficient circuit-based PSI via cuckoo hashing. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel.
14. Huang, Y., Evans, D., and Katz, J. (2012, January 5–8). Private set intersection: Are garbled circuits better than custom protocols?. Proceedings of the 19th Network and Distributed Security Symposium, San Diego, CA, USA.
15. Asokan, N., Dmitrienko, A., Nagy, M., Reshetova, E., Sadeghi, A.R., Schneider, T., and Stelle, S. (2013, January 25–28). Crowdshare: Secure mobile resource sharing. Proceedings of the Applied Cryptography and Network Security: 11th International Conference, ACNS 2013, Banff, AB, Canada. Proceedings 11.10.1007/978-3-642-38980-1_27 ↗
16. Bogdanov, D., Laur, S., and Willemson, J. (2008, January 6–8). Sharemind: A framework for fast privacy-preserving computations. Proceedings of the Computer Security-ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain. Proceedings 13.10.1007/978-3-540-88313-5_13 ↗
17. Demmler, D., Schneider, T., and Zohner, M. (2015, January 8–11). ABY-A framework for efficient mixed-protocol secure two-party computation. Proceedings of the Network and Distributed System Security (NDSS) Symposium, San Diego, CA, USA.10.14722/ndss.2015.23113 ↗
18. Low cost constant round MPC combining BMR and oblivious transfer10.1007/s00145-020-09355-y ↗
19. Keller, M. (2020, January 9–13). MP-SPDZ: A versatile framework for multi-party computation. Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Virtual.10.1145/3372297.3417872 ↗
20. Mohassel, P., and Rindal, P. (2018, January 15–19). ABY3: A mixed protocol framework for machine learning. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, Toronto, ON, Canada.
21. Chaudhari, H., Rachuri, R., and Suresh, A. (2019). Trident: Efficient 4pc framework for privacy preserving machine learning. arXiv.10.14722/ndss.2020.23005 ↗
22. Motion—A framework for mixed-protocol multi-party computation10.1145/3490390 ↗
23. Shoup, V. (2005). Advances in Cryptology, Proceedings of the Annual International Cryptology Conference CRYPTO 2005, Santa Barbara, CA, USA, 14–18 August 2005, Springer. Lecture Notes in Computer, Science.10.1007/11535218 ↗