{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:42:40Z","timestamp":1780069360192,"version":"3.54.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T00:00:00Z","timestamp":1583107200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61602304"],"award-info":[{"award-number":["61602304"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s12652-020-01814-5","type":"journal-article","created":{"date-parts":[[2020,3,2]],"date-time":"2020-03-02T15:03:02Z","timestamp":1583161382000},"page":"5103-5113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Cheater-identifiable homomorphic secret sharing for outsourcing computations"],"prefix":"10.1007","volume":"11","author":[{"given":"Yan","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3543-1524","authenticated-orcid":false,"given":"Liang Feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,2]]},"reference":[{"key":"1814_CR1","doi-asserted-by":"publisher","unstructured":"Ananth P, Chandran N, Goyal V, Kanukurthi B, Ostrovsky R (2014) Achieving privacy in verifiable computation with multiple servers\u2014without the and without pre-processing. In: Proceedings of PKC 2014, Springer, Berlin, pp 149\u2013166. https:\/\/doi.org\/10.1007\/978-3-642-54631-0_9","DOI":"10.1007\/978-3-642-54631-0_9"},{"key":"1814_CR2","doi-asserted-by":"publisher","unstructured":"Backes M, Fiore D, Reischuk RM (2013) Verifiable delegation of computation on outsourced data. In: Proceedings of CCS 2013, ACM, New York, NY, pp 863\u2013874. https:\/\/doi.org\/10.1145\/2508859.2516681","DOI":"10.1145\/2508859.2516681"},{"issue":"4","key":"1814_CR3","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s00145-010-9056-z","volume":"23","author":"O Barkol","year":"2010","unstructured":"Barkol O, Ishai Y, Weinreb E (2010) On $$d$$-multiplicative secret sharing. J Cryptol 23(4):580\u2013593. https:\/\/doi.org\/10.1007\/s00145-010-9056-z","journal-title":"J Cryptol"},{"key":"1814_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Or M, Goldwasser S, Wigderson A (1988) Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of STOC 1988, ACM, New York, NY, pp 1\u201310. https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"1814_CR5","doi-asserted-by":"publisher","unstructured":"Benabbas S, Gennaro R, Vahlis Y (2011) Verifiable delegation of computation over large datasets. In: Proceedings of CRYPTO 2011, Springer, Berlin, pp 111\u2013131. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_7","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"1814_CR6","doi-asserted-by":"publisher","unstructured":"Benaloh JC (1986) Secret sharing homomorphisms: keeping shares of a secret secret (extended abstract). In: Proceedings of CRYPTO 1986, Springer, Berlin, pp 251\u2013260. https:\/\/doi.org\/10.1007\/3-540-47721-7_19","DOI":"10.1007\/3-540-47721-7_19"},{"key":"1814_CR7","doi-asserted-by":"publisher","unstructured":"Blakley GR (1979) Safeguarding cryptographic keys. In: Proceedings of the 1979 international workshop on managing requirements knowledge, IEEE, New York, pp 313\u2013317. https:\/\/doi.org\/10.1109\/MARK.1979.8817296","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1814_CR8","doi-asserted-by":"publisher","unstructured":"Boyle E, Gilboa N, Ishai Y (2015) Function secret sharing. In: Proceedings of EUROCRYPT 2015, Springer, Berlin, pp 337\u2013367. https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"1814_CR9","doi-asserted-by":"publisher","unstructured":"Boyle E, Gilboa N, Ishai Y (2016a) Breaking the circuit size barrier for secure computation under DDH. In: Proceedings of CRYPTO 2016, Springer, Berlin, pp 509\u2013539. https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"1814_CR10","doi-asserted-by":"publisher","unstructured":"Boyle E, Gilboa N, Ishai Y (2016b) Function secret sharing. In: Proceedings of CCS 2016, ACM, New York, NY, pp 1292\u20131303. https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"1814_CR11","doi-asserted-by":"publisher","unstructured":"Boyle E, Couteau G, Gilboa N, Ishai Y, Orr\u00f9 M (2017a) Homomorphic secret sharing. In: Proceedings of CCS 2017, ACM, New York, NY, pp 2105\u20132122. https:\/\/doi.org\/10.1145\/3133956.3134107","DOI":"10.1145\/3133956.3134107"},{"key":"1814_CR12","doi-asserted-by":"publisher","unstructured":"Boyle E, Gilboa N, Ishai Y (2017b) Group-based secure computation: Optimizing rounds, communication, and computation. In: Proceedings of EUROCRYPT 2017, Springer, Berlin, pp 163\u2013193. https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"1814_CR13","doi-asserted-by":"publisher","unstructured":"Boyle E, Kohl L, Scholl P (2019) Homomorphic secret sharing from lattices without FHE. In: Proceedings of EUROCRYPT 2019, Springer, Berlin, pp 3\u201333. https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"1814_CR14","doi-asserted-by":"publisher","unstructured":"Canetti R, Riva B, Rothblum GN (2012) Two protocols for delegation of computation. In: Proceedings of ICITS 2012, Springer, Berlin, pp 37\u201361. https:\/\/doi.org\/10.1007\/978-3-642-32284-6_3","DOI":"10.1007\/978-3-642-32284-6_3"},{"key":"1814_CR15","doi-asserted-by":"publisher","unstructured":"Chaum D, Cr\u00e9peau C, Damgard I (1988) Multiparty unconditionally secure protocols. In: Proceedings of STOC 1988, ACM, New York, NY, pp 11\u201319. https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"issue":"2","key":"1814_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00701ED1V01Y201602SPT016","volume":"8","author":"X Chen","year":"2016","unstructured":"Chen X (2016) Introduction to secure outsourcing computation. Synt Lect Inf Secur Privacy Trust 8(2):1\u201393. https:\/\/doi.org\/10.2200\/S00701ED1V01Y201602SPT016","journal-title":"Synt Lect Inf Secur Privacy Trust"},{"key":"1814_CR17","doi-asserted-by":"publisher","unstructured":"Chor B, Goldreich O, Kushilevitz E, Sudan M (1995) Private information retrieval. In: Proceedings of FOCS 1995, IEEE, Milwaukee, WI, pp 41\u201350. https:\/\/doi.org\/10.1109\/SFCS.1995.492461","DOI":"10.1109\/SFCS.1995.492461"},{"key":"1814_CR18","doi-asserted-by":"publisher","unstructured":"Chung KM, Kalai Y, Vadhan S (2010) Improved delegation of computation using fully homomorphic encryption. In: Proceedings of CRYPTO 2010, Springer, Berlin, pp 483\u2013501. https:\/\/doi.org\/10.1007\/978-3-642-14623-7_26","DOI":"10.1007\/978-3-642-14623-7_26"},{"key":"1814_CR19","doi-asserted-by":"publisher","unstructured":"Desmedt Y, Frankel Y (1989) Threshold cryptosystems. In: Proceedings of CRYPTO 1989, Springer , New York, Berlin, pp 307\u2013315. https:\/\/doi.org\/10.1007\/0-387-34805-0_28","DOI":"10.1007\/0-387-34805-0_28"},{"key":"1814_CR20","doi-asserted-by":"publisher","unstructured":"Dinur I, Keller N, Klein O (2018) An optimal distributed discrete log protocol with applications to homomorphic secret sharing. In: Proceedings of CRYPTO 2018, Springer, Berlin, pp 213\u2013242. https:\/\/doi.org\/10.1007\/978-3-319-96878-0_8","DOI":"10.1007\/978-3-319-96878-0_8"},{"key":"1814_CR21","doi-asserted-by":"publisher","unstructured":"Fazio N, Gennaro R, Jafarikhah T, Skeith WE (2017) Homomorphic secret sharing from paillier encryption. In: Proceedings of ProvSec 2017, Springer, Berlin, pp 381\u2013399. https:\/\/doi.org\/10.1007\/978-3-319-68637-0_23","DOI":"10.1007\/978-3-319-68637-0_23"},{"key":"1814_CR22","doi-asserted-by":"publisher","unstructured":"Fiore D, Gennaro R, Pastro V (2014) Efficiently verifiable computation on encrypted data. In: Proceedings of CCS 2014, ACM, New York, NY, pp 844\u2013855. https:\/\/doi.org\/10.1145\/2660267.2660366","DOI":"10.1145\/2660267.2660366"},{"key":"1814_CR23","doi-asserted-by":"publisher","unstructured":"Gennaro R, Gentry C, Parno B (2010) Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Proceedings of CRYPTO 2010, Springer, Berlin, pp 465\u2013482. https:\/\/doi.org\/10.1007\/978-3-642-14623-7_25","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"1814_CR24","doi-asserted-by":"publisher","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC 2009, ACM, New York, NY, pp 169\u2013178. https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"1814_CR25","unstructured":"Ito M, Saito A, Nishizeki T (1987) Secret sharing schemes realizing general access structure. IEEE\/IEICE global telecommunications conference 1987. Ohmsha Ltd, Tokyo, pp 99\u2013102"},{"key":"1814_CR26","doi-asserted-by":"publisher","unstructured":"Lai RWF, Malavolta G, Schr\u00f6der D (2018) Homomorphic secret sharing for low degree polynomials. In: Proceedings of ASIACRYPT 2018, Springer, Berlin, pp 279\u2013309. https:\/\/doi.org\/10.1007\/978-3-030-03332-3_11","DOI":"10.1007\/978-3-030-03332-3_11"},{"key":"1814_CR27","doi-asserted-by":"publisher","unstructured":"Mattern F, Floerkemeier C (2010) From the internet of computers to the internet of things. In: From active data management to event-based systems and more. Springer, Berlin, pp 242\u2013259. https:\/\/doi.org\/10.1007\/978-3-642-17226-7_15","DOI":"10.1007\/978-3-642-17226-7_15"},{"key":"1814_CR28","doi-asserted-by":"publisher","unstructured":"Naor M, Pinkas B (2000) Distributed oblivious transfer. In: Proceedings of ASIACRYPT 2000. Springer, Berlin, pp 205\u2013219. https:\/\/doi.org\/10.1007\/3-540-44448-3_16","DOI":"10.1007\/3-540-44448-3_16"},{"key":"1814_CR29","doi-asserted-by":"publisher","unstructured":"Parno B, Raykova M, Vaikuntanathan V (2012) How to delegate and verify in public: Verifiable computation from attribute-based encryption. In: Proceedings of TCC 2012. Springer, Berlin, pp 422\u2013439. https:\/\/doi.org\/10.1007\/978-3-642-28914-9_24","DOI":"10.1007\/978-3-642-28914-9_24"},{"issue":"7","key":"1814_CR30","doi-asserted-by":"publisher","first-page":"2693","DOI":"10.1007\/s12652-018-0967-0","volume":"10","author":"PK Premkamal","year":"2018","unstructured":"Premkamal PK, Pasupuleti SK, Alphonse PJA (2018) A new verifiable outsourced ciphertext-policy attribute based encryption for big data privacy and access control in cloud. J Ambient Intell Humaniz Comput 10(7):2693\u20132707. https:\/\/doi.org\/10.1007\/s12652-018-0967-0","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1814_CR31","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adleman L, Dertouzos ML (1978) On data banks and privacy homomorphisms. Found Sec Comput 4:169\u2013179","journal-title":"Found Sec Comput"},{"key":"1814_CR32","doi-asserted-by":"publisher","unstructured":"Sahai A, Waters B (2005) Fuzzy identity-based encryption. In: Proceedings of EUROCRYPT 2005, Springer, Berlin, pp 457\u2013473. https:\/\/doi.org\/10.1007\/11426639_27","DOI":"10.1007\/11426639_27"},{"issue":"11","key":"1814_CR33","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. https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun ACM"},{"key":"1814_CR34","doi-asserted-by":"publisher","unstructured":"Tsaloli G, Liang B, Mitrokotsa A (2018) Verifiable homomorphic secret sharing. In: 12th international conference on provable security. Springer, Berlin, pp 40\u201355. https:\/\/doi.org\/10.1007\/978-3-030-01446-9_3","DOI":"10.1007\/978-3-030-01446-9_3"},{"issue":"1","key":"1814_CR35","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s12652-014-0254-7","volume":"6","author":"C Xiang","year":"2015","unstructured":"Xiang C, Tang C (2015) Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. J Ambient Intell Humaniz Comput 6(1):131\u2013139. https:\/\/doi.org\/10.1007\/s12652-014-0254-7","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"1814_CR36","doi-asserted-by":"publisher","unstructured":"Yoshida M, Obana S (2017) Verifiably multiplicative secret sharing. In: Proceedings of ICITS 2017. Springer, Berlin, pp 73\u201382. https:\/\/doi.org\/10.1007\/978-3-319-72089-0_5","DOI":"10.1007\/978-3-319-72089-0_5"},{"issue":"6","key":"1814_CR37","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s12652-015-0280-0","volume":"6","author":"J Yu","year":"2015","unstructured":"Yu J, Wang X, Gao W (2015) Improvement and applications of secure outsourcing of scientific computations. J Ambient Intell Humaniz Comput 6(6):763\u2013772. https:\/\/doi.org\/10.1007\/s12652-015-0280-0","journal-title":"J Ambient Intell Humaniz Comput"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-01814-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-020-01814-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-020-01814-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:26:06Z","timestamp":1614644766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-020-01814-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,2]]},"references-count":37,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1814"],"URL":"https:\/\/doi.org\/10.1007\/s12652-020-01814-5","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,2]]},"assertion":[{"value":"7 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}