{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T21:55:25Z","timestamp":1717019725700},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T00:00:00Z","timestamp":1670457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T00:00:00Z","timestamp":1670457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["62172181, 62072133"],"award-info":[{"award-number":["62172181, 62072133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Today, cloud storage services increased the popular for data storage in the cloud and retrieve from any location without any time limitations. One of the most important demands required in cloud is secured data transmission in un-trusted cloud applications. Particularly, secure and efficient multiparty communications in Untrusted Cloud Environments (UCE) attract widespread attentions. The equipment used in UCE have the particularity of being heterogeneous and UCE communication environment are asynchronous networks in which multiple users cannot transmit their messages simultaneously. How to ensure secure communication between these heterogeneous intelligent devices is a major challenge for multiparty communication applied in UCE. In such an asynchronous environment, the asynchronous transmission can cause security problems in cryptographic functions. Therefore, how to implement rational secret sharing (RSS) in an asynchronous model of the UCE networks has become a burning research topic. The RSS refers to finding a solution composed of strategies to encourage players in the secret reconstruction to act honestly even players are rational to act for their own interest. If each player plays the game for the best response to the best response of other players, the game is in Nash equilibrium. The objective of an RSS is to achieve the Nash equilibrium state corresponding to the global optima. In this paper, we propose an information-theoretic secure RSS in asynchronous model for UCE. Our design uses Petersen\u2019s VSS to allow every player to divide his share into multiple pieces for other players. Then, shares can be revealed asynchronously. If any player acts maliciously, his share can be recovered by other players. This feature can encourage players to act honestly since any malicious action (i.e., either revealing a fake share or refusing to release one) is useless. Our scheme is practically valuable for secure group-oriented applications in UCE.<\/jats:p>","DOI":"10.1186\/s13677-022-00364-9","type":"journal-article","created":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T14:24:01Z","timestamp":1670509441000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Information-theoretic secure rational secret sharing in asynchronous networks for untrusted cloud environments"],"prefix":"10.1186","volume":"11","author":[{"given":"Chingfang","family":"Hsu","sequence":"first","affiliation":[]},{"given":"Lein","family":"Harn","sequence":"additional","affiliation":[]},{"given":"Zhe","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Linyan","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Ze","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,8]]},"reference":[{"key":"364_CR1","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/s11280-019-00746-1","volume":"23","author":"R Hu","year":"2020","unstructured":"Hu R, Yan Z, Ding W et al (2020) A survey on data provenance in IoT. World Wide Web 23:1441\u20131463. https:\/\/doi.org\/10.1007\/s11280-019-00746-1","journal-title":"World Wide Web"},{"key":"364_CR2","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s11280-019-00677-x","volume":"23","author":"Z Huang","year":"2020","unstructured":"Huang Z, Wang Q (2020) A PUF-based unified identity verification framework for secure IoT hardware via device authentication. World Wide Web 23:1057\u20131088. https:\/\/doi.org\/10.1007\/s11280-019-00677-x","journal-title":"World Wide Web"},{"key":"364_CR3","doi-asserted-by":"publisher","unstructured":"He J, Rong J, Sun L et al (2020) A framework for cardiac arrhythmia detection from IoT-based ECGs. World Wide Web. https:\/\/doi.org\/10.1007\/s11280-019-00776-9","DOI":"10.1007\/s11280-019-00776-9"},{"key":"364_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s11280-017-0475-8","volume":"21","author":"H Hong","year":"2018","unstructured":"Hong H, Sun Z (2018) Sharing your privileges securely: a key-insulated attribute based proxy re-encryption scheme for IoT. World Wide Web 21:595\u2013607. https:\/\/doi.org\/10.1007\/s11280-017-0475-8","journal-title":"World Wide Web"},{"issue":"8","key":"364_CR5","doi-asserted-by":"publisher","first-page":"14287","DOI":"10.1109\/JIOT.2021.3068364","volume":"18","author":"C Peng","year":"2021","unstructured":"Peng C, Luo M, Li L, Choo K-KR, He D (2021) Efficient certificateless online\/offline signature scheme for wireless body area networks. IEEE Internet Things J 18(8):14287\u201314298","journal-title":"IEEE Internet Things J"},{"key":"364_CR6","doi-asserted-by":"publisher","unstructured":"Shen J, Yang H, Vijayakumar P, Kummar N (2021) A privacy-preserving and untraceable group data sharing scheme. IEEE Trans Depend Secure Comput. https:\/\/doi.org\/10.1109\/TDSC.2021.3050517","DOI":"10.1109\/TDSC.2021.3050517"},{"issue":"2","key":"364_CR7","first-page":"1338","volume":"19","author":"S Qiu","year":"2022","unstructured":"Qiu S, Wang D, Xu G, Kumari S (2022) Practical and provably secure three-factor authentication protocol based on extended chaotic-maps for Mobile lightweight devices. IEEE Trans Dependable Secure Comput 19(2):1338\u20131351","journal-title":"IEEE Trans Dependable Secure Comput"},{"issue":"4","key":"364_CR8","first-page":"1836","volume":"18","author":"J Han","year":"2021","unstructured":"Han J, Chen L, Schneider S, Treharne H, Wesemeyer S (2021) Privacy-preserving electronic ticket scheme with attribute-based credentials. IEEE Trans Dependable Secure Comput 18(4):1836\u20131849","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"364_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.comcom.2021.03.022","volume":"173","author":"Q Jiang","year":"2021","unstructured":"Jiang Q, Zhang X, Zhang N, Tian Y, Ma X, Ma J (2021) Three-factor authentication protocol using physical Unclonable function for IoV. Comput Commun 173:45\u201355. https:\/\/doi.org\/10.1016\/j.comcom.2021.03.022","journal-title":"Comput Commun"},{"issue":"11","key":"364_CR10","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"},{"issue":"2","key":"364_CR11","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"IT-29","author":"C Asmuth","year":"1983","unstructured":"Asmuth C, Bloom J (1983) A modular approach to key safeguarding. IEEE Trans Inf Theory IT-29(2):208\u2013210","journal-title":"IEEE Trans Inf Theory"},{"key":"364_CR12","doi-asserted-by":"crossref","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. In: Managing Requirements Knowledge, International Workshop on. IEEE Computer Society, pp 313\u2013313","DOI":"10.1109\/MARK.1979.8817296"},{"key":"364_CR13","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/1007352.1007447","volume-title":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC \u201804","author":"J Halpern","year":"2004","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 - STOC \u201804, pp 623\u2013632"},{"key":"364_CR14","doi-asserted-by":"crossref","unstructured":"Fuchsbauer G, Katz J, Naccache D (2010) Efficient rational secret sharing in standard communication networks. In: Theory of Cryptography Conference. Springer, Berlin, Heidelberg, pp 419\u2013436","DOI":"10.1007\/978-3-642-11799-2_25"},{"key":"364_CR15","doi-asserted-by":"crossref","unstructured":"Ong SJ, Parkes DC, Rosen A et al (2009) Fairness with an honest minority and a rational majority. In:\u00a0Theory of Cryptography Conference. Springer, Berlin, Heidelberg, pp 36\u201353","DOI":"10.1007\/978-3-642-00457-5_3"},{"issue":"6","key":"364_CR16","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1142\/S0129054111008775","volume":"22","author":"C Tartary","year":"2011","unstructured":"Tartary C, Wang H, Zhang Y (2011) An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials. Int J Found Comput Sci 22(6):1395\u20131416","journal-title":"Int J Found Comput Sci"},{"key":"364_CR17","first-page":"1","volume":"23","author":"L Harn","year":"2015","unstructured":"Harn L, Iin CL, Li Y (2015) Fair secret reconstruction in (t, n) secret sharing. J Inform Secur Appl 23:1\u20137","journal-title":"J Inform Secur Appl"},{"issue":"6","key":"364_CR18","first-page":"1","volume":"3","author":"WK Moses Jr","year":"2011","unstructured":"Moses WK Jr, Rangan CP (2011) Rational secret sharing over an asynchronous broadcast channel with information theoretic security. Int J Netw Secur Appl 3(6):1\u201318","journal-title":"Int J Netw Secur Appl"},{"issue":"1","key":"364_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0020-0190(95)00045-E","volume":"55","author":"HY Lin","year":"1995","unstructured":"Lin HY, Harn L (1995) Fair reconstruction of a secret. Inf Process Lett 55(1):45\u201347","journal-title":"Inf Process Lett"},{"key":"364_CR20","doi-asserted-by":"crossref","unstructured":"Maleka S, Shareef A, Rangan C P (2008) Rational secret sharing with repeated games. In: International Conference on Information Security Practice and Experience. Springer, Berlin, Heidelberg, pp 334\u2013346","DOI":"10.1007\/978-3-540-79104-1_24"},{"key":"364_CR21","doi-asserted-by":"crossref","unstructured":"Pedersen TP (1991) Non-interactive and information-theoretic secure verifiable secret sharing. In: Annual international cryptology conference. Springer, Berlin, Heidelberg, pp 129\u2013140","DOI":"10.1007\/3-540-46766-1_9"},{"key":"364_CR22","doi-asserted-by":"crossref","unstructured":"Chor B, Goldwasser S, Micali S, Awerbuch B (1985) Verifiable secret sharing and achieving si multaneity in the presence of faults. In: Proc. 26th FOCS. IEEE, Piscataway, pp\u00a0383\u2013395","DOI":"10.1109\/SFCS.1985.64"},{"key":"364_CR23","doi-asserted-by":"crossref","unstructured":"Benaloh JC (1986) Secret sharing homomorphisms: Keeping shares of a secret secret. In: Conference on the theory and application of cryptographic techniques. Springer, Berlin, Heidelberg, pp 251\u2013260","DOI":"10.1007\/3-540-47721-7_19"},{"key":"364_CR24","doi-asserted-by":"crossref","unstructured":"Feldman P (1987) A practical scheme for verifiable secret sharing. In: Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp 427\u2013438","DOI":"10.1109\/SFCS.1987.4"},{"key":"364_CR25","doi-asserted-by":"crossref","unstructured":"Stadler M (1996) Publicly verifiable secret sharing. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, Berlin, Heidelberg, pp 190\u2013199","DOI":"10.1007\/3-540-68339-9_17"},{"key":"364_CR26","doi-asserted-by":"crossref","unstructured":"Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Annual International Cryptology Conference. Springer, Berlin, Heidelberg, pp 148\u2013164","DOI":"10.1007\/3-540-48405-1_10"},{"key":"364_CR27","first-page":"260","volume-title":"Proceeding of 2nd Conference on Environmental Science and Information Application Technology","author":"A Peng","year":"2010","unstructured":"Peng A, Wang L (2010) One publicly verifiable secret sharing scheme based on linear code. In: Proceeding of 2nd Conference on Environmental Science and Information Application Technology, pp 260\u2013262"},{"key":"364_CR28","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques. Springer, Berlin, Heidelberg, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"364_CR29","first-page":"98","volume-title":"Proceedings of WEWoRC \u201805, LNI P-74","author":"A Ruiz","year":"2005","unstructured":"Ruiz A, Villar JL (2005) Publicly verifiable secret sharing from Paillier\u2019s cryptosystem. In: Proceedings of WEWoRC \u201805, LNI P-74, pp 98\u2013108"},{"issue":"3","key":"364_CR30","first-page":"142","volume":"14","author":"Y Tian","year":"2012","unstructured":"Tian Y, Peng C, Ma J (2012) Publicly verifiable secret sharing schemes using bilinear pairings. Int J Netw Secur 14(3):142\u2013148","journal-title":"Int J Netw Secur"},{"issue":"1","key":"364_CR31","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/s11424-011-8408-6","volume":"24","author":"T Wu","year":"2011","unstructured":"Wu T, Tsenga Y (2011) A pairing-based publicly verifiable secret sharing scheme. J Syst Sci Complex 24(1):186\u2013194","journal-title":"J Syst Sci Complex"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00364-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-022-00364-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00364-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,8]],"date-time":"2022-12-08T14:34:36Z","timestamp":1670510076000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-022-00364-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,8]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["364"],"URL":"https:\/\/doi.org\/10.1186\/s13677-022-00364-9","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,8]]},"assertion":[{"value":"16 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2022","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":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declared that they have no conflicts of interest to this work.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"89"}}