新的安全分布式n个秘密乘积共享方案

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

Abstract

Abstract:

Since Shamir’s secret sharing scheme does not have the property of the multiplicative homomorphism，an encoding method is utilized for privacy-preserving data to overcome the drawbacks in secure distributed multiplication calculation when using traditional Shamir’s polynomial to share the product of n secrets.Using this encoding method with multiplicative homomorphism and a commitment scheme supporting additive homomorphism，a new secure distributed secret sharing scheme of n product in one session is implemented and the proposed scheme is secure under the presence of malicious participants.The analysis shows that proposed scheme is not only more simple and feasible but also more efficient than previous schemes.

Key words: G?del encoding, secret sharing, distribution, secure multi-party multiplication, homomorphic commitment

Zhen-hua CHEN,Shun-dong LI,Bao-cang WANG,Ji-liang LI,Xin LIU. New secure distributed secret sharing scheme of n product[J]. Journal on Communications, 2014, 35(11): 139-145.

Figures/Tables 3

References 12

[1]	BEN-OR M ， GOLDWASSER S ， WIGDERSON A . Completeness theorems for non-cryptographic fault-tolerant distributed computations[A]. Proceedings of the 20th Annual ACM Symposium on the Theory of Computing[C]. New York，USA， 1988. 1-10.
[2]	RABIN T ， BEN-OR M . Verifiable secret sharing and multiparty protocols with honest majority[A]. Proceedings of the 21th Annual ACM Symposium on Theory of Computing[C]. New York，USA， 1989. 73-85.
[3]	SHAMIR A . How to share a secret[J]. Communications of the Association for Computing Machinery， 1979，22(3): 612-613.
[4]	GENNARO R ， RABIN M ， RABIN T . Simplified VSS and fast-track multiparty computations with applications to threshold cryptography[A]. Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing[C]. New York，USA， 1998. 101-111.
[5]	ABE M . Robust distributed multiplication without interaction[A]. Cryptology-CRYPTO’ 99[C]. Santa Barbara，California，USA， 2000. 130-147.
[6]	PEDERSEN T . Non-interactive and information-theoretic secure verifiable secret sharing[A]. Cryptology-CRYPTO’ 91[C]. Santa Barbara，California，USA， 1992. 129-140.
[7]	王宏，冯登国，肖国镇 . 整数上鲁棒分布式乘法计算方案[J]. 软件学报， 2002，13(8): 1412-1416. WANG H ， FENG D G ， XIAO G Z . Robust distributed multiplication schemes over integer[J]. Journal of Software， 2002，13(8): 1412-1416.
[8]	DAMGARD I ， K?LKER J ， MILTERSEN P . Secret sharing and secure computing from monotone formulae[J]. IACR Cryptology ePrint Archive， 2012，2012：536.
[9]	CRAMER R ， DAMGARD I ， MAURER U . General secure multi-party computation from any linear secret-sharing scheme[A]. Cryptology-EUROCRYPTO 2000[C]. Bruges，Belgium， 2000. 316-334.
[10]	NIKOV V ， NIKOVA S ， PRENEEL B . Secure multi-party computation from any linear secret sharing scheme[A]. Cryptology-EUROCRYPT 2000[C]. 2000. 316-334.
[11]	CRAMER R ， DAMGARD I . Zero-knowledge proofs for finite field arithmetic，or:can zero-knowledge be for free?[A]. Cryptology-CRYPTO’ 98[C]. Santa Barbara，California，USA， 1998. 424-441.
[12]	PAILLIER P . Public-key cryptosystems based on composite degree residue classes[A]. Cryptology-EUROCRYPTO’99[C]. Prague，Czech Republic， 1999. 223-238.

Metrics

Recommended 0

No Suggested Reading articles found!

阶段	计算开销（每个参与者）	通信开销/轮
第一阶段	(2n+1)M_q	1
第二阶段	nM_q	0
第三阶段	6n M_q	4
第四阶段	2n M_p	0
第五阶段	nM_q	1
第六阶段	n (n?1)	0

