抗隐蔽敌手的云外包秘密共享方案

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

Abstract

Abstract:

In order to make computationally weak cloud tenants can reconstruct a secret with efficiency and fairness,a cloud outsourcing secret sharing scheme was proposed,which combined cloud outsourcing computation with secret sharing scheme.In the process of outsourcing secret sharing,cloud tenants just need a small amount of decryption and validation operations,while outsource expensive cryptographic operations to cloud service provider (CSP).The scheme,without complex interactive augment or zero-knowledge proof,could detect malicious behaviors of cloud tenants or cloud service providers.And the scheme was secure against covert adversaries.Finally,every cloud tenant was able to obtain the secret fairly and correctly.Security analysis and performance comparison show that scheme is safe and effective.

Key words: secret sharing, outsourcing computation, covert adversaries, fairness

CLC Number:

TP309.2

En ZHANG,Kui GENG,Wei JIN,Yong-jun LI,Yun-qing SUN,Feng-hua LI. Cloud outsourcing secret sharing scheme against covert adversaries[J]. Journal on Communications, 2017, 38(5): 57-65.

Figures/Tables 2

References 38

[1]	SHAMIR A . How to share a secret[J]. Communications of the ACM, 1979,22(1): 612-613.
[2]	BLAKELEY G R , . Safeguarding cryptographic keys[C]// The National Computer Conference. 1979. 313-317.
[3]	CHOR B , GOLDWASSER S , MICALI S ,et al. Verifiable secret sharing and achieving simultaneity in the presence of faults[C]// 26th IEEE Annual Symposium on Foundations of Computer Science. 1985: 383-395.
[4]	FELDMAN P , . A practical scheme for non-interactive verifiable secret sharing[C]// 28th IEEE Annual Symposium Foundations of Computer Science. 1987: 427-438.
[5]	PEDERSEN T P , . Distributed provers with applications to undeniable signatures[C]// Advances in Cryptology—EUROCRYPT’91. 1991: 221-242.
[6]	ZHANG F T , ZHANG J . Efficient and information-theoretical secure verifiable secret sharing over bilinear groups[J]. Chinese Journal of Electronics, 2014,23(1): 13-17.
[7]	MAHABIR P J , AYINEEDI V , REIHANEH S N . Paillier-based publicly verifiable (non-interactive) secret sharing[J]. Designs Codes and Cryptography, 2014,73(2): 529-540.
[8]	刘木兰, 肖亮亮, 张志芳 . 一类基于图上随机游动的密钥共享体制[J]. 中国科学E辑：信息科学, 2007,37(2): 199-208.
	LIU M L , XIAO L L , ZHANG Z F . Secret sharing schemes based on random walks on graphs[J]. Science in China (Series E), 2007,37(2): 199-208.
