{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T19:42:21Z","timestamp":1780515741991,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030315771","type":"print"},{"value":"9783030315788","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-31578-8_16","type":"book-chapter","created":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T23:04:24Z","timestamp":1570748664000},"page":"291-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Evolving Perfect Hash Families: A\u00a0Combinatorial Viewpoint of Evolving Secret Sharing"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sabyasachi","family":"Dutta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"issue":"5","key":"16_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1002\/(SICI)1520-6610(1996)4:5<353::AID-JCD4>3.0.CO;2-E","volume":"4","author":"M Atici","year":"1996","unstructured":"Atici, M., Magliveras, S.S., Stinson, D.R., Wei, W.-D.: Some recursive constructions for perfect hash families. J. Comb. Des. 4(5), 353\u2013363 (1996)","journal-title":"J. Comb. Des."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in $$NC^1$$. In: STOC 1986, pp. 1\u20135 (1986)","DOI":"10.1145\/12130.12131"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-47721-7_19","volume-title":"Advances in Cryptology\u2014CRYPTO 1986","author":"JC Benaloh","year":"1987","unstructured":"Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (extended abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251\u2013260. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_19"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1996","author":"SR Blackburn","year":"1996","unstructured":"Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 107\u2013118. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_10"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/10718964_37","volume-title":"Information Security and Privacy","author":"E Brickell","year":"2000","unstructured":"Brickell, E., Di Crescenzo, G., Frankel, Y.: Sharing block ciphers. In: Dawson, E.P., Clark, A., Boyd, C. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 457\u2013470. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10718964_37"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-40084-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"G Cohen","year":"2013","unstructured":"Cohen, G., et al.: Efficient multiparty protocols via log-depth threshold formulae. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 185\u2013202. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_11"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45708-9_18","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Fehr, S.: Optimal black-box secret sharing over arbitrary Abelian groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 272\u2013287. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_18"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11535218_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Fehr, S., Stam, M.: Black-box secret sharing from primitive sets in algebraic number fields. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 344\u2013360. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_21"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: STOC 1994, pp. 522\u2013533 (1994)","DOI":"10.1145\/195058.195405"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-22270-7_7","volume-title":"E-Voting and Identity","author":"Y Desmedt","year":"2015","unstructured":"Desmedt, Y., Erotokritou, S.: Making code voting secure against insider threats using unconditionally secure MIX schemes and human PSMT protocols. In: Haenni, R., Koenig, R.E., Wikstr\u00f6m, D. (eds.) VOTELID 2015. LNCS, vol. 9269, pp. 110\u2013126. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22270-7_7"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/3-540-46766-1_37","volume-title":"Advances in Cryptology\u2014CRYPTO 1991","author":"Y Desmedt","year":"1992","unstructured":"Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457\u2013469. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_37"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0000421","volume-title":"Advances in Cryptology\u2014ASIACRYPT 1994","author":"Y Desmedt","year":"1995","unstructured":"Desmedt, Y., Di Crescenzo, G., Burmester, M.: Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Pieprzyk, J., Safavi-Naini, R. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 19\u201332. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0000421"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00145-011-9104-3","volume":"25","author":"Y Desmedt","year":"2012","unstructured":"Desmedt, Y., et al.: Graph coloring applied to secure computation in non-abelian groups. J. Cryptol. 25(4), 557\u2013600 (2012)","journal-title":"J. Cryptol."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-74143-5_33","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"Y Desmedt","year":"2007","unstructured":"Desmedt, Y., Pieprzyk, J., Steinfeld, R., Wang, H.: On secure multi-party computation in black-box groups. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 591\u2013612. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_33"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1137\/S0895480192224713","volume":"7","author":"YG Desmedt","year":"1994","unstructured":"Desmedt, Y.G., Frankel, Y.: Homomorphic zero-knowledge threshold schemes over any finite Abelian group. SIAM J. Discrete Math. 7(4), 667\u2013679 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-48071-4_39","volume-title":"Advances in Cryptology\u2014CRYPTO 1992","author":"Y Frankel","year":"1993","unstructured":"Frankel, Y., Desmedt, Y., Burmester, M.: Non-existence of homomorphic general sharing schemes for some key spaces. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 549\u2013557. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_39"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0605009","volume":"5","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J.: On the size of separating systems and families of perfect hash functions. SIAM J. Algebraic Discrete Methods 5(1), 61\u201368 (1984)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. Part III 72, 56\u201364 (1989)","journal-title":"Electron. Commun. Jpn. Part III"},{"issue":"1","key":"16_CR22","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(1), 15\u201320 (1993)","journal-title":"J. Cryptol."},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology\u2014CRYPTO 1993","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136\u2013146. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_12"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-53644-5_19","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2016","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 485\u2013514. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_19"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-70503-3_12","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Paskin-Cherniavsky, A.: Evolving secret sharing: dynamic thresholds and robustness. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 379\u2013393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_12"},{"key":"16_CR26","volume-title":"Introduction to Combinatorial Mathematics","author":"CL Liu","year":"1968","unstructured":"Liu, C.L.: Introduction to Combinatorial Mathematics. McGraw-Hill, New York (1968)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K.: On the program size of perfect and universal hash functions. In: FOCS 1982, pp. 170\u2013175 (1982)","DOI":"10.1109\/SFCS.1982.80"},{"key":"16_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms","author":"K Mehlhorn","year":"1984","unstructured":"Mehlhorn, K.: Data Structures and Algorithms, vol. 1. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/978-3-642-69672-5"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Safavi-Naini, R., Wang, H.: Robust additive secret sharing schemes over $$Z_m$$. In: Cryptography and Computational Number Theory. Progress in Computer Science and Applied Logic, vol. 20, pp. 357\u2013368. Birkhauser (2001)","DOI":"10.1007\/978-3-0348-8295-8_26"},{"key":"16_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/10719994_15","volume-title":"Information Security and Cryptology - ICISC 1999","author":"R Safavi-Naini","year":"2000","unstructured":"Safavi-Naini, R., Wang, H., Lam, K.-Y.: A new approach to robust threshold RSA signature schemes. In: Song, J.S. (ed.) ICISC 1999. LNCS, vol. 1787, pp. 184\u2013196. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10719994_15"},{"issue":"11","key":"16_CR31","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(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"16_CR32","unstructured":"Sloane, N.J.A.: Proposal for an Internet Service: The Eternal Home Page. http:\/\/neilsloane.com\/doc\/eternal.html"},{"key":"16_CR33","unstructured":"Stinson, D.: Private communication with Yvo Desmedt, 13 June 1996"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31578-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:19:06Z","timestamp":1710242346000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-31578-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030315771","9783030315788"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31578-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fuzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cans2019.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"55","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":"21","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":"8","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":"38% - 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":"3","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)"}}]}}