Cloud outsourcing secret sharing scheme against covert adversaries

En ZHANG; Kui GENG; Wei JIN; Yong-jun LI; Yun-qing SUN; Feng-hua LI

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

您当前的位置：

首页 >

文章列表页 >

Cloud outsourcing secret sharing scheme against covert adversaries

Papers | 更新时间：2024-06-05

- Cloud outsourcing secret sharing scheme against covert adversaries
- Journal on Communications Vol. 38, Issue 5, Pages: 57-65(2017)
- 作者机构：
  
  1. 中国科学院信息工程研究所信息安全国家重点实验室，北京 100195
  2. 河南师范大学计算机与信息工程学院，河南新乡453007
  3. 中国科学院大学网络空间安全学院，北京 100049
  4. 西安电子科技大学通信工程学院，陕西西安 710071
- 作者简介：
- 基金信息：
  
  The National High Technology Research and Development Program (863 Program)(2015AA016007);The National Natural Science Foundation of China –Guangdong Union Foundation(U1401251);The National Natural Science Foundation of China(U1604156);Innovative Practice Project of College Students in Chinese Academy of Sciences(1188005088);Science and Technology Research Project of Henan Province(172102210045)
- DOI：10.11959/j.issn.1000-436x.2017100
  CLC： TP309.2
- Online First：2017-05，
  
  Published：25 May 2017
- 稿件说明：
移动端阅览
En ZHANG, Kui GENG, Wei JIN, et al. Cloud outsourcing secret sharing scheme against covert adversaries[J]. Journal on Communications, 2017, 38(5): 57-65.
DOI：

En ZHANG, Kui GENG, Wei JIN, et al. Cloud outsourcing secret sharing scheme against covert adversaries[J]. Journal on Communications, 2017, 38(5): 57-65. DOI： 10.11959/j.issn.1000-436x.2017100.

摘要

为了促使计算能力薄弱的云租户有效及公平地重构秘密，结合云外包计算和秘密共享特性，提出一种云外包秘密共享方案。在云外包秘密共享过程中，云租户间无需交互，只需进行少量解密和验证操作，而将复杂耗时的秘密重构计算外包给云服务提供商。该方案无需复杂的交互论证或零知识证明，能够及时发现云租户和云服务提供商的恶意行为，达到抵抗隐蔽敌手攻击的目的，最终每位云租户都能够公平和正确地得到秘密。安全分析和性能比较表明方案是安全和有效的。

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.

关键词

Keywords

references

SHAMIR A . How to share a secret [J ] . Communications of the ACM , 1979 , 22 ( 1 ): 612 - 613 .

BLAKELEY G R , . Safeguarding cryptographic keys [C ] // The National Computer Conference . 1979 . 313 - 317 .

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 .

FELDMAN P , . A practical scheme for non-interactive verifiable secret sharing [C ] // 28th IEEE Annual Symposium Foundations of Computer Science . 1987 : 427 - 438 .

PEDERSEN T P , . Distributed provers with applications to undeniable signatures [C ] // Advances in Cryptology—EUROCRYPT’91 . 1991 : 221 - 242 .

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 .

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 .

刘木兰 , 肖亮亮 , 张志芳 . 一类基于图上随机游动的密钥共享体制 [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 .

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 .

DEHKORDI M H , FARZANEH Y . A new verifiable multi-secret sharing scheme realizing adversary structure [J ] . Wireless Personal Communications , 2015 , 82 ( 3 ): 1749 - 1758 .

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 .

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 .

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 .

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 .

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 .

KOMARGODSKI I , ZHANDRY M . Cutting-edge cryptography through the lens of secret sharing [C ] // Theory of Cryptography . 2016 : 449 - 479 .

TOMPA M , WOLL H . How to share a secret with cheaters [J ] . Journal of Cryptology , 1989 , 1 ( 3 ): 133 - 138 .

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 .

HALPERN J , TEAGUE V . Rational secret sharing and multiparty computation [C ] // The 6th Annual ACM Symposium on Theory of Computing . ACM , 2004 : 623 - 632 .

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 .

ZHANG Z F , LIU M L . Rational secret sharing as extensive games [J ] . Science China Information Sciences , 2013 , 56 ( 3 ): 1 - 13 .

MALEKA S , SHAREEF A , RANGAN C P . Rational secret sharing with repeated games [C ] // Information Security Practice and Experience . 2008 : 334 - 346 .

KOL G , NAOR M . Cryptography and game theory:designing protocols for exchanging information [M ] // Theory of Cryptography . Springer Berlin Heidelberg , 2008 : 320 - 339 .

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 .

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 .

GENNARO R , GENTRY C , PARNO B . Non-interactive verifiable computing:outsourcing computation to untrusted workers [C ] // Advances in Cryptology–CRYPTO 2010 . 2010 : 465 - 482 .

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 .

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 .

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 .

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 .

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.

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 .

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 .

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 .

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 .

AUMANN Y , LINDELL Y . Security against covert adversaries:efficient protocols for realistic adversaries [J ] . Journal of Cryptology , 2010 , 23 ( 2 ): 281 - 343 .

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 .

STEHLÉ D , STEINFELD R , . Making NTRU as secure as worst-case problems over ideal lattices [C ] // Advances in Cryptology− EUROCRYPT 2011 . 2011 : 27 - 47 .

Views

3078

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

K-Means clustering outsourcing scheme based on sparse matrix transformation and bounded random perturbation

Anonymous whistleblowers reply scheme based on secret sharing

Role-based abstract modeling of blockchain auction contracts and verification of temporal security and fairness

Light weighted privacy protection ViT inference framework based on secret sharing

Edge computing offloading policies and resource allocation considering system fairness in trusted environments

Related Author

Zhao Wei

Tan Jingwen

Wang Huanran

Han Shuai

Yang Wu

Lai Mingzhu

HE Kun

HUANG Yajing

Related Institution

School of Mathematics and Statistics, Hainan Normal University

School of Computer Science and Technology, Harbin Engineering University

School of Cyber Science and Engineering, Wuhan University

National-level International Science and Technology Cooperation Base of Networked Supporting Software, Jiangxi Normal University

School of Software, East China University of Technology

AI问答

⁰