基于ElGamal变体同态的安全两方计算协议设计

doi:10.11959/j.issn.1000-436x.2015050

Abstract

Abstract:

ElGamal homomorphic characteristics were analyzed.In order to meet the need of protocol design,ElGamal variant was designed,which satisfies additive homomorphism and constant multiplication homomorphism.A homomorphism calculate protocol of linear equation passed by two private point based on the ElGamal variant was also proposed,then the correctness,security and the complexity of computation and communication of the protocol were analyzed to extend the application of thinking to secure two-party line segments intersection scheme.Compared with the similar protocol of solving the geometric problem,a kind of secure two-party computation protocol based on homomorphic encryption system without using the oblivious transfer protocol and the millionaires protocol was put forward,which holds higher efficiency and a lower burden of communication.

Key words: secure two-party computation, homomorphic encryption, ElGamal encryption system, private point cal-culation

Zhi-wei CHEN,Juan-mei ZHANG,Zi-chen LI. Design for secure two-party computation protocol based on ElGamal variant’s homomorphic[J]. Journal on Communications, 2015, 36(2): 204-211.

Figures/Tables 4

References 20

1	RIVEST R , ADLEMAN L , DERTOUZOS M . On Data Banks and Privacy Homeomorphisms[M]. In Foundations of Secure Computation, 1978.169-177.
2	GENTRY C . A Fully Homomorphic Encryption Scheme[J]. Stanford University, 2009.
3	YAO Q Z . Protocols for secure computations[A]. Proceedings of 23rd Annual IEEE Symposium on Foundations of Computer Science[C]. Los Alamitos:IEEE Computer Society Press, 1982.160-164.
4	GOLDREICH O , MICALI S , WIGDERSON A . How to play any mental game[A]. The 19th Annual ACM Conference on Theory of Computing[C]. New York, 1987.218-229.
5	GOLDWASSER S . Multiparty computations:past and present[A]. Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing[C]. Santa Barbara,C A,USA, 1997.1-6.
6	DU W L J A . Secure multiparty computation problems and their applications[A]. A Review and Open Problems New Security Paradigms Workshop 2001[C]. Cloudcroft ,New Mexico,USA, 2001.
7	GENG T , LUO S , XIN Y , et al. Research on secure multiparty computational geometry[J]. Information Computing and Applications, 2011.322-329.
8	刘文，王永滨 . 安全多方信息比较相等协议及其应用[J]. 电子学报, 2012,40(5):871-876. LIU W , WANG Y B . Secure multi-party comparing protocol and its applications[J]. ACTA Electronica Sinica, 2012,40(5):871-876.
9	ZHONG H , SUN Y F , YAN F F , et al. Protocol for privacy-preserving space closet-pair of points[J]. Computer Engineering and Applications, 2011,48(4):87-89.
10	LU S F , LUO Y L . Privacy-preserving in graham algorithm for finding convex hulls[J]. Computer Engineering and Application, 2008,44(36):130-133.
11	WANG Q , LUO Y L , HUANG L S . Privacy-preserving protocols for finding the convex hulls[A]. ARES’ 08[C]. Washington,USA, 2008.727-732.
12	SUN M H , LUO S S , et al. Secure two-party line segments intersection scheme and its application inprivacy-preserveing convex hull intersection[J]. Journal on Communcatios, 2013,34(1):30-42.
13	GOLDREICH O . The foundations of cryptography[A]. Basic Applications[C]. Cambridge:Cambridge University Press, 2004.
14	SANDER T , TSCHUDIN C . Protecting mobile agents against malicious hosts[A]. Proceeding of IEEE Symposium of Research in Security and Privacy 1998[C]. Oakland,California,USA, 1998.215-224.
15	胡予濮 . 格上全同态加密[EB/OL]. . HU Y P . Fully homomorphic encryption on lattice[EB/OL]. .
16	罗永龙, 黄刘生, 徐维江等. 一个保护私有信息的多边形相交判定协议[J]. 电子学报, 2007,35(4):685-691. LUO Y L , HUANG L S , XU W J , et al. A protocol for privacy-preserving intersect-determination of two polygons[J]. ACTA Electronica Sinica, 2007,35(4):685-691.
17	CHEN Z , ZHANG R , LI Z , et al. A homomorphic ElGamal variant based on BGN’s method[A]. 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC.2013)[C]. Beijing:IEEE Computer Society Press, 2013.1-5.
18	李顺东, 戴一奇, 王道顺等. 几何相交问题的多方保密计算[J]. 清华大学学报, 2007,47(10):1692-1695. LI S D , DAI Y Q , WANG D S , et al. Secure multi-party computations of geometric intersections[J]. Journal of Tsinghua University, 2007,47(10):1692-1695.
19	罗永龙, 黄刘生, 荆巍巍等. 保护私有信息的叉积协议及其应用[J]. 计算机学报, 2007,30(2):248-254. LUO Y L , HUANG L S , JING W W , et al. Privacy-preserving cross product protocol and its application[J]. Chinese Journal of Computers , 2007,30(2):248-254.
20	刘文, 罗守山, 陈萍 . 保护私有信息的点线关系判定协议及其应用[J]. 北京邮电大学学报, 2008,31(2):72-75. LIU W , LUO P , CHEN C . Privacy-preserving point-line relation determination protocol and its application[J]. Journal of Beijing University of Posts and Telecommunications, 2008,31(2):72-75.