[9]	HOU Y C , QUAN Z Y , TSAI C F ,et al. Block-based progressive visual secret sharing[J]. Information Sciences, 2013,233(1): 290-304.
[10]	DEHKORDI M H , FARZANEH Y . A new verifiable multi-secret sharing scheme realizing adversary structure[J]. Wireless Personal Communications, 2015,82(3): 1749-1758.
[11]	FATEMI M , GHASEMI R , EGHLIDOS T ,et al. Efficient multistage secret sharing scheme using bilinear map[J]. Information Security,IET, 2014,8(4): 224-229.
[12]	MASHHADI S , DEHKORDI M H . Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem[J]. Information Sciences, 2015,294(2): 31-40.
[13]	LIU Y H , ZHANG F T , ZHANG J . Attacks to some verifiable multi-secret sharing schemes and two improved schemes[J]. Information Sciences, 2016,329(1): 524-539.
[14]	CRAMER R , DAMG?RD I B , D?TTLING N ,et al. Linear secret sharing schemes from error correcting codes and universal hash functions[C]// Advances in Cryptology-EUROCRYPT 2015. Springer Berlin Heidelberg, 2015: 313-336.
[15]	MOHAMMA H T , HADI K , MOHAMMAD S H . Dynamic and verifiable multi-secret sharing scheme based on hermite interpolation and bilinear maps[J]. Information security,IET, 2015,9(4): 234-239.
[16]	KOMARGODSKI I , ZHANDRY M . Cutting-edge cryptography through the lens of secret sharing[C]// Theory of Cryptography. 2016: 449-479.
[17]	TOMPA M , WOLL H . How to share a secret with cheaters[J]. Journal of Cryptology, 1989,1(3): 133-138.
[18]	HARN L , LIN C , LI Y . Fair secret reconstruction in (t,n ) secret sharing[J]. Journal of Information Security ＆ Applications, 2015,23(C): 1-7.
[19]	HALPERN J , TEAGUE V . Rational secret sharing and multiparty computation[C]// The 6th Annual ACM Symposium on Theory of Computing. ACM, 2004: 623-632.
[20]	TIAN Y L , PENG C G , LIN D D ,et al. Bayesian mechanism for rational secret sharing scheme[J]. Science China Information Sciences, 2015,58(5): 1-13.
[21]	ZHANG Z F , LIU M L . Rational secret sharing as extensive games[J]. Science China Information Sciences, 2013,56(3): 1-13.
[22]	MALEKA S , SHAREEF A , RANGAN C P . Rational secret sharing with repeated games[C]// Information Security Practice and Experience. 2008: 334-346.
[23]	KOL G , NAOR M . Cryptography and game theory:designing protocols for exchanging information[M]// Theory of Cryptography. Springer Berlin Heidelberg, 2008: 320-339.
[24]	ZHANG E , CAI Y Q . Rational multi-secret sharing scheme in standard point-to-point communication networks[J]. International Journal of Foundations of Computer Science, 2013,24(6): 879-897.
[25]	WILLIAM K , MOSES J C , RANGAN P . Rational secret sharing over an asynchronous broadcast channel with information theoretic security[J]. International Journal of Network Security ＆ Its Applications, 2011,3(6): 1-18.
[26]	GENNARO R , GENTRY C , PARNO B . Non-interactive verifiable computing:outsourcing computation to untrusted workers[C]// Advances in Cryptology–CRYPTO 2010. 2010: 465-482.
[27]	PARNO B , RAYKOVA M , VAIKUNTANATHAN V . How to delegate and verify in public:verifiable computation from attribute-based encryption[C]// Theory of Cryptography. 2012: 422-439.
[28]	GOLDWASSER S , KALAI Y , POPA R A ,et al. Reusable garbled circuits and succinct functional encryption[C]// The 44th Annual ACM Symposium on Theory of Computing. 2013: 555-564.
[29]	LóPEZ-ALT A , TROMER E , VAIKUNTANATHAN V . On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption[C]// The 44th Annual ACM Symposium on Theory of Computing. 2012: 1219-1234.
[30]	GORDON S D , KATZ J , LIU F H ,et al. Multi-client verifiable computation with stronger security guarantees[C]// Theory of Cryptography. 2015: 144-168.
[31]	ZHANG E , LI F H , NIU B ,et al. Server-aided private set intersection based on reputation[J]. Information Sciences, 2016,doi:10.1016/j.ins.2016.09.056.
[32]	ZHANG F G , MA X , LIU S L . Efficient computation outsourcing for inverting a class of homomorphic functions[J]. Information Sciences, 2014,286(1): 19-28.
[33]	CHEN X F , HUANG X Y , LI J ,et al. New algorithms for secure outsourcing of large-scale systems of linear equations[J]. IEEE Transactions on Information Forensics and Security, 2015,10(1): 69-78.
[34]	WANG C , REN K , WANG J . Secure optimization computation outsourcing in cloud computing:a case study of linear programming[J]. IEEE Transactions on Computers, 2016,65(1): 216-229.
[35]	REN Y L , DING N , ZHANG X P ,et al. Verifiable outsourcing algorithms for modular exponentiations with improved checkability[C]// The 11th ACM on Asia Conference on Computer and Communications Security. ACM, 2016: 293-303.
[36]	AUMANN Y , LINDELL Y . Security against covert adversaries:efficient protocols for realistic adversaries[J]. Journal of Cryptology, 2010,23(2): 281-343.
[37]	LYUBASHEVSKY V , PEIKERT C , REGEV O . On ideal lattices and learning with errors over ring[J]. Journal of the ACM, 2013,60(6): 1-35.
[38]	STEHLé D , STEINFELD R , . Making NTRU as secure as worst-case problems over ideal lattices[C]// Advances in Cryptology? EUROCRYPT 2011. 2011: 27-47.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	期望迭代轮数	是否需要成员交互	计算是否公平	通信开销	秘密重构算法
文献[13]	一轮	是	否	O(t)	用户
文献[14]	一轮	是	否	O(t)	用户
文献[18]	多轮	是	是	O(tk)	用户
文献[20]	多轮	是	是	O(tk)	用户
本文方案	一轮	否	是	O(1)	云端

Cloud outsourcing secret sharing scheme against covert adversaries

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 2

References 38

Related Articles 15

Metrics

Recommended 0

[1]	Yanjing SUN, Fengzhi CHENG, Jiasi ZHOU, Song LI. Design of fairness-driven RSMA-SDMA precoding [J]. Journal on Communications, 2022, 43(4): 177-185.
[2]	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.
[3]	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.
[4]	Yinghui YE,Liqin SHI,Guangyue LU. User-centric energy efficiency fairness in backscatter-assisted wireless powered communication network [J]. Journal on Communications, 2020, 41(7): 84-94.
[5]	Zhu WANG,Qingyun YUAN,Fanfan HAO,Liang FANG,Fenghua LI. Multipath congestion control algorithm based on link capacity [J]. Journal on Communications, 2020, 41(5): 59-71.
[6]	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.
[7]	Guozhen TAN,Guodong HAN,Fuxin ZHANG,Nan DING,Mingjian LIU. Distributed congestion control strategy using network utility maximization theory in VANET [J]. Journal on Communications, 2019, 40(2): 82-91.
[8]	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.
[9]	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.
[10]	Xin LIU,Qiuliang XU,Bin ZHANG,Bo ZHANG. k-times attribute-based authentication scheme using direct anonymous attestation [J]. Journal on Communications, 2018, 39(12): 113-133.
[11]	Fang QI,Yanmei LI,Zhe TANG. Revocable and traceable key-policy attribute-based encryption scheme [J]. Journal on Communications, 2018, 39(11): 63-69.
[12]	En ZHANG,Yaoyao PEI,Jiao DU. RLWE-based ciphertext-policy attribute proxy re-encryption [J]. Journal on Communications, 2018, 39(11): 129-137.
[13]	Jianwu LIANG,Xiaoshu LIU,Zi CHENG. Quantum secret sharing with graph states based on Chinese remainder theorem [J]. Journal on Communications, 2018, 39(10): 72-78.
[14]	Cheng-long SU,Guang JIN,Xian-liang JIANG,Jun NIU. Active queue management algorithm focusing on fairness and low delay [J]. Journal on Communications, 2017, 38(5): 199-206.
[15]	Xian-zhong XIE,Hua-bing LU,Zhao-yuan SHI. Fair and efficient opportunistic interference alignment algorithm based on round-robin scheduling [J]. Journal on Communications, 2017, 38(10): 1-9.