方案	计算成本	性能1	性能2	性能3	性能4
文献[4]	(10n ²+n)M_q+(t³+3n(2t+1)+3t+1)M_p	是	否	否	否
文献[5]	(7n ²+3(t+1))M_q+(t³+3n(3t+2))M_p	是	否	否	否
本文方案	(10n ²+n)M_q+2n² M_p	是	是	是	是

[1]	Jinbo XIONG, Yongjie ZHOU, Renwan BI, Liang WAN, Youliang TIAN. Towards edge-collaborative, lightweight and privacy-preserving classification framework [J]. Journal on Communications, 2022, 43(1): 127-137.
[2]	Taoshen LI, Anni SHI, Zhe WANG, Lu HE. Optimal relay selection for full duplex SWIPT-NOMA systems with maximal throughput [J]. Journal on Communications, 2021, 42(5): 87-97.
[3]	Tao HAN, Wei HE, Jun DAI, Yong ZUO, Yang YANG, Xiaohu GE. Connectivity analysis of IoV based on scale-free network [J]. Journal on Communications, 2021, 42(4): 100-108.
[4]	Yan CAI, Fan WU, Hongbo ZHU. Caching strategy based on transmission delay for D2D cooperative edge caching system [J]. Journal on Communications, 2021, 42(3): 183-189.
[5]	Hai LIU, Youliang TIAN, Ying TANG, Jianbing Ni, Jianfeng MA. Design models of secret reconstruction towards rational users [J]. Journal on Communications, 2021, 42(11): 54-65.
[6]	Hongjun LI,Chaobo LI,Shibing ZHANG. Noise robust chi-square generative adversarial network [J]. Journal on Communications, 2020, 41(3): 33-44.
[7]	Quanhua ZHAO,Xiao WANG,Yu LI,Guanghui WANG. Ship detection optimization method in SAR imagery based on multi-feature weighting [J]. Journal on Communications, 2020, 41(3): 91-101.
[8]	Yi WANG,Yaping WANG. Research on the system error performance of coherent orthogonal frequency division multiplexing system with M-distribution in satellite-to-ground laser communication [J]. Journal on Communications, 2020, 41(10): 179-187.
[9]	Jinbo XIONG,Renwan BI,Qianxin CHEN,Ximeng LIU. Towards edge-collaborative,lightweight and secure region proposal network [J]. Journal on Communications, 2020, 41(10): 188-201.
[10]	Hua WANG,Yongli ZHAO. Overview of quantum key distribution metropolitan optical networking technology [J]. Journal on Communications, 2019, 40(9): 168-174.
[11]	Yongsheng ZHAO,Dexiu HU,Ke JIN,Zhixin LIU,Yongjun ZHAO. Migration compensation algorithm for maneuvering target in passive radar based on FRT-MLVD [J]. Journal on Communications, 2019, 40(7): 95-103.
[12]	Yuan XU,Chao YANG,Li YANG. Single password authentication method for remote user based on mobile terminal assistance [J]. Journal on Communications, 2019, 40(2): 174-187.
[13]	Hao LONG, Shukui ZHANG, Yang ZHANG, Li ZHANG. Task distribution algorithm based on community in mobile crowd sensing [J]. Journal on Communications, 2019, 40(10): 42-54.
[14]	Yanshuo ZHANG,Wenjing LI,Lei CHEN,Wei BI,Tao YANG. Verifiable special threshold secret sharing scheme based on eigenvalue [J]. Journal on Communications, 2018, 39(8): 169-175.
[15]	Tianshuang QIU,Xing CHEN,Jitong MA,Jingchun LI,Rong LI. Carrier frequency estimation method of time-frequency overlapped signals based on cyclic correntropy spectrum [J]. Journal on Communications, 2018, 39(6): 20-26.

New secure distributed secret sharing scheme of n product

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 3

References 12

Related Articles 15

Metrics

Recommended 0