{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:56:40Z","timestamp":1773511000620,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,10]],"date-time":"2011-05-10T00:00:00Z","timestamp":1304985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10623-011-9515-z","type":"journal-article","created":{"date-parts":[[2011,5,9]],"date-time":"2011-05-09T06:23:03Z","timestamp":1304922183000},"page":"259-272","source":"Crossref","is-referenced-by-count":17,"title":["Multi-party computation with conversion of secret sharing"],"prefix":"10.1007","volume":"62","author":[{"given":"Hossein","family":"Ghodosi","sequence":"first","affiliation":[]},{"given":"Josef","family":"Pieprzyk","sequence":"additional","affiliation":[]},{"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,10]]},"reference":[{"key":"9515_CR1","unstructured":"Bar-Ilan J., Beaver D.: Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In: 8th Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, pp. 201\u2013209. (1989)."},{"key":"9515_CR2","unstructured":"Beaver D.: Multiparty protocols tolerating half faulty processors. In: Brassard G. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO\u201989. Lecture Notes in Computer Science, vol. 435, pp. 560\u2013572. Springer-Verlag, Heidelberg (1990)."},{"key":"9515_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"Beaver D.: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority. J. Cryptol. 4, 75\u2013122 (1991)","journal-title":"J. Cryptol."},{"key":"9515_CR4","unstructured":"Beaver D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum J. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO\u201991. Lecture Notes in Computer Science, vol. 576, pp. 420\u2013432. Springer-Verlag, Heidelberg (1992)."},{"key":"9515_CR5","unstructured":"Beaver D.: Precomputing oblivious transfer. In: Dwork C. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 1995. Lecture Notes in Computer Science vol. 963, pp. 97\u2013109. Springer-Verlag, Heidelberg (1995)."},{"key":"9515_CR6","doi-asserted-by":"crossref","unstructured":"Beaver D.: Commodity-based cryptography. In: Proceedings of the 29th ACM Annual Symposium on the Theory of Computing (STOC\u201997), pp. 446\u2013455. (1997).","DOI":"10.1145\/258533.258637"},{"key":"9515_CR7","doi-asserted-by":"crossref","unstructured":"Beaver D., Goldwasser S.: Multiparty computation with faulty majority. In: The 30th IEEE Symposium on the Foundations of Computer Science (FOCS89), pp. 468\u2013473. (1989).","DOI":"10.1109\/SFCS.1989.63520"},{"key":"9515_CR8","doi-asserted-by":"crossref","unstructured":"Beaver D., Micali S., Rogaway P.: The round complexity of secure protocols. In: Proceedings of the 22nd ACM Annual Symposium on the Theory of Computing (STOC\u201990), pp. 503\u2013513. (1990).","DOI":"10.1145\/100216.100287"},{"key":"9515_CR9","unstructured":"Beaver D., Wool A.: Quorum-based secure multi-party computation. In: Nyberg K. (ed.) Advances in Cryptology\u2014Proceedings of EUROCRYPT\u201998. Lecture Notes in Computer Science, vol. 1403, pp. 375\u2013390. Springer-Verlag, Heidelberg (1998)."},{"key":"9515_CR10","unstructured":"Benaloh J.: Secret sharing homomorphisms: keeping shares of a secret. In: Odlyzko A. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO\u201986. Lecture Notes in Computer Science, vol. 263, pp. 251\u2013260. Springer-Verlag, Heidelberg (1987)."},{"key":"9515_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorem for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th ACM Annual Symposium on the Theory of Computing (STOC\u201988), pp. 1\u201310. (1988).","DOI":"10.1145\/62212.62213"},{"key":"9515_CR12","doi-asserted-by":"crossref","unstructured":"Chaum D., Cr\u00e9peau C., Damg\u00e5rd I.: Multiparty unconditionally secure protocols. In: Proceedings of the 20th ACM Annual Symposium on the Theory of Computing (STOC\u201988), pp. 11\u201319. (1988).","DOI":"10.1145\/62212.62214"},{"key":"9515_CR13","unstructured":"Cramer R., Damg\u00e5rd I., Ishai Y.: Share conversion, pseudorandom secret-sharing, and applications to secure computation. In: Kilian J. (ed.) 2nd Theory of Cryptography Conference TCC 2005. Lecture Notes in Computer Science, vol. 3378, pp. 342\u2013362. Springer-Verlag, Heidelberg (2005)."},{"key":"9515_CR14","unstructured":"Cr\u00e9peau C., van de Graaf J., Tapp A.: Committed oblivious transfer and private multi-party computation. In: Dwork C. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 1995. Lecture Notes in Computer Science, vol. 963, pp. 110\u2013123. Springer-Verlag, Heidelberg (1995)."},{"key":"9515_CR15","unstructured":"Damg\u00e5rd I., Ishai Y.: Scalable secure multiparty computation. In: Dwork C. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 2006. Lecture Notes in Computer Science, vol. 4117, pp. 501\u2013520. Springer-Verlag, Heidelberg (2006)."},{"key":"9515_CR16","unstructured":"Damg\u00e5rd I., Nielsen J.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh D. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 2003. Lecture Notes in Computer Science, vol. 2729, pp. 247\u2013264. Springer-Verlag, Heidelberg (2003)."},{"key":"9515_CR17","unstructured":"Fitzi M., Garay J., Maurer U., Ostrovsky R.: Minimal complete primitives for secure multi-party computation. In: Kilian J. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, pp. 80\u2013100. Springer-Verlag, Heidelberg (2001)."},{"key":"9515_CR18","unstructured":"Fitzi M., Hirt M., Maurer U.: Trading correctness for privacy in unconditional multi-party computation. In: Krawczyk H. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO\u201998. of Lecture Notes in Computer Science, vol. 1462, pp. 121\u2013136. Springer-Verlag, Heidelberg (1998)."},{"key":"9515_CR19","unstructured":"Fitzi M., Holenstein T., Wullschleger J.: Multi-party Computation with Hybrid Security. In: Cachin C., Camenisch J. (eds.) Advances in Cryptology\u2014Proceedings of EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 419\u2013438. Springer-Verlag, Heidelberg (2004)."},{"key":"9515_CR20","doi-asserted-by":"crossref","unstructured":"Gennaro R., Rabin M., Rabin T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 101\u2013111. (1998).","DOI":"10.1145\/277697.277716"},{"key":"9515_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, vol. II","author":"O. Goldreich","year":"2004","unstructured":"Goldreich O.: Foundations of Cryptography, vol. II. Cambridge University Press, Cambridge (2004)"},{"key":"9515_CR22","doi-asserted-by":"crossref","unstructured":"Goldreich O., Micali S., Wigderson A.: How to play any mental game. In: Proceedings of the 19th ACM Annual Symposium on the Theory of Computing (STOC\u201987), pp. 218\u2013229, 25\u201327 May 1987.","DOI":"10.1145\/28395.28420"},{"key":"9515_CR23","doi-asserted-by":"crossref","unstructured":"Hirt M., Maurer U.: Complete characterization of adversaries tolerable in secure multi-party computations. In: 16th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 25\u201334. (1997).","DOI":"10.1145\/259380.259412"},{"key":"9515_CR24","unstructured":"Hirt M., Maurer U.: Robustness for free in unconditional multi-party computation. In: Kilian J. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 2001. Lecture Notes in Computer Science, vol. 2139, pp. 101\u2013118. Springer-Verlag, Heidelberg (2001)."},{"key":"9515_CR25","unstructured":"Hirt M., Maurer U., Przydatek B.: Efficient secure multi-party computation. In Okamoto T. (ed.) Advances in Cryptology\u2014Proceedings of ASIACRYPT 2000. Lecture Notes in Computer Science, vol. 1976, pp. 143\u2013161. Springer-Verlag, Heidelberg (2000)."},{"key":"9515_CR26","unstructured":"Hirt M., Nielsen J.: Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation. In: Roy B. (ed.) Advances in Cryptology\u2014Proceedings of ASIACRYPT 2005. Lecture Notes in Computer Science, vol. 3788, pp. 79\u201399. Springer-Verlag, Heidelberg (2005)."},{"key":"9515_CR27","unstructured":"Ishai Y., Prabhakaran M., Sahai A.: Secure arithmetic computation with no honest majority. In: Reingold O. (ed.) 6th Theory of Cryptography Conference TCC 2009. Lecture Notes in Computer Science, vol. 5444, pp. 294\u2013314. Springer-Verlag, Heidelberg (2009)."},{"key":"9515_CR28","unstructured":"Ishai Y., Prabhakaran M., Sahai A.: Founding cryptography on oblivious transfer\u2014efficiently. In: Wagner D. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO 2008. Lecture Notes in Computer Science, vol. 5157, pp. 572\u2013591. Springer-Verlag, Heidelberg (2008)."},{"key":"9515_CR29","doi-asserted-by":"crossref","unstructured":"Kilian J.: Founding cryptography on oblivious transfer. In: Proceedings of the 20th ACM Annual Symposium on the Theory of Computing (STOC\u201988), pp. 20\u201331. (1988).","DOI":"10.1145\/62212.62215"},{"key":"9515_CR30","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1007\/3-540-39200-9_36","volume-title":"Advances in Cryptology\u2014Proceedings of EUROCRYPT 2003","author":"J. Katz","year":"2003","unstructured":"Katz J., Ostrovsky R., Smith A.: Round efficiency of multi-party computation with a dishonest majority. In: Biham, E. (ed.) Advances in Cryptology\u2014Proceedings of EUROCRYPT 2003, pp. 578\u2013595. Springer-Verlag, Heidelberg (2003)"},{"key":"9515_CR31","doi-asserted-by":"crossref","unstructured":"Kushilevitz E.: Privacy and communication complexity. In: the 30th IEEE Symposium on the Foundations of Computer Science (FOCS89), pp. 416\u2013421. (1989).","DOI":"10.1109\/SFCS.1989.63512"},{"key":"9515_CR32","unstructured":"Kushilevitz E., Rosc\u0300n A.: A randomness-rounds tradeoff in private computation. In: Desmedt Y. (ed.) Advances in Cryptology\u2014Proceedings of CRYPTO\u201994. Lecture Notes in Computer Science, vol. 839, pp. 397\u2013409. Springer-Verlag, Heidelberg (1994)."},{"key":"9515_CR33","doi-asserted-by":"crossref","unstructured":"Rabin T., Ben-Or M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proceedings of the 21th ACM Annual Symposium on the Theory of Computing (STOC\u201989), pp. 73\u201385. (1989).","DOI":"10.1145\/73007.73014"},{"key":"9515_CR34","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Communications of the ACM 22, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"9515_CR35","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. Stinson","year":"1992","unstructured":"Stinson D.: An explication of secret sharing schemes. Designs, Codes and Cryptography 2, 357\u2013390 (1992)","journal-title":"Designs, Codes and Cryptography"},{"key":"9515_CR36","doi-asserted-by":"crossref","unstructured":"Yao A.: Protocols for secure computations. In: the 23rd IEEE Symposium on the Foundations of Computer Science, pp. 160\u2013164. (1982).","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9515-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9515-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9515-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T12:45:45Z","timestamp":1741178745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9515-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,10]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["9515"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9515-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,10]]}}}