Metrics

Recommended 0

No Suggested Reading articles found!

文献	计算复杂度	通信复杂度	百万富翁协议	n选1的OT协议
本文	O (log p)	4	N	N
文献[12]	O (r log N)	4+3C_a	Y	N
文献[16]	O( ²n )	6	N	Y
文献[19]	O(nlog N+n²)	4C_a+4C_c	Y	Y
文献[20]	O(C log N)	8+3C_a	Y	N

[1]	Xindi MA, Qinghua LI, Qi JIANG, Zhuo MA, Sheng GAO, Youliang TIAN, Jianfeng MA. Byzantine-robust federated learning over Non-IID data [J]. Journal on Communications, 2023, 44(6): 138-153.
[2]	Shengxing YU, Zhong CHEN. Efficient secure federated learning aggregation framework based on homomorphic encryption [J]. Journal on Communications, 2023, 44(1): 14-28.
[3]	Yatao YANG, Deli LIU, Peihe LIU, Ping ZENG, Song XIAO. BFV-Blockchainvoting: blockchain-based electronic voting systems with BFV full homomorphic encryption [J]. Journal on Communications, 2022, 43(9): 100-111.
[4]	Xuewang ZHANG, Zhihong LI, Jinzhao LIN. Privacy protection scheme based on fair blind signature and hierarchical encryption for consortium blockchain [J]. Journal on Communications, 2022, 43(8): 131-141.
[5]	Gaofeng HE, Qianfeng WEI, Xiancai XIAO, Haiting ZHU, Bingfeng XU. Confirmation method for the detection of malicious encrypted traffic with data privacy protection [J]. Journal on Communications, 2022, 43(2): 156-170.
[6]	Haining YU, Hongli ZHANG, Xiangzhan YU, Jiaxing QU, Mengmeng GE. Privacy-preserving trajectory similarity computation method [J]. Journal on Communications, 2022, 43(11): 1-13.
[7]	Sheng GAO, Kang XIANG, Youliang TIAN, Weijie TAN, Tao FENG, Xiaoxue WU. BCP-based joint delegation learning model and protocol [J]. Journal on Communications, 2021, 42(5): 137-148.
[8]	Ruiqi LI, Chunfu JIA, Yafei WANG. Multi-key homomorphic proxy re-encryption scheme based on NTRU and its application [J]. Journal on Communications, 2021, 42(3): 11-22.
[9]	Chunfu JIA, Ruiqi LI, Yafei WANG. Privacy protection scheme of DBSCAN clustering based on homomorphic encryption [J]. Journal on Communications, 2021, 42(2): 1-11.
[10]	Yousheng ZHOU,Chang TAN,Fei TANG. Multi-dimensional secure query scheme for fog-enhanced IIoT [J]. Journal on Communications, 2020, 41(8): 175-186.
[11]	Youliang TIAN,Qiuxian LI,Duo ZHANG,Linjie WANG. Provably secure rational delegation computation protocol [J]. Journal on Communications, 2019, 40(7): 135-143.
[12]	Bin WANG,Lei ZHANG,Guoyin ZHANG. Attribute generalization mix-zone based on multiple secure computation [J]. Journal on Communications, 2019, 40(4): 83-94.
[13]	Wenxian JIANG,Zhenxing ZHANG,Jingjing WU. Reversible digital watermarking-based protocol for data integrity in wireless sensor network [J]. Journal on Communications, 2018, 39(3): 118-127.
[14]	Yong-li TANG,Ming-xing HU,Kun LIU,Qing YE,Xi-xi YAN. Novel identity-based fully homomorphic encryption scheme from lattice [J]. Journal on Communications, 2017, 38(5): 39-47.
[15]	Yong-hui ZHENG,Yuan-ji KANG,Chun-xiang GU,Hui DONG. Attribute-based fully homomorphic encryption scheme over rings [J]. Journal on Communications, 2017, 38(4): 55-63.

Design for secure two-party computation protocol based on ElGamal variant’s homomorphic

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 4

References 20

Related Articles 15

Metrics

Recommended 0