{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T14:09:18Z","timestamp":1784556558269,"version":"3.55.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031375859","type":"print"},{"value":"9783031375866","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37586-6_4","type":"book-chapter","created":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T23:02:16Z","timestamp":1689116536000},"page":"51-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["New Results on\u00a0Distributed Secret Sharing Protocols"],"prefix":"10.1007","author":[{"given":"Alfredo","family":"De Santis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Barbara","family":"Masucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security - CCS 2006, pp. 89\u201398","DOI":"10.1145\/1180405.1180418"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. In: Proceedings of Public Key Cryptography - PKC 2011, pp. 53\u201370","DOI":"10.1007\/978-3-642-19379-8_4"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Proceedings of Advances in Cryptology - CRYPTO \u201991, pp. 457\u2013469","DOI":"10.1007\/3-540-46766-1_37"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or, S.G., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing - STOC \u201988, pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing - STOC \u201988, pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ronald Cramer, D., Ivan, Maurer, U.: General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In: Proceedings of Advances in Cryptology - EUROCRYPT 2000, pp. 316\u2013334","DOI":"10.1007\/3-540-45539-6_22"},{"issue":"9","key":"4_CR7","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1109\/71.722223","volume":"9","author":"M Naor","year":"1998","unstructured":"Naor, M., Wool, A.: Access control and signatures via quorum secret sharing. IEEE Trans. Parallel Distrib. Syst. 9(9), 909\u2013922 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/TIT.2020.3028194","volume":"67","author":"M Soleymani","year":"2021","unstructured":"Soleymani, M., Mahdavifar, H.: Distributed multi-user secret sharing. IEEE Trans. Inf. Theory 67(1), 164\u2013178 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"De Prisco, R., De Santis, A., Palmieri, F.: Improved protocols for distributed secret sharing. IEEE Trans. Dependable Secur. Comput. (2022). https:\/\/doi.org\/10.1109\/TDSC.2022.3213790","DOI":"10.1109\/TDSC.2022.3213790"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"De Prisco, R., De Santis, A., Palmieri, F.: Bounds and protocols for graph-based distributed secret sharing. IEEE Trans. Dependable Secur. Comput. (2023). https:\/\/doi.org\/10.1109\/TDSC.2023.3261239","DOI":"10.1109\/TDSC.2023.3261239"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding Cryptographic Keys. In: Proceedings of AFIPS 1979 National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"22","key":"4_CR12","doi-asserted-by":"publisher","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(22), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptol. 6, 15\u201320 (1993)","journal-title":"J. Cryptol."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: Introduction to shared secret and\/or shared control schemes and their applications,\" Contemporary Cryptology, IEEE Press, pp. 441\u2013497 (1991)","DOI":"10.1007\/3-540-38424-3_16"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"DR Stinson","year":"1992","unstructured":"Stinson, D.R.: An Explication of Secret Sharing Schemes. Des. Codes Cryptography 2, 357\u2013390 (1992)","journal-title":"Des. Codes Cryptography"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"ED Karnin","year":"1983","unstructured":"Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inf. Theory 29(1), 35\u201341 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF00129770","volume":"9","author":"W-A Jackson","year":"1996","unstructured":"Jackson, W.-A., Martin, K.M., O\u2019Keefe, C.M.: A construction for multisecret threshold schemes. Des. Codes Cryptography 9(3), 287\u2013303 (1996)","journal-title":"Des. Codes Cryptography"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1007\/3-540-56503-5_68","volume-title":"STACS 93","author":"C Blundo","year":"1993","unstructured":"Blundo, C., De Santis, A., Vaccaro, U.: Efficient sharing of many secrets. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS 1993. LNCS, vol. 665, pp. 692\u2013703. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56503-5_68"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/BFb0000423","volume-title":"Advances in Cryptology \u2014 ASIACRYPT\u201994","author":"W-A Jackson","year":"1995","unstructured":"Jackson, W.-A., Martin, K.M., O\u2019Keefe, C.M.: On sharing many secrets. In: Pieprzyk, J., Safavi-Naini, R. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 42\u201354. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0000423"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1109\/18.771255","volume":"45","author":"A De Santis","year":"1999","unstructured":"De Santis, A., Masucci, B.: Multiple ramp schemes. IEEE Trans. Inf. Theory 45(5), 1720\u20131728 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Blundo, C., De Santis, A., Di Crescenzo, G., Giorgio Gaggia, A., Vaccaro, U.: Multi-secret sharing schemes. In: Proceedings of Advances in Cryptology - CRYPTO \u201994, vol. 839, pp. 150\u2013163","DOI":"10.1007\/3-540-48658-5_17"},{"issue":"7","key":"4_CR23","first-page":"367","volume":"5","author":"C Blundo","year":"1999","unstructured":"Blundo, C., Masucci, B.: Randomness in multi-secret sharing schemes. J. Univ. Comput. Sci. 5(7), 367\u2013389 (1999)","journal-title":"J. Univ. Comput. Sci."},{"issue":"1\u20133","key":"4_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(02)00399-7","volume":"295","author":"G Di Crescenzo","year":"2003","unstructured":"Di Crescenzo, G.: Sharing one secret vs sharing many secrets. Theoret. Comput. Sci. 295(1\u20133), 123\u2013140 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10623-005-2761-1","volume":"39","author":"B Masucci","year":"2006","unstructured":"Masucci, B.: Sharing multiple secrets: models, schemes, and analysis. Des. Codes Crypt. 39(1), 89\u2013111 (2006)","journal-title":"Des. Codes Crypt."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Javier Herranz, A.R., S\u00e1ez, G.: New results and applications for multi-secret sharing schemes. Designs, Codes, and Cryptography, vol. 73, no. 3, pp. 841\u2013864 (2014)","DOI":"10.1007\/s10623-013-9831-6"},{"key":"4_CR27","volume-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","author":"TM Cover","year":"2006","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, USA (2006)"}],"container-title":["Lecture Notes in Computer Science","Data and Applications Security and Privacy XXXVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37586-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T23:59:55Z","timestamp":1729727995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37586-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031375859","9783031375866"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37586-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DBSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP Annual Conference on Data and Applications Security and Privacy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sophia-Antipolis","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dbsec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dbsec2023.unimol.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}