{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:51Z","timestamp":1764132411683},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677154"},{"type":"electronic","value":"9783540450221"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45022-x_43","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T23:57:25Z","timestamp":1194998245000},"page":"512-523","source":"Crossref","is-referenced-by-count":65,"title":["One-Round Secure Computation and Secure Autonomous Mobile Agents"],"prefix":"10.1007","author":[{"given":"Christian","family":"Cachin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Camenisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joy","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,18]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02252866","volume":"2","author":"M. Abadi","year":"1990","unstructured":"M. Abadi and J. Feigenbaum, \u201cSecure circuit evaluation: A protocol based on hiding information from an oracle,\u201d Journal of Cryptology, vol. 2, pp. 1\u201312, 1990.","journal-title":"Journal of Cryptology"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, J. Feigenbaum, and J. Kilian, \u201cOn hiding information from an oracle,\u201d Journal of Computer and System Sciences, vol. 39, pp. 21\u201350, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR3","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CRYPTO\u2019 91","author":"D. Beaver","year":"1992","unstructured":"D. Beaver, \u201cFoundations of secure interactive computing,\u201d in Proc. CRYPTO\u2019 91 (J. Feigenbaum, ed.), LNCS 576, 1992."},{"key":"43_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","volume-title":"Proc. CRYPTO\u2019 89","author":"M. Bellare","year":"1990","unstructured":"M. Bellare and S. Micali, \u201cNon-interactive oblivious transfer and applications,\u201d in Proc. CRYPTO\u2019 89 (G. Brassard, ed.), LNCS435, pp. 547\u2013557, 1990."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, \u201cCompleteness theorems for non-cryptographic fault-tolerant distributed computation,\u201d in Proc. 20th STOC, pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum, P. Feldman, and S. Micali, \u201cNon-interactive zero-knowledge proof systems and its applications,\u201d in Proc. 20th STOC, pp. 103\u2013112, 1988.","DOI":"10.1145\/62212.62222"},{"key":"43_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CRYPTO\u2019 96","author":"D. Boneh","year":"1996","unstructured":"D. Boneh and R. J. Lipton, \u201cSearching for elements in black box fields and applications,\u201d in Proc. CRYPTO\u2019 96, LNCS 1109, 1996."},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"G. Brassard, C. Cr\u00e9peau, and J.-M. Robert, \u201cInformation theoretic reductions among disclosure problems,\u201d in Proc. 27th FOCS, 1986.","DOI":"10.1109\/SFCS.1986.26"},{"issue":"1","key":"43_CR9","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":"43_CR10","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali, \u201cResettable zero-knowledge,\u201d in Proc. 32nd STOC, 2000."},{"key":"43_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-39118-5","volume-title":"input and correctness of the result","author":"D. Chaum","year":"1988","unstructured":"D. Chaum, I. Damg\u00e5rd, and J. van deGraaf, \u201cMultiparty computations ensuring privacy of each party\u2019s input and correctness of the result,\u201d in Proc. CRYPTO\u2019 87 (C. Pomerance, ed.), LNCS 293, 1988."},{"key":"43_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 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 Proc. CRYPTO\u2019 94 (Y. G. Desmedt, ed.), LNCS 839, 1994."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"U. Feige, J. Kilian, and M. Naor, \u201cA minimal model for secure computation (extended abstract),\u201d in Proc. 26th STOC, pp. 554\u2013563, 1994.","DOI":"10.1145\/195058.195408"},{"issue":"1","key":"43_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539792230010","volume":"29","author":"U. Feige","year":"1999","unstructured":"U. Feige, D. Lapidot, and A. Shamir, \u201cMultiple noninteractive zero knowledge proofs under general assumptions,\u201d SI AM Journal on Computing, vol. 29, no. 1, pp. 1\u201328, 1999.","journal-title":"SI AM Journal on Computing"},{"key":"43_CR15","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum and M. Merritt, \u201cOpen questions, talk abstracts, and summary of discussions,\u201d in Distributed Computing and Cryptography, AMS, 1991.","DOI":"10.1090\/dimacs\/002\/01"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, \u201cHow to construct random functions,\u201d Journal of the ACM, vol. 33, pp. 792\u2013807, Oct. 1986.","DOI":"10.1145\/6490.6503"},{"key":"43_CR17","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 STOC, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"43_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Proc. CRYPTO\u2019 91","author":"S. Micali","year":"1992","unstructured":"S. Micali and P. Rogaway, \u201cSecure computation,\u201d in Proc. CRYPTO\u2019 91 (J. Feigenbaum, ed.), LNCS 576, pp. 392\u2013404, 1992."},{"key":"43_CR19","unstructured":"M. Naor and O. Reingold, \u201cNumber-theoretic constructions of efficient pseudorandom functions,\u201d in Proc. 38th FOCS, 1997."},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"R. Ostrovsky, R. Venkatesan, and M. Yung, \u201cFair games against an all-powerful adversary,\u201d in Advances in Computational Complexity Theory, AMS, 1993.","DOI":"10.1007\/978-1-4613-9323-8_31"},{"key":"43_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Proc. CRYPTO\u2019 91","author":"C. Rackoff","year":"1992","unstructured":"C. Rackoff and D. R. Simon, \u201cNon-interactive zero-knowledge proof of knowledge and chosen ciphertext attack,\u201d in Proc. CRYPTO\u2019 91 (J. Feigenbaum, ed.), LNCS 576, pp. 433\u2013444, 1992."},{"key":"43_CR22","unstructured":"R. L. Rivest, L. Adleman, and M. L. Dertouzos, \u201cOn data banks and privacy homomorphisms,\u201d in Foundations of Secure Computation (R. A. DeMillo, D. P. Dobkin, A. K. Jones, and R. J. Lipton, eds.), pp. 169\u2013177, Academic Press, 1978."},{"key":"43_CR23","unstructured":"P. Rogaway, The Round Complexity of Secure Protocols. PhD thesis, MIT, 1991."},{"key":"43_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68671-1_4","volume-title":"Mobile Agents and Security","author":"T. Sander","year":"1998","unstructured":"T. Sander and C. F. Tschudin, \u201cProtecting mobile agents against malicious hosts,\u201d in Mobile Agents and Security (G. Vigna, ed.), LNCS 1419, 1998."},{"key":"43_CR25","unstructured":"T. Sander, A. Young, and M. Yung, \u201cNon-interactive CryptoComputing for NC1,\u201d in Proc. 40th FOCS, 1999."},{"key":"43_CR26","doi-asserted-by":"crossref","unstructured":"A. C. Yao, \u201cHow to generate and exchange secrets,\u201d in Proc. 27th FOCS, pp. 162\u2013167, 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45022-X_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:25:53Z","timestamp":1556969153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45022-X_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677154","9783540450221"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45022-x_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}