{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T13:03:05Z","timestamp":1772024585336,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_6","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"93-111","source":"Crossref","is-referenced-by-count":64,"title":["Optimistic Fair Secure Computation"],"prefix":"10.1007","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[]},{"given":"Jan","family":"Camenisch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"6_CR1","first-page":"8","volume":"6","author":"N. Asokan","year":"1997","unstructured":"N. Asokan, M. Schunter, and M. Waidner, \u201cOptimistic protocols for fair exchange,\u201d in Proc. 4th ACM Conference on Computer and Communications Security, pp. 6, 8\u201317, 1997.","journal-title":"Proc. 4th ACM Conference on Computer and Communications Security"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"N. Asokan, V. Shoup, and M. Waidner, \u201cOptimistic fair exchange of digital signatures,\u201d IEEE Journal on Selected Areas in Communications, vol. 18, pp. 591\u2013610, Apr. 2000.","DOI":"10.1109\/49.839935"},{"key":"6_CR3","unstructured":"B. Baum-Waidner and M. Waidner, \u201cOptimistic asynchronous multi-party contract signing,\u201d Research Report RZ 3078 (#93124), IBM Research, Nov. 1998."},{"issue":"2","key":"6_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00196771","volume":"4","author":"D. Beaver","year":"1991","unstructured":"D. Beaver, \u201cSecure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority,\u201d Journal of Cryptology, vol. 4, no. 2, pp. 75\u2013122, 1991.","journal-title":"Journal of Cryptology"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"D. Beaver and S. Goldwasser, \u201cMultiparty computation with faulty majority (extended announcement),\u201d in Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 468\u2013473, 1989.","DOI":"10.1109\/SFCS.1989.63520"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali, and P. Rogaway, \u201cThe round complexity of secure protocols,\u201d in Proc. 22nd Annual ACM Symposium on Theory of Computing (STOC), pp. 503\u2013513, 1990.","DOI":"10.1145\/100216.100287"},{"key":"6_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Advances in Cryptology: CRYPTO\u2019 89","author":"M. Bellare","year":"1990","unstructured":"M. Bellare and S. Micali, \u201cNon-interactive oblivious transfer and applications,\u201d in Advances in Cryptology: CRYPTO\u2019 89 (G. Brassard, ed.), vol. 435 of Lecture Notes in Computer Science, pp. 547\u2013557, Springer, 1990."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, O. Goldreich, S. Micali, and R. L. Rivest, \u201cA fair protocol for signing contracts,\u201d IEEE Transactions on Information Theory, vol. 36, pp. 40\u201346, Jan. 1990.","DOI":"10.1109\/18.50372"},{"key":"6_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: CRYPTO\u2019 87","author":"E. F. Brickell","year":"1988","unstructured":"E. F. Brickell, D. Chaum, I. Damg\u00e5rd, and J. van de Graaf, \u201cGradual and verifiable release of a secret,\u201d in Advances in Cryptology: CRYPTO\u2019 87 (C. Pomerance, ed.), vol. 293 of Lecture Notes in Computer Science, Springer, 1988."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"J. Camenisch and I. Damg\u00e5rd, \u201cVerifiable encryption and applications to group signatures and signature sharing,\u201d Tech. Rep. RS-98-32, BRICS, Departement of Computer Science, University of Aarhus, Dec. 1998.","DOI":"10.7146\/brics.v5i32.19438"},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology: CRYPTO\u2019 97","author":"J. Camenisch","year":"1997","unstructured":"J. Camenisch and M. Stadler, \u201cEfficient group signature schemes for large groups,\u201d in Advances in Cryptology: CRYPTO\u2019 97 (B. Kaliski, ed.), vol. 1233 of Lecture Notes in Computer Science, pp. 410\u2013424, Springer, 1997."},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, \u201cSecurity and composition of multi-party cryptographic protocols,\u201d Journal of Cryptology, vol. 13, no. 1, pp. 143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"6_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-39118-5","volume-title":"Advances in Cryptology: CRYPTO\u2019 87","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, I. Damg\u00e5rd, and J. van de Graaf, \u201cMultiparty computations ensuring privacy of each party\u2019s input and correctness of the result,\u201d in Advances in Cryptology: CRYPTO\u2019 87 (C. Pomerance, ed.), vol. 293 of Lecture Notes in Computer Science, Springer, 1988."},{"key":"6_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology: CRYPTO\u2019 92","author":"D. Chaum","year":"1993","unstructured":"D. Chaum and T. P. Pedersen, \u201cWallet databases with observers,\u201d in Advances in Cryptology: CRYPTO\u2019 92 (E. F. Brickell, ed.), vol. 740 of Lecture Notes in Computer Science, pp. 89\u2013105, Springer-Verlag, 1993."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"R. Cleve, \u201cLimits on the security of coin flips when half the processors are faulty,\u201d in Proc. 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364\u2013369, 1986.","DOI":"10.1145\/12130.12168"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. Damg\u00e5rd, \u201cLinear zero-knowledge\u2014a note on efficient zero-knowledge proofs and arguments,\u201d in Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), 1997.","DOI":"10.1145\/258533.258635"},{"key":"6_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: CRYPTO\u2019 94","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd, and B. Schoemakers, \u201cProofs of partial knowledge and simplified design of witness hiding protocols,\u201d in Advances in Cryptology: CRYPTO\u2019 94 (Y. G. Desmedt, ed.), vol. 839 of Lecture Notes in Computer Science, 1994."},{"key":"6_CR18","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: CRYPTO\u2019 98","author":"R. Cramer","year":"1998","unstructured":"R. Cramer and V. Shoup, \u201cA practical public-key cryptosystem provably secure against adaptive chosen-ciphertext attack,\u201d in Advances in Cryptology: CRYPTO\u2019 98 (H. Krawczyk, ed.), vol. 1462 of Lecture Notes in Computer Science, Springer, 1998."},{"key":"6_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: CRYPTO\u2019 95","author":"C. Cr\u2019epeau","year":"1995","unstructured":"C. Cr\u2019epeau, J. van de Graaf, and A. Tapp, \u201cCommitted oblivious transfer and private multi-party computation,\u201d in Advances in Cryptology: CRYPTO\u2019 95 (D. Coppersmith, ed.), vol. 963 of Lecture Notes in Computer Science, Springer, 1995."},{"key":"6_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology: EUROCRYPT 2000","author":"I. B. Damg\u00e5rd","year":"2000","unstructured":"I. B. Damg\u00e5rd, \u201cEfficient concurrent zero-knowledge in the auxiliary string model,\u201d in Advances in Cryptology: EUROCRYPT 2000 (B. Preneel, ed.), vol. 1087 of Lecture Notes in Computer Science, pp. 418\u2013430, Springer, 2000."},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor, \u201cNon-malleable cryptography (extended abstract),\u201d in Proc. 23rd Annual ACM Symposium on Theory of Computing (STOC), pp. 542\u2013552, 1991.","DOI":"10.1145\/103418.103474"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"T. ElGamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithms,\u201d IEEE Transactions on Information Theory, vol. 31, pp. 469\u2013472, July 1985.","DOI":"10.1109\/TIT.1985.1057074"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich, and A. Lempel, \u201cA randomized protocol for signing contracts,\u201d Communications of the ACM, vol. 28, pp. 637\u2013647, 1985.","journal-title":"Communications of the ACM"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor, \u201cA minimal model for secure computation (extended abstract)\u201d in Proc. 26th Annual ACM Symposium on Theory of Computing (STOC), pp. 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"key":"6_CR25","unstructured":"O. Goldreich, \u201cSecure multi-party computation.\u201d Manuscript, 1998. (Version 1.1)."},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, \u201cHow to play any mental game or a completeness theorem for protocols with honest majority,\u201d in Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"6_CR27","series-title":"Lect Notes Comput Sci","volume-title":"Advances in Cryptology: CRYPTO\u2019 90","author":"S. Goldwasser","year":"1991","unstructured":"S. Goldwasser and L. Levin, \u201cFair computation of general functions in presence of immoral majority,\u201d in Advances in Cryptology: CRYPTO\u2019 90 (A. J. Menezes and S. A. Vanstone, eds.), vol. 537 of Lecture Notes in Computer Science, Springer, 1991."},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser and S. Micali, \u201cProbabilistic encryption,\u201d Journal of Computer and System Sciences, vol. 28, pp. 270\u2013299, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR29","volume-title":"Presentation at the Workshop on Multi-Party Secure Protocols","author":"S. Micali","year":"1998","unstructured":"S. Micali, \u201cSecure protocols with invisible trusted parties.\u201d Presentation at the Workshop on Multi-Party Secure Protocols, Weizmann Institute of Science, Israel, June 1998."},{"key":"6_CR30","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: CRYPTO\u2019 91","author":"S. Micali","year":"1992","unstructured":"S. Micali and P. Rogaway, \u201cSecure computation,\u201d in Advances in Cryptology: CRYPTO\u2019 91 (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 392\u2013404, Springer, 1992."},{"key":"6_CR31","unstructured":"M. Naor and O. Reingold, \u201cNumber-theoretic constructions of efficient pseudorandom functions,\u201d in Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), 1997."},{"key":"6_CR32","unstructured":"M. O. Rabin, \u201cHow to exchange secrets by oblivious transfer,\u201d Tech. Rep. TR-81, Harvard University, 1981."},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr, \u201cEfficient signature generation by smart cards,\u201d Journal of Cryptology, vol. 4, pp. 161\u2013174, 1991.","journal-title":"Journal of Cryptology"},{"key":"6_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-68339-9_17","volume-title":"Advances in Cryptology: EUROCRYPT\u2019 96","author":"M. Stadler","year":"1996","unstructured":"M. Stadler, \u201cPublicly verifiable secret sharing,\u201d in Advances in Cryptology: EUROCRYPT\u2019 96 (U. Maurer, ed.), vol. 1233 of Lecture Notes in Computer Science, pp. 190\u2013199, Springer, 1996."},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"A. C. Yao, \u201cProtocols for secure computation,\u201d in Proc. 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 160\u2013164, 1982.","DOI":"10.1109\/SFCS.1982.38"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"A. C. Yao, \u201cHow to generate and exchange secrets,\u201d in Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:34:18Z","timestamp":1556382858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}