{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:46Z","timestamp":1766281006445,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424567"},{"type":"electronic","value":"9783540446477"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_5","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"80-100","source":"Crossref","is-referenced-by-count":13,"title":["Minimal Complete Primitives for Secure Multi-party Computation"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Fitzi","sequence":"first","affiliation":[]},{"given":"Juan A.","family":"Garay","sequence":"additional","affiliation":[]},{"given":"Ueli","family":"Maurer","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology-CRYPTO\u2019 91","author":"D. Beaver","year":"1992","unstructured":"D. Beaver. Foundations of secure interactive computation. In Advances in Cryptology-CRYPTO\u2019 91, LNCS, pp. 377\u2013391. Springer-Verlag, 1992."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. 20th ACM Symp. on the Theory of Computing, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-61996-8_50","volume-title":"Proc.First Infohiding","author":"M. Blaze","year":"1996","unstructured":"M. Blaze. Oblivious Key Escrow. In R. Anderson, editor, Proc.First Infohiding, LNCS, pp. 335\u2013343, Cambridge, U.K., 1996. Springer-Verlag."},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","volume-title":"Advances in Cryptology-CRYPTO\u2019 99","author":"A. Beimel","year":"1999","unstructured":"A. Beimel, T. Malkin, and S. Micali. The all-or-nothing nature of two-party secure computation. In Advances in Cryptology-CRYPTO\u2019 99, volume 1666 of LNCS, pp. 80\u201397. Springer-Verlag, 1999."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract). In Proc. 20th ACM Symp. on the Theory of Computing, pp. 11\u201319, 1988.","DOI":"10.1145\/62212.62214"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 99","author":"R. Cramer","year":"1999","unstructured":"R. Cramer, I. Damg\u00e5rd, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Advances in Cryptology \u2014 EUROCRYPT\u2019 99, LNCS, 1999."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"D. Chaum. The Dining Cryptographers Problem: Unconditional sender and recipient untraceability. Journal of Cryptology, 1(1):65\u201375, 1988.","journal-title":"Journal of Cryptology"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0012-365X(79)90084-0","volume":"25","author":"V. Chv\u00e1tal","year":"1979","unstructured":"V. Chv\u00e1tal. The tail of the hypergeometric distribution. Discrete Mathematics, 25:285\u2013287, 1979.","journal-title":"Discrete Mathematics"},{"issue":"1","key":"5_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. Journal of the ACM, 40(1):17\u201347, Jan. 1993.","journal-title":"Journal of the ACM"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"M. J. Fischer","year":"1986","unstructured":"M. J. Fischer, N. A. Lynch, and M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Computing, 1:26\u201339, 1986.","journal-title":"Distributed Computing"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"M. Fitzi and U. Maurer. From partial consistency to global broadcast. In 32nd Annual Symp. on the Theory of Computing, pp. 494\u2013503, 2000.","DOI":"10.1145\/335305.335363"},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-34799-2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 90","author":"S. Goldwasser","year":"1990","unstructured":"S. Goldwasser and L. Levin. Fair computation of general functions in presence of immoral majority. In Advances in Cryptology \u2014 CRYPTO\u2019 90, volume 537 of LNCS. Springer-Verlag, 1990. g"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. 19th A CM Symp. on the Theory of Computing, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"5_CR15","unstructured":"O. Goldreich. Secure multi-party computation, working draft, version 1.2, Mar. 2000."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th Annual ACM Symp. on the Theory of Computing, pp. 20\u201331, 2\u20134 May 1988.","DOI":"10.1145\/62212.62215"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"J. Kilian. A general completeness theorem for two-party games. In Proc.23rd Annual ACM Symposium on the Theory of Computing, pp. 553\u2013560, New Orleans, Louisiana, 6\u20138 May 1991.","DOI":"10.1145\/103418.103475"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"J. Kilian. More general completeness theorems for secure two-party computation. In Proc.32nd Annual ACM Symp. on the Theory of Computing, pp. 316\u2013324, Portland, Oregon, 21\u201323 May 2000.","DOI":"10.1145\/335305.335342"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM Journal on Computing, 29, 1999.","DOI":"10.1137\/S0097539797321742"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in multi-party private computations. In Proc. 35th Annual IEEE Symp. on the Foundations of Computer Science, pp. 478\u2013491, Nov. 1994.","DOI":"10.1109\/SFCS.1994.365743"},{"key":"5_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 91","author":"S. Micali","year":"1992","unstructured":"S. Micali and P. Rogaway. Secure computation. In Advances in Cryptology \u2014 CRYPTO\u2019 91, volume 576 of LNCS, pp. 392\u2013404. Springer-Verlag, 1992."},{"issue":"2","key":"5_CR22","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228\u2013234, Apr. 1980.","journal-title":"Journal of the ACM"},{"key":"5_CR23","unstructured":"M. O. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981. g"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symp. on the Theory of Computing, pp. 73\u201385, 1989.","DOI":"10.1145\/73007.73014"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"L. G. Valiant. Universal circuits. In ACM Symposium on Theory of Computing (STOC\u2019 76), pp. 196\u2013203, New York, May 1976. ACM Press.","DOI":"10.1145\/800113.803649"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Protocols for secure computations. In Proc. 23rd IEEE Symp. on the Foundations of Computer Science, pp. 160\u2013164. IEEE, 1982.","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:09:16Z","timestamp":1737533356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}