{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:21:46Z","timestamp":1754112106361,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033551"},{"type":"electronic","value":"9783642033568"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03356-8_31","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T14:00:39Z","timestamp":1250604039000},"page":"524-540","source":"Crossref","is-referenced-by-count":22,"title":["Collusion-Free Multiparty Computation in the Mediated Model"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Persiano","sequence":"additional","affiliation":[]},{"given":"abhi","family":"shelat","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-540-85174-5_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J. Alwen","year":"2008","unstructured":"Alwen, J., Shelat, A., Visconti, I.: Collusion-Free Protocols in the Mediated Model. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 497\u2013514. Springer, Heidelberg (2008)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/11535218_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"B. Barak","year":"2005","unstructured":"Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure Computation without Authentication. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 361\u2013377. Springer, Heidelberg (2005)"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/11496618_14","volume-title":"Information Security and Cryptology \u2013 ICISC 2004","author":"J.M. Bohli","year":"2005","unstructured":"Bohli, J.M., Steinwandt, R.: On Subliminal Channels in Deterministic Signature Schemes. In: Park, C.-s., Chee, S. (eds.) ICISC 2004. LNCS, vol.\u00a03506, pp. 182\u2013194. Springer, Heidelberg (2005)"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-61996-8_39","volume-title":"Information Hiding","author":"M. Burmester","year":"1996","unstructured":"Burmester, M., Desmedt, Y., Itoh, T., Sakurai, K., Shizuya, H., Yung, M.: A Progress Report on Subliminal-Free Channels. In: Anderson, R. (ed.) IH 1996. LNCS, vol.\u00a01174, pp. 157\u2013168. Springer, Heidelberg (1996)"},{"issue":"1","key":"31_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"issue":"3","key":"31_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1008174031940","volume":"17","author":"P. Cramption","year":"2000","unstructured":"Cramption, P., Schwartz, J.: Collusive Bidding: Lessons from the FCC Spectrum Auctions. Journal of Regulatory Economics\u00a017(3), 229\u2013252 (2000)","journal-title":"Journal of Regulatory Economics"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Desmedt, Y.: Simmons\u2019 Protocol is not Free of Subliminal Channels. In: IEEE Computer Security Foundations Workshop, pp. 170\u2013175 (1996)","DOI":"10.1109\/CSFW.1996.503702"},{"key":"31_CR8","series-title":"Basic Applications","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45708-9_6","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"N. Hopper","year":"2002","unstructured":"Hopper, N., Langford, J., von Ahn, L.: Provably Secure Steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 77\u201392. Springer, Heidelberg (2002)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-78524-8_16","volume-title":"Theory of Cryptography","author":"S. Izmalkov","year":"2008","unstructured":"Izmalkov, S., Lepinski, M., Micali, S.: Verifiably Secure Devices. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 273\u2013301. Springer, Heidelberg (2008)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Computation and Ideal Mechanism Design. In: Foundations of Computer Science (FOCS) 2005, pp. 585\u2013595 (2005)","DOI":"10.1109\/SFCS.2005.64"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30576-7_14","volume-title":"Theory of Cryptography","author":"M. Lepinski","year":"2005","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Fair Zero-Knowledge. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 245\u2013263. Springer, Heidelberg (2005)"},{"key":"31_CR13","first-page":"543","volume-title":"Symposium on Theory of Computing (STOC) 2005","author":"M. Lepinski","year":"2005","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: Symposium on Theory of Computing (STOC) 2005, pp. 543\u2013552. ACM, New York (2005)"},{"key":"31_CR14","unstructured":"Lindell, Y.: Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model. Chicago Journal of Theoretical Computer Science\u00a0(1), 1\u201350 (2006)"},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s00145-007-9015-5","volume":"21","author":"Y. Lindell","year":"2008","unstructured":"Lindell, Y.: Lower Bounds and Impossibility Results for Concurrent Self Composition. Journal of Cryptology\u00a021(2), 200\u2013249 (2008)","journal-title":"Journal of Cryptology"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority. In: Symposium on Theory of Computing (STOC) 2004, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"31_CR17","first-page":"51","volume-title":"Advances in Cryptology\u2014Crypto 1983","author":"G. Simmons","year":"1983","unstructured":"Simmons, G.: The Prisoners\u2019 Problem and the Subliminal Channel. In: Advances in Cryptology\u2014Crypto 1983, pp. 51\u201367. Springer, Heidelberg (1983)"},{"issue":"11","key":"31_CR18","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/188280.188298","volume":"37","author":"G. Simmons","year":"1994","unstructured":"Simmons, G.: Cryptanalysis and Protocol Failures. Comm. ACM\u00a037(11), 56\u201365 (1994)","journal-title":"Comm. ACM"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Simmons, G.: The History of Subliminal Channels. In: Information Hiding Workshop, pp. 237\u2013256 (1996)","DOI":"10.1007\/3-540-61996-8_44"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T19:46:23Z","timestamp":1739303183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}