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

Zhi-wei CHEN; Juan-mei ZHANG; Zi-chen LI

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

您当前的位置：

首页 >

文章列表页 >

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

Academic telecommunication | 更新时间：2024-06-05

- Design for secure two-party computation protocol based on ElGamal variant’s homomorphic
- Journal on Communications Vol. 36, Issue 2, Pages: 204-211(2015)
- 作者机构：
  
  1. 数据通信科学技术研究所，北京 100191
  2. 北京电子科技学院信息安全系，北京 100070
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61070219);The National Natural Science Foundation of China(61370188);The Fundamental Research Funds for the Central Universities
- DOI：10.11959/j.issn.1000-436x.2015050
  CLC： TP918.1
- Online First：2015-02，
  
  Published：25 February 2015
- 稿件说明：
移动端阅览
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.
DOI：

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. DOI： 10.11959/j.issn.1000-436x.2015050.

摘要

本文分析了ElGamal的同态特性，针对协议设计需要，设计了ElGamal变体加密方案，使其满足加法同态和常数乘法同态。在半诚实模型下，基于这个变体提出了过私有点直线方程同态计算协议，并分析了协议的正确性、安全性、计算和通信复杂性，同时将该协议的应用范围扩展到安全两方线段求交协议等。与解决同类几何问题的协议相比，未采用基于不经意传输和百万富翁协议设计思路，而是基于同态加密体制提出了一种安全两方计算协议，提高了该类协议的执行效率，降低了通信负担。

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.

关键词

Keywords

references

RIVEST R , ADLEMAN L , DERTOUZOS M . On Data Banks and Privacy Homeomorphisms [M ] . In Foundations of Secure Computation , 1978 . 169 - 177 .

GENTRY C . A Fully Homomorphic Encryption Scheme [J ] . Stanford University , 2009 .

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 .

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 .

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 .

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 .

GENG T , LUO S , XIN Y , et al . Research on secure multiparty computational geometry [J ] . Information Computing and Applications , 2011 . 322 - 329 .

刘文，王永滨 . 安全多方信息比较相等协议及其应用 [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 .

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 .

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 .

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 .

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 .

GOLDREICH O . The foundations of cryptography [A ] . Basic Applications [C ] . Cambridge:Cambridge University Press , 2004 .

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 .

胡予濮 . 格上全同态加密 [EB/OL ] . http://meeting.xidian.edu.cn/html/lectures/201211/324.html.2012 http://meeting.xidian.edu.cn/html/lectures/201211/324.html.2012 .

HU Y P . Fully homomorphic encryption on lattice [EB/OL ] . http://meeting.xidian.edu.cn/html/lectures/201211/324.html.2012 http://meeting.xidian.edu.cn/html/lectures/201211/324.html.2012 .

罗永龙 , 黄刘生 , 徐维江等 . 一个保护私有信息的多边形相交判定协议 [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 .

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 .

李顺东 , 戴一奇 , 王道顺等 . 几何相交问题的多方保密计算 [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 .

罗永龙 , 黄刘生 , 荆巍巍等 . 保护私有信息的叉积协议及其应用 [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 .

刘文 , 罗守山 , 陈萍 . 保护私有信息的点线关系判定协议及其应用 [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 .

Views

2451

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Homomorphic encryption based privacy protection protocol for point-of-interest queries in Internet of vehicles

Efficient verifiable privacy neural network inference framework for cloud single-node

Image device identification and identity privacy protection method via integration of homomorphic encryption and PRNU fingerprints

Survey of research on efficient secure inference for deep learning

Fairly verifiable multi-user homomorphic proxy re-encryption scheme

Related Author

FAN Xinyue

ZHOU Meixian

TIAN Youliang

CHEN Shuangli

YANG Jiangdi

LI Mengqian

ZHANG Xinyu

Celimuge Wu

Related Institution

School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications

Graduate School of Informatics and Engineering, The University of Electro-Communications, Chofu

College of Computer Science and Technology, Guizhou University

College of Big Data and Information Engineering, Guizhou University

Guizhou Provincial Key Laboratory of Cryptography and Blockchain Technology, Guizhou University

AI问答

⁰