{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:50:08Z","timestamp":1778064608669,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705826","type":"print"},{"value":"9783540705833","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70583-3_41","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"499-510","source":"Crossref","is-referenced-by-count":28,"title":["Improving the Round Complexity of VSS in Point-to-Point Networks"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiu-Yuen","family":"Koo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ranjit","family":"Kumaresan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: National Computer Conference, vol.\u00a048, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"41_CR4","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 - 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.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"issue":"1","key":"41_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM\u00a040(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"issue":"4","key":"41_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Computing\u00a026(4), 873\u2013933 (1997)","journal-title":"SIAM J. Computing"},{"issue":"4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M.J. Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Information Processing Letters\u00a014(4), 183\u2013186 (1982)","journal-title":"Information Processing Letters"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Garay, J.: Efficient player-optimal protocols for strong and differential consensus. In: 22nd Annual ACM Symp. on Principles of Distributed Computing, pp. 211\u2013220 (2003)","DOI":"10.1145\/872035.872066"},{"key":"41_CR9","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.A., Gollakota, S., Rangan, C.P., Srinathan, K.: Round-optimal and efficient verifiable secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 329\u2013342. Springer, Heidelberg (2006)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The round complexity of verifiable secret sharing and secure multicast. In: 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 580\u2013589 (2001)","DOI":"10.1145\/380752.380853"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for Byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 445\u2013462. Springer, Heidelberg (2006)"},{"key":"41_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-72540-4_18","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Katz","year":"2007","unstructured":"Katz, J., Koo, C.-Y.: Round-efficient secure computation in point-to-point networks. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 311\u2013328. Springer, Heidelberg (2007)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Katz, J., Koo, C.-Y., Kumaresan, R.: Improving the round complexity of VSS in point-to-point networks, http:\/\/eprint.iacr.org\/2007\/358","DOI":"10.1007\/978-3-540-70583-3_41"},{"key":"41_CR14","unstructured":"Koo, C.: Studies on Fault-Tolerant Broadcast and Secure Computation. PhD thesis, University of Maryland (2007)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Lysyanskaya, A., Rabin, T.: Sequential composition of protocols without simultaneous termination. In: 21st Annual ACM Symposium on Principles of Distributed Computing, pp. 203\u2013212 (2002)","DOI":"10.1145\/571855.571859"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/3-540-38424-3_18","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Micali","year":"1991","unstructured":"Micali, S., Rabin, T.: Collective coin tossing without assumptions nor broadcasting. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 253\u2013266. Springer, Heidelberg (1991)"},{"key":"41_CR17","unstructured":"Patra, A., Choudhary, A., Ashwinkumar, B., Rangan, C.: Probabilistic verifiable secret sharing tolerating an adaptive adversary, http:\/\/eprint.iacr.org\/2008\/101"},{"key":"41_CR18","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"41_CR19","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. Comm. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T12:06:34Z","timestamp":1588853194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705826","9783540705833"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}