Privacy Protection Based on Special Identifiers of Intersection Base Computing Technology

Author:

Zhang Ping12,Ma Tengfei1,Zhang Qing1,Zhang Ji12ORCID,Wang Jiechang3

Affiliation:

1. School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, China

2. Intelligent System Science and Technology Innovation Center, Longmen Laboratory, Luoyang 471023, China

3. Sports Big Data Center, Department of Physical Education, Zhengzhou University, Zhengzhou 450001, China

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.

Funder

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

Publisher

MDPI AG

Subject

Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science

Reference23 articles.

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.

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.

3. Secure computation of the kth-ranked element;Aggarwal;EUROCRYPT’04, LNCS,2004

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 operations;Sang;ACM Trans. Inf. Syst. Secur. TISSEC,2009

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3