{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:15:53Z","timestamp":1780391753313,"version":"3.54.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,28]],"date-time":"2015-09-28T00:00:00Z","timestamp":1443398400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00145-015-9214-4","type":"journal-article","created":{"date-parts":[[2015,9,28]],"date-time":"2015-09-28T19:29:59Z","timestamp":1443468599000},"page":"58-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":69,"title":["A Full Proof of the BGW Protocol for Perfectly Secure Multiparty Computation"],"prefix":"10.1007","volume":"30","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,9,28]]},"reference":[{"key":"9214_CR1","unstructured":"G.\u00a0Asharov, Y.\u00a0Lindell, A full proof of the BGW protocol for perfectly-secure multiparty computation. Cryptology ePrint Archive, Report 2011\/136 (2011)"},{"key":"9214_CR2","doi-asserted-by":"crossref","unstructured":"G.\u00a0Asharov, Y.\u00a0Lindell, T.\u00a0Rabin, Perfectly-secure multiplication for any \n                    \n                      \n                    \n                    $$t<n\/3$$\n                    \n                      \n                        \n                          t\n                          <\n                          n\n                          \/\n                          3\n                        \n                      \n                    \n                  , in CRYPTO 2011. LNCS 6841 (Springer, 2011), pp. 240\u2013258","DOI":"10.1007\/978-3-642-22792-9_14"},{"key":"9214_CR3","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, Multiparty protocols tolerating half faulty processors, in CRYPTO\u201989. LNCS 435 (Springer, 1990), pp. 560\u2013572","DOI":"10.1007\/0-387-34805-0_49"},{"key":"9214_CR4","doi-asserted-by":"crossref","unstructured":"D.\u00a0Beaver, Foundations of secure interactive computing, in CRYPTO\u201991. LNCS 576 (Springer, 1991), pp. 377\u2013391","DOI":"10.1007\/3-540-46766-1_31"},{"key":"9214_CR5","doi-asserted-by":"crossref","unstructured":"Z.\u00a0Beerliov\u00e1-Trub\u00edniov\u00e1, M.\u00a0Hirt, Perfectly-secure MPC with linear communication complexity, in 5th TCC. LNCS 4948 (Springer, 2008), pp. 213\u2013230","DOI":"10.1007\/978-3-540-78524-8_13"},{"issue":"4","key":"9214_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00446-002-0083-3","volume":"16","author":"M Ben-Or","year":"2003","unstructured":"M.\u00a0Ben-Or, R.\u00a0El-Yaniv, Resilient-Optimal Interactive Consistency in Constant Time, in Distributed Computing, 16(4):249\u2013262, (2003)","journal-title":"Distrib. Comput."},{"key":"9214_CR7","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, in The 20th STOC (1988), pp. 1\u201310"},{"issue":"1","key":"9214_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R.\u00a0Canetti, Security and Composition of Multiparty Cryptographic Protocols. In the Journal of Cryptology, 13(1):143\u2013202, (2000)","journal-title":"J. Cryptol."},{"key":"9214_CR9","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, Universally composable security: a new paradigm for cryptographic protocols, in The 42nd FOCS (2001), pp. 136\u2013145. See Cryptology ePrint Archive: Report 2000\/067 for the full version","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"3","key":"9214_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s00145-004-0135-x","volume":"17","author":"R Canetti","year":"2004","unstructured":"R.\u00a0Canetti, I.\u00a0Damg\u00e5rd, S.\u00a0Dziembowski, Y.\u00a0Ishai, T.\u00a0Malkin, Adaptive versus Non-Adaptive Security of Multi-Party Protocols. In the Journal of Cryptology 17(3):153\u2013207, (2004)","journal-title":"J. Cryptol."},{"key":"9214_CR11","unstructured":"R.\u00a0Canetti, U.\u00a0Feige, O.\u00a0Goldreich, M.\u00a0Naor, Adaptively secure multi-party computation, in The 28th STOC (1996), pp. 639\u2013648"},{"key":"9214_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, H.\u00a0Krawczyk, Universally composable notions of key-exchange and secure channels, in EUROCRYPT 2002. LNCS 2332 (Springer, 2002), pp. 337\u2013351","DOI":"10.1007\/3-540-46035-7_22"},{"key":"9214_CR13","unstructured":"R.\u00a0Canetti, Y.\u00a0Lindell, R.\u00a0Ostrovsky, A.\u00a0Sahai, Universally composable two-party and multi-party computation. In The 34th STOC (2002), pp. 494\u2013503"},{"key":"9214_CR14","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd, Multi-party unconditionally secure protocols, in 20th STOC (1988), pp. 11\u201319"},{"key":"9214_CR15","unstructured":"B.\u00a0Chor, S.\u00a0Goldwasser, S.\u00a0Micali, B.\u00a0Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults, in The 26 FOCS (1985), pp. 383\u2013395"},{"key":"9214_CR16","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, S.\u00a0Micali, Parallel reducibility for information-theoretically secure computation, in CRYPTO 2000. LNCS 1880 (Springer, 2000), pp. 74\u201392","DOI":"10.1007\/3-540-44598-6_5"},{"key":"9214_CR17","doi-asserted-by":"crossref","unstructured":"P.\u00a0Feldman, Optimal algorithms for byzantine agreement. Ph.D. thesis, Massachusetts Institute of Technology (1988)","DOI":"10.1145\/62212.62225"},{"issue":"4","key":"9214_CR18","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"P.\u00a0Feldman, S.\u00a0Micali, An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. In the SIAM Journal on Computing, 26(4):873\u2013933, (1997)","journal-title":"SIAM J. Comput."},{"key":"9214_CR19","unstructured":"R.\u00a0Gennaro, M.O.\u00a0Rabin, T.\u00a0Rabin, Simplified VSS and fact-track multiparty computations with applications to threshold cryptography, in The 17th PODC (1998), pp. 101\u2013111"},{"key":"9214_CR20","unstructured":"O.\u00a0Goldreich, Foundations of Cryptography: Volume 2\u2014Basic Applications (2004, Cambridge University Press, Cambridge)"},{"key":"9214_CR21","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, A.\u00a0Wigderson, How to play any mental game\u2014a completeness theorem for protocols with honest majority, in 19th STOC (1987), pp. 218\u2013229. For details see [20]","DOI":"10.1145\/28395.28420"},{"key":"9214_CR22","doi-asserted-by":"crossref","unstructured":"S.\u00a0Goldwasser, L.\u00a0Levin, Fair computation of general functions in presence of immoral majority, in CRYPTO\u201990. LNCS 537 (Springer, 1990), pp. 77\u201393","DOI":"10.1007\/3-540-38424-3_6"},{"issue":"2","key":"9214_CR23","first-page":"270","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"S.\u00a0Goldwasser, S.\u00a0Micali, Probabilistic Encryption. JCSS, 28(2):270\u2013299, (1984)","journal-title":"JCSS"},{"issue":"5","key":"9214_CR24","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/090755886","volume":"39","author":"E Kushilevitz","year":"2010","unstructured":"E.\u00a0Kushilevitz, Y.\u00a0Lindell, T.\u00a0Rabin, Information-Theoretically Secure Protocols and Security Under Composition. In the SIAM Journal on Computing, 39(5):2090\u20132112, (2010)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9214_CR25","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"L.\u00a0Lamport, R.\u00a0Shostack, M.\u00a0Pease, The Byzantine Generals Problem. In the ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9214_CR26","unstructured":"Y.\u00a0Lindell, General composition and universal composability in secure multi-party computation, in The 44th FOCS (2003), pp. 394\u2013403"},{"key":"9214_CR27","unstructured":"Y.\u00a0Lindell, A.\u00a0Lysyanskaya, T.\u00a0Rabin, Sequential composition of protocols without simultaneous termination, in The 21st PODC (2002), pp. 203\u2013212"},{"issue":"24","key":"9214_CR28","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"9","author":"RJ McEliece","year":"1981","unstructured":"R.J.\u00a0McEliece, D.V.\u00a0Sarwate, On Sharing Secrets and Reed-Solomon Codes. Communications of the ACM, 9(24):583\u2013584, (1981)","journal-title":"Commun. ACM"},{"key":"9214_CR29","doi-asserted-by":"crossref","unstructured":"S. Micali, P. Rogaway, Secure computation. Unpublished manuscript, 1992. Preliminary version, in CRYPTO\u201991. LNCS 576 (Springer, 1991), pp. 392\u2013404","DOI":"10.1007\/3-540-46766-1_32"},{"issue":"2","key":"9214_CR30","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"M.\u00a0Pease, R.\u00a0Shostak, L.\u00a0Lamport, Reaching Agreement in the Presence of Faults. In the Journal of the ACM, 27(2):228\u2013234, (1980)","journal-title":"J. ACM"},{"key":"9214_CR31","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or, Verifiable secret sharing and multi-party protocols with honest majority, in 21st STOC (1989), pp. 73\u201385"},{"issue":"11","key":"9214_CR32","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"A.\u00a0Shamir, How to Share a Secret. In the Communications of the ACM, 22(11):612\u2013613, (1979)","journal-title":"Commun. ACM"},{"key":"9214_CR33","unstructured":"A.C.\u00a0Yao, Theory and application of trapdoor functions, in 23rd FOCS (1982), pp. 80\u201391"},{"key":"9214_CR34","unstructured":"A.\u00a0Yao, How to generate and exchange secrets, in 27th FOCS (1986), pp. 162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9214-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9214-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9214-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9214-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:13:23Z","timestamp":1586333603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9214-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,28]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9214"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9214-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,28]]},"assertion":[{"value":"8 July 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}