{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,18]],"date-time":"2023-11-18T00:26:40Z","timestamp":1700267200070},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T00:00:00Z","timestamp":1691193600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T00:00:00Z","timestamp":1691193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The traditional threshold secret sharing scheme only allows the participants\u2019 sub-secret shares to be used once in the reconstruction process. Several multi-secret sharing schemes have been proposed that are related to cloud computing, aiming to improve reconstruction efficiency. Rational secret sharing is a technique that combines secret sharing with game theory. In traditional rational multi-secret sharing, participants must reconstruct all secrets, resulting in unnecessary overhead. Rational participants will act dishonestly to maximize their own interests, leading to a prisoner\u2019s dilemma and incomplete secret reconstruction. Additionally, when sharing multiple secrets, the Dealer must distribute the sub-secret shares of all secrets to the participants, increasing overhead. In this paper, we propose a rational optional multi-secret sharing scheme based on a reputation mechanism that selectively reconstructs secrets according to participants\u2019 needs in the context of cloud computing. Our scheme introduces a reputation mechanism to evaluate participants\u2019 reputation values to avoid their dishonest behaviors. Furthermore, we adopt a broadcast encryption matrix so that participants only need to receive a single sub-secret share to participate in multi-secret reconstruction. Our security analysis shows that the proposed scheme can effectively constrain the self-interested behavior of rational participants and reduce the overhead in the process, thus multi-secret sharing scheme can provide more efficient and secure solutions for secret sharing in key management and distributive storage for the cloud scenarios.<\/jats:p>","DOI":"10.1186\/s13677-023-00495-7","type":"journal-article","created":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T06:01:41Z","timestamp":1691215301000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ROMSS: a rational optional multi-secret sharing scheme based on reputation mechanism"],"prefix":"10.1186","volume":"12","author":[{"given":"Ruonan","family":"Shi","sequence":"first","affiliation":[]},{"given":"Yuling","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Chaoyue","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Yun","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,5]]},"reference":[{"key":"495_CR1","doi-asserted-by":"crossref","unstructured":"Zhou X, Yang X, Ma J, Kevin I, Wang K (2021) Energy-efficient smart routing based on link correlation mining for wireless edge computing in IoT. IEEE Internet Things J 9(16):14988\u201314997","DOI":"10.1109\/JIOT.2021.3077937"},{"key":"495_CR2","doi-asserted-by":"crossref","unstructured":"Qi L, Yang Y, Zhou X, Rafique W, Ma J (2021) Fast anomaly identification based on multiaspect data streams for intelligent intrusion detection toward secure industry 4.0. IEEE Trans Ind Inf 18(9):6503\u20136511","DOI":"10.1109\/TII.2021.3139363"},{"key":"495_CR3","doi-asserted-by":"crossref","unstructured":"Zhou X, Xu X, Liang W, Zeng Z, Yan Z (2021) Deep-learning-enhanced multitarget detection for end\u2013edge\u2013cloud surveillance in smart IoT. IEEE Internet Things J 8(16):12588\u201312596","DOI":"10.1109\/JIOT.2021.3077449"},{"issue":"4","key":"495_CR4","doi-asserted-by":"publisher","first-page":"3295","DOI":"10.1109\/JIOT.2022.3179231","volume":"10","author":"X Zhou","year":"2022","unstructured":"Zhou X, Liang W, Yan K, Li W, Kevin I, Wang K, Ma J, Jin Q (2022) Edge-enabled two-stage scheduling based on deep reinforcement learning for internet of everything. IEEE Internet Things J 10(4):3295\u20133304","journal-title":"IEEE Internet Things J"},{"key":"495_CR5","doi-asserted-by":"publisher","unstructured":"Li Z, Xu X, Hang T, Xiang H, Cui Y, Qi L, Zhou X (2022) A knowledge-driven anomaly detection framework for social production system. IEEE Trans Comput Soc Syst pp 1\u201314. https:\/\/doi.org\/10.1109\/TCSS.2022.3217790","DOI":"10.1109\/TCSS.2022.3217790"},{"key":"495_CR6","doi-asserted-by":"publisher","unstructured":"Kong L, Li G, Rafique W, Shen S, He Q, Khosravi MR, Wang R, Qi L (2022) Time-aware missing healthcare data prediction based on arima model. IEEE\/ACM Trans Comput Biol Bioinforma 1\u201310. https:\/\/doi.org\/10.1109\/TCBB.2022.3205064","DOI":"10.1109\/TCBB.2022.3205064"},{"key":"495_CR7","first-page":"1","volume":"25","author":"L Kong","year":"2021","unstructured":"Kong L, Wang L, Gong W, Yan C, Duan Y, Qi L (2021) Lsh-aware multitype health data prediction with privacy preservation in edge environment. World Wide Web 25:1\u201316","journal-title":"World Wide Web"},{"issue":"11","key":"495_CR8","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"495_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.01.038","volume":"519","author":"L Harn","year":"2020","unstructured":"Harn L, Xia Z, Hsu C, Liu Y (2020) Secret sharing with secure secret reconstruction. Inf Sci 519:1\u20138","journal-title":"Inf Sci"},{"key":"495_CR10","doi-asserted-by":"publisher","unstructured":"Yang Y, Yang X, Heidari M, Khan MA, Srivastava G, Khosravi M, Qi L (2022) Astream: Data-stream-driven scalable anomaly detection with accuracy guarantee in IIoT environment. IEEE Trans Netw Sci Eng 1. https:\/\/doi.org\/10.1109\/TNSE.2022.3157730","DOI":"10.1109\/TNSE.2022.3157730"},{"key":"495_CR11","doi-asserted-by":"publisher","unstructured":"Dai H, Yu J, Li M, Wang W, Liu AX, Ma J, Qi L, Chen G (2022) Bloom filter with noisy coding framework for multi-set membership testing. IEEE Trans Knowl Data Eng 1\u201314. https:\/\/doi.org\/10.1109\/TKDE.2022.3199646","DOI":"10.1109\/TKDE.2022.3199646"},{"key":"495_CR12","doi-asserted-by":"crossref","unstructured":"Xu X, Gu J, Yan H, Liu W, Qi L, Zhou X (2023) Reputation-aware supplier assessment for blockchain-enabled supply chain in industry 4.0. IEEE Trans Ind Inf 19(4):5485\u20135494","DOI":"10.1109\/TII.2022.3190380"},{"key":"495_CR13","doi-asserted-by":"publisher","unstructured":"Qi L, Lin W, Zhang X, Dou W, Xu X, Chen J (2022) A correlation graph based approach for personalized and compatible web apis recommendation in mobile app development. IEEE Trans Knowl Data Eng 1. https:\/\/doi.org\/10.1109\/TKDE.2022.3168611","DOI":"10.1109\/TKDE.2022.3168611"},{"issue":"2","key":"495_CR14","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1109\/TCSS.2022.3168595","volume":"10","author":"S Wu","year":"2023","unstructured":"Wu S, Shen S, Xu X, Chen Y, Zhou X, Liu D, Xue X, Qi L (2023) Popularity-aware and diverse web apis recommendation based on correlation graph. IEEE Trans Comput Soc Syst 10(2):771\u2013782","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"9","key":"495_CR15","doi-asserted-by":"publisher","first-page":"6300","DOI":"10.1109\/TII.2022.3154473","volume":"18","author":"Y Jia","year":"2022","unstructured":"Jia Y, Liu B, Dou W, Xu X, Zhou X, Qi L, Yan Z (2022) Croapp: a CNN-based resource optimization approach in edge computing environment. IEEE Trans Ind Inf 18(9):6300\u20136307","journal-title":"IEEE Trans Ind Inf"},{"key":"495_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11280-020-00825-8","volume":"25","author":"F Wang","year":"2021","unstructured":"Wang F, Wang L, Li G, Wang Y, Lv C, Qi L (2021) Edge-cloud-enabled matrix factorization for diversified apis recommendation in mashup creation. World Wide Web 25:1\u201321","journal-title":"World Wide Web"},{"issue":"10","key":"495_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4018\/JOEUC.306752","volume":"34","author":"Y Luo","year":"2022","unstructured":"Luo Y, Chen Y, Li T, Wang Y, Yang Y, Yu X (2022) An entropy-view secure multiparty computation protocol based on semi-honest model. J Organ End User Comput 34(10):1\u201317","journal-title":"J Organ End User Comput"},{"issue":"1","key":"495_CR18","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/TII.2022.3170149","volume":"19","author":"X Zhou","year":"2022","unstructured":"Zhou X, Hu Y, Wu J, Liang W, Ma J, Jin Q (2022) Distribution bias aware collaborative generative adversarial network for imbalanced deep learning in industrial IoT. IEEE Trans Ind Inform 19(1):570\u2013580","journal-title":"IEEE Trans Ind Inform"},{"key":"495_CR19","doi-asserted-by":"publisher","unstructured":"Halpern J, Teague V (2004) Rational secret sharing and multiparty computation: Extended abstract. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, NY, USA, STOC \u201904, p 623\u2013632. https:\/\/doi.org\/10.1145\/1007352.1007447","DOI":"10.1145\/1007352.1007447"},{"issue":"7","key":"495_CR20","doi-asserted-by":"publisher","first-page":"3596","DOI":"10.1002\/int.22428","volume":"36","author":"T Li","year":"2021","unstructured":"Li T, Wang Z, Yang G, Cui Y, Chen Y, Yu X (2021) Semi-selfish mining based on hidden markov decision process. Int J Intell Syst 36(7):3596\u20133612","journal-title":"Int J Intell Syst"},{"key":"495_CR21","doi-asserted-by":"publisher","first-page":"5239","DOI":"10.1109\/TIFS.2021.3127023","volume":"16","author":"Y Chen","year":"2021","unstructured":"Chen Y, Dong S, Li T, Wang Y, Zhou H (2021) Dynamic multi-key fhe in asymmetric key setting from lwe. IEEE Trans Inf Forensic Secur 16:5239\u20135249","journal-title":"IEEE Trans Inf Forensic Secur"},{"key":"495_CR22","doi-asserted-by":"publisher","unstructured":"Kreps DM (1989) Nash equilibrium. Game theory 167\u2013177. https:\/\/doi.org\/10.1007\/978-1-349-20181-5_19","DOI":"10.1007\/978-1-349-20181-5_19"},{"key":"495_CR23","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-79104-1_24","volume":"4991","author":"S Maleka","year":"2008","unstructured":"Maleka S, Shareef A, Rangan CP (2008) Rational secret sharing with repeated games. Lect Notes Comput Sci 4991:334\u2013346","journal-title":"Lect Notes Comput Sci"},{"key":"495_CR24","doi-asserted-by":"publisher","unstructured":"Ong SJ, Parkes DC, Rosen A, Vadhan S (2009) Fairness with an honest minority and a rational majority. In: Reingold O (ed) Theory of Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 36\u201353. https:\/\/doi.org\/10.1007\/978-3-642-00457-5_3","DOI":"10.1007\/978-3-642-00457-5_3"},{"key":"495_CR25","doi-asserted-by":"publisher","unstructured":"Ba\u015far T (2021) Game Theory: A General Introduction and a Historical Overview, Springer International Publishing, Cham, pp 881\u2013886. https:\/\/doi.org\/10.1007\/978-3-030-44184-5_26","DOI":"10.1007\/978-3-030-44184-5_26"},{"key":"495_CR26","doi-asserted-by":"publisher","unstructured":"Zhang Z, Liu M (2011) Unconditionally secure rational secret sharing in standard communication networks. In: Information Security and Cryptology-ICISC 2010: 13th International Conference, Seoul, Korea, December 1-3, 2010, Revised Selected Papers 13, pp 355\u2013369. https:\/\/doi.org\/10.1007\/978-3-642-24209-0_24","DOI":"10.1007\/978-3-642-24209-0_24"},{"key":"495_CR27","doi-asserted-by":"publisher","unstructured":"Jin J, Zhou X, Ma C, Wang X (2016) A rational secret sharing relying on reputation. In: 2016 International Conference on Intelligent Networking and Collaborative Systems (INCoS), pp 384\u2013387. https:\/\/doi.org\/10.1109\/INCoS.2016.40","DOI":"10.1109\/INCoS.2016.40"},{"key":"495_CR28","doi-asserted-by":"publisher","unstructured":"Simmons GJ (1992) An Introduction to Shared Secret and\/or Shared Control Schemes and Their ApplicationThis work was performed at Sandia National Laboratories and supported by the U.S. Department of Energy under contract number DEAC0476DPOO789, pp 441\u2013497. https:\/\/doi.org\/10.1109\/9780470544327.ch9","DOI":"10.1109\/9780470544327.ch9"},{"key":"495_CR29","unstructured":"Wu J, Tao W (2004) Threshold multi-secret sharing scheme. Acta Electron Sin 32(Supp):1688\u20131689"},{"key":"495_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-019-2858-8","volume":"64","author":"Z Chen","year":"2021","unstructured":"Chen Z, Tian Y, Peng C (2021) An incentive-compatible rational secret sharing scheme using blockchain and smart contract. Sci China Inf Sci 64:1\u201321","journal-title":"Sci China Inf Sci"},{"key":"495_CR31","doi-asserted-by":"publisher","unstructured":"Yurek T, Luo L, Fairoze J, Kate A, Miller A (2021) hbacss: How to robustly share many secrets. Cryptol ePrint Arch. https:\/\/doi.org\/10.14722\/ndss.2022.23120","DOI":"10.14722\/ndss.2022.23120"},{"key":"495_CR32","doi-asserted-by":"crossref","unstructured":"Wang Y, Li T, Liu M, Li C, Wang H (2022) Stsiiml: Study on token shuffling under incomplete information based on machine learning. Int J Intell Syst 37:11078 \u2013 11100","DOI":"10.1002\/int.23033"},{"key":"495_CR33","doi-asserted-by":"publisher","unstructured":"Harsanyi JC, Harsanyi JC (1982) Games with incomplete information played by \u201cbayesian\u201d players, i\u2013iii part i. the basic model. Pap Game Theory 115\u2013138. https:\/\/doi.org\/10.1287\/mnsc.1040.0270","DOI":"10.1287\/mnsc.1040.0270"},{"issue":"8","key":"495_CR34","first-page":"17","volume":"43","author":"H Liu","year":"2020","unstructured":"Liu H, Li X, Tian Y, Luo B, Ma J, Peng C (2020) A rational and fair secret sharing scheme. J Comput Res Dev 43(8):17","journal-title":"J Comput Res Dev"},{"key":"495_CR35","doi-asserted-by":"publisher","unstructured":"Yang CN, Lai JB (2013) Protecting data privacy and security for cloud computing based on secret sharing. In: 2013 International Symposium on Biometrics and Security Technologies, pp 259\u2013266. https:\/\/doi.org\/10.1109\/ISBAST.2013.46","DOI":"10.1109\/ISBAST.2013.46"},{"issue":"5","key":"495_CR36","first-page":"276","volume":"30","author":"J Zhang","year":"2021","unstructured":"Zhang J, Lin C, Ding J, Lin X, Li C (2021) A secure multi-use threshold multi-secret sharing scheme. J Comput Syst Appl 30(5):276\u2013281","journal-title":"J Comput Syst Appl"},{"issue":"177","key":"495_CR37","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz N (1987) Elliptic curve cryptosystems. Math Comput 48(177):203\u2013209","journal-title":"Elliptic curve cryptosystems. Math Comput"},{"key":"495_CR38","doi-asserted-by":"publisher","unstructured":"Liu A, Ning P (2008) Tinyecc: A configurable library for elliptic curve cryptography in wireless sensor networks. In: 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008), pp 245\u2013256. https:\/\/doi.org\/10.1109\/IPSN.2008.47","DOI":"10.1109\/IPSN.2008.47"},{"issue":"12","key":"495_CR39","doi-asserted-by":"publisher","first-page":"3999","DOI":"10.1073\/pnas.0308738101","volume":"101","author":"CA Holt","year":"2004","unstructured":"Holt CA, Roth AE (2004) The nash equilibrium: A perspective. Proc Natl Acad Sci 101(12):3999\u20134002","journal-title":"Proc Natl Acad Sci"},{"key":"495_CR40","doi-asserted-by":"publisher","unstructured":"Rapoport A (1989) Prisoner\u2019s dilemma. Game Theory pp 199\u2013204. https:\/\/doi.org\/10.1007\/978-1-349-20181-5_23","DOI":"10.1007\/978-1-349-20181-5_23"},{"key":"495_CR41","doi-asserted-by":"publisher","unstructured":"Abraham I, Dolev D, Gonen R, Halpern J (2006) Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pp 53\u201362. https:\/\/doi.org\/10.1145\/1146381.1146393","DOI":"10.1145\/1146381.1146393"},{"key":"495_CR42","doi-asserted-by":"publisher","unstructured":"Luo Y, Chen Y, Li T, Wang Y, Yang Y (2021) Using information entropy to analyze secure multi-party computation protocol. In: 2021 IEEE Intl Conf on Dependable, Autonomic and Secure Computing, Intl Conf on Pervasive Intelligence and Computing, Intl Conf on Cloud and Big Data Computing, Intl Conf on Cyber Science and Technology Congress (DASC\/PiCom\/CBDCom\/CyberSciTech), pp 312\u2013318. https:\/\/doi.org\/10.1109\/DASC-PICom-CBDCom-CyberSciTech52372.2021.00061","DOI":"10.1109\/DASC-PICom-CBDCom-CyberSciTech52372.2021.00061"},{"issue":"11","key":"495_CR43","first-page":"360","volume":"49","author":"Z Xie","year":"2022","unstructured":"Xie Z, Zhang Z, Li L, Feng Y, Chen J (2022) Improved practical byzantine fault tolerance algorithm based on consortium blockchain. J Comput Sci 49(11):360\u2013367","journal-title":"J Comput Sci"},{"issue":"2","key":"495_CR44","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1002\/int.22666","volume":"37","author":"Y Chen","year":"2022","unstructured":"Chen Y, Sun J, Yang Y, Li T, Niu X, Zhou H (2022) Psspr: a source location privacy protection scheme based on sector phantom routing in wsns. Int J Intell Syst 37(2):1204\u20131221","journal-title":"Int J Intell Syst"},{"key":"495_CR45","doi-asserted-by":"crossref","unstructured":"Zhang T, Ke X, Liu Y (2018) (t, n) multi-secret sharing scheme extended from harn-hsu\u2019s scheme. EURASIP J Wirel Commun Netw 2018:1\u20134","DOI":"10.1186\/s13638-018-1086-5"},{"key":"495_CR46","doi-asserted-by":"publisher","unstructured":"Li F, Hu H, Zhu S, Yan J (2022) A fully dynamic multi-secret sharing scheme with redundant authorization. Cryptogr Commun 1\u201318. https:\/\/doi.org\/10.1007\/s12095-022-00613-3","DOI":"10.1007\/s12095-022-00613-3"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-023-00495-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T20:11:43Z","timestamp":1700251903000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-023-00495-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,5]]},"references-count":46,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["495"],"URL":"https:\/\/doi.org\/10.1186\/s13677-023-00495-7","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,5]]},"assertion":[{"value":"18 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"117"}}