{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:23:03Z","timestamp":1726039383142},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268336"},{"type":"electronic","value":"9783030268343"}],"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-26834-3_19","type":"book-chapter","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:05:29Z","timestamp":1565132729000},"page":"329-342","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["VSS Made Simpler"],"prefix":"10.1007","author":[{"given":"Yvo","family":"Desmedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"19_CR1","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. Cryptology ePrint Archive: Report 2011\/136. https:\/\/eprint.iacr.org\/2011\/136.pdf"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52\u201361 (1993)","DOI":"10.1145\/167088.167109"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"19_CR4","unstructured":"Berlekamp, E.R., Welch, L.R.: Error correction of algebraic block codes. U.S. Patent Number 4.633.470 (1986)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: AFIPS 1979 National Computer Conference, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s001459910005","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Kushilevitz, E., Ostrovsky, R., Rosen, A.: Randomness vs. fault-tolerance. J. Cryptol. 13(1), 107\u2013142 (2000). Conference version in PODC 1997","journal-title":"J. Cryptol."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s000370050025","volume":"8","author":"C Blundo","year":"1999","unstructured":"Blundo, C., De Santis, A., Persiano, G., Vaccaro, U.: Randomness complexity of private computation. Comput. Complex. 8(2), 145\u2013168 (1999)","journal-title":"Comput. Complex."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"19_CR10","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, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"19_CR11","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":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-20728-0_14","volume-title":"Information Theoretic Security","author":"A Choudhury","year":"2011","unstructured":"Choudhury, A., Kurosawa, K., Patra, A.: The round complexity of perfectly secure general VSS. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol. 6673, pp. 143\u2013162. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20728-0_14"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-85174-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M., Nielsen, J.B., Smith, A.: Scalable multiparty computation with nearly optimal work and resilience. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 241\u2013261. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_14"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Morozov, K.: Parity Check based redistribution of secret shares. In: ISIT, pp. 959\u2013963 (2015)","DOI":"10.1109\/ISIT.2015.7282597"},{"key":"19_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_14","volume-title":"Encyclopedia of Cryptography and Security","author":"B Schoenmakers","year":"2011","unstructured":"Schoenmakers, B.: Verifiable secret sharing. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security, vol. 1357. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_14"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/3-540-45708-9_36","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"F Serge","year":"2002","unstructured":"Serge, F., Ueli, M.: Linear VSS and distributed commitments based on secret sharing and pairwise checks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 565\u2013580. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_36"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11681878_17","volume-title":"Theory of Cryptography","author":"M Fitzi","year":"2006","unstructured":"Fitzi, M., Garay, J., Gollakota, S., Rangan, C.P., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329\u2013342. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_17"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: STOC, pp. 580\u2013589 (2001)","DOI":"10.1145\/380752.380853"},{"key":"19_CR19","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, pp. 101\u2013111 (1998)","DOI":"10.1145\/277697.277716"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"19_CR21","unstructured":"Heninger, N., Durumeric, Z., Wustrow, E., Halderman, J.A.: Mining your Ps and Qs: detection of widespread weak keys in network devices. In: 21st USENIX Conference on Security symposium (Security 2012), vol. 35 (2012)"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multi-party computation. J. Cryptol. 13(1), 31\u201360 (2000). (Preliminary version in PODC 1997: 25\u201334.)","journal-title":"J. Cryptol."},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-44448-3_12","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 143\u2013161. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_12"},{"issue":"9","key":"19_CR24","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: Fundam. Electron. Sci.) 72(9), 56\u201364 (1989)","journal-title":"Electron. Commun. Jpn. (Part III: Fundam. Electron. Sci.)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-540-70583-3_41","volume-title":"Automata, Languages and Programming","author":"J Katz","year":"2008","unstructured":"Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 499\u2013510. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_41"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S0895480196306130","volume":"10","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Mansour, Y.: Randomness in private computations. SIAM J. Discret. Math. 10(4), 647\u2013661 (1997)","journal-title":"SIAM J. Discret. Math."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R., Rosen, A.: Amortizing randomness in private multiparty computations. In: PODC, pp. 81\u201390 (1998)","DOI":"10.1145\/277697.277710"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-32009-5_37","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"AK Lenstra","year":"2012","unstructured":"Lenstra, A.K., Hughes, J.P., Augier, M., Bos, J.W., Kleinjung, T., Wachter, C.: Public keys. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 626\u2013642. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_37"},{"key":"19_CR29","doi-asserted-by":"publisher","DOI":"10.1201\/b14977","volume-title":"Algebraic Curves in Cryptography","author":"S Ling","year":"2013","unstructured":"Ling, S., Wang, H., Xing, C.: Algebraic Curves in Cryptography. CRC Press, Boca Raton (2013)"},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"UM Maurer","year":"2006","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. Discret. Appl. Math. 154(2), 370\u2013381 (2006). Journal version of Ueli M. Maurer: Secure Multi-party Computation Made Simple. SCN 2002, 14\u201328","journal-title":"Discret. Appl. Math."},{"issue":"9","key":"19_CR31","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24(9), 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"19_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968","volume-title":"Introduction to Coding Theory","author":"R Roth","year":"2006","unstructured":"Roth, R.: Introduction to Coding Theory. Cambridge University Press, Cambridge (2006)"},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-03356-8_29","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"A Patra","year":"2009","unstructured":"Patra, A., Choudhary, A., Rabin, T., Rangan, C.P.: The round complexity of verifiable secret sharing revisited. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 487\u2013504. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_29"},{"issue":"11","key":"19_CR35","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":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46513-8_15","volume-title":"Selected Areas in Cryptography","author":"DR Stinson","year":"2000","unstructured":"Stinson, D.R., Wei, R.: Unconditionally secure proactive secret sharing scheme with combinatorial structures. In: Heys, H., Adams, C. (eds.) SAC 1999. LNCS, vol. 1758, pp. 200\u2013214. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46513-8_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26834-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T03:53:38Z","timestamp":1575518018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26834-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268336","9783030268343"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26834-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWSEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"28 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwsec2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iwsec.org\/2019\/","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":"61","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":"18","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":"30% - 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.9","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":"5.6","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)"}},{"value":"https:\/\/www.iwsec.org\/2019\/","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}