{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:12:00Z","timestamp":1725973920170},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893389"},{"type":"electronic","value":"9783319893396"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89339-6_9","type":"book-chapter","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T01:32:30Z","timestamp":1522891950000},"page":"141-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Performing Computations on Hierarchically Shared Secrets"],"prefix":"10.1007","author":[{"given":"Giulia","family":"Traverso","sequence":"first","affiliation":[]},{"given":"Denise","family":"Demirel","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC 1988 (1988)","DOI":"10.1145\/62212.62213"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.R., et al.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-48329-2_10","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"C Blundo","year":"1994","unstructured":"Blundo, C., Cresti, A., De Santis, A., Vaccaro, U.: Fully dynamic secret sharing schemes. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 110\u2013125. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_10"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"EF Brickell","year":"1990","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468\u2013475. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_45"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC 1988 (1988)","DOI":"10.1145\/62212.62214"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"9_CR12","unstructured":"Desmedt, Y., Jajodia, S.: Redistributing secret shares to new access structures and its applications. Technical report ISSE TR-97-01, George Mason University (1997)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Doganay, M.C., Pedersen, T.B., Saygin, Y., Savas, E., Levi, A.: Distributed privacy preserving k-means clustering with additive secret sharing. In: PAIS (2008)","DOI":"10.1145\/1379287.1379291"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Farr\u00e0s, O., Padr\u00f3, C.: Ideal hierarchical secret sharing schemes. In: TCC (2010)","DOI":"10.1007\/978-3-642-11799-2_14"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fact-track multiparty computations with applications to threshold cryptography. In: PODC 1998 (1998)","DOI":"10.1145\/277697.277716"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BFb0053748","volume-title":"Information Security and Privacy","author":"H Ghodosi","year":"1998","unstructured":"Ghodosi, H., Pieprzyk, J., Safavi-Naini, R.: Secret sharing in multilevel and compartmented groups. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 367\u2013378. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053748"},{"key":"9_CR18","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1990 (1990)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, V., Gopinath, K.: $${\\rm G}_{\\rm its}^{2}$$Gits2 VSR: an information theoretical secure verifiable secret redistribution protocol for long-term archival storage. In: SISW 2007 (2007)","DOI":"10.1109\/SISW.2007.4389742"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-01465-9_16","volume-title":"Formal Aspects in Security and Trust","author":"J Heather","year":"2009","unstructured":"Heather, J., Lundin, D.: The append-only web bulletin board. In: Degano, P., Guttman, J., Martinelli, F. (eds.) FAST 2008. LNCS, vol. 5491, pp. 242\u2013256. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01465-9_16"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"A Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339\u2013352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_27"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-10230-1_13","volume-title":"Information Theoretic Security","author":"E K\u00e4sper","year":"2009","unstructured":"K\u00e4sper, E., Nikov, V., Nikova, S.: Strongly multiplicative hierarchical threshold secret sharing. In: Desmedt, Y. (ed.) ICITS 2007. LNCS, vol. 4883, pp. 148\u2013168. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10230-1_13"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Loruenser, T., Happe, A., Slamanig, D.: ARCHISTAR: towards secure and robust cloud based data sharing. In: CloudCom 2015 (2015)","DOI":"10.1109\/CloudCom.2015.71"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Nojoumian, M., Stinson, D.R.: Social secret sharing in cloud computing using a new trust function. In: PST 2012 (2012)","DOI":"10.1109\/PST.2012.6297936"},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1049\/iet-ifs.2009.0098","volume":"4","author":"M Nojoumian","year":"2010","unstructured":"Nojoumian, M., Stinson, D.R., Grainger, M.: Unconditionally secure social secret sharing scheme. Inf. Secur. IET 4, 202\u2013211 (2010)","journal-title":"Inf. Secur. IET"},{"key":"9_CR26","unstructured":"Pakniat, N., Eslami, Z., Nojoumian, M.: Ideal social secret sharing using Birkhoff interpolation method. IACR 2014 (2014)"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Schabh\u00fcser, L., Demirel, D., Buchmann, J.A.: An unconditionally hiding auditing procedure for computations over distributed data. In: CNS 2016 (2016)","DOI":"10.1109\/CNS.2016.7860547"},{"key":"9_CR29","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/0-387-34799-2_30","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"GJ Simmons","year":"1990","unstructured":"Simmons, G.J.: How to (really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390\u2013448. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_30"},{"key":"9_CR31","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00145-006-0334-8","volume":"20","author":"T Tassa","year":"2007","unstructured":"Tassa, T.: Hierarchical threshold secret sharing. J. Cryptology 20, 237\u2013264 (2007)","journal-title":"J. Cryptology"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-49175-2_2","volume-title":"Information Theoretic Security","author":"G Traverso","year":"2016","unstructured":"Traverso, G., Demirel, D., Buchmann, J.: Dynamic and verifiable hierarchical secret sharing. In: Nascimento, A.C.A., Barreto, P. (eds.) ICITS 2016. LNCS, vol. 10015, pp. 24\u201343. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_2"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Traverso, G., Demirel, D., Habib, S.M., Buchmann, J.A.: As$${}^{\\text{3}}$$3: adaptive social secret sharing for distributed storage systems. In: PST 2016 (2016)","DOI":"10.1109\/PST.2016.7907011"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89339-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,14]],"date-time":"2019-10-14T04:07:30Z","timestamp":1571026050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89339-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893389","9783319893396"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89339-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}