{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:45Z","timestamp":1766281005280},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540851738"},{"type":"electronic","value":"9783540851745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_28","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T12:32:02Z","timestamp":1219235522000},"page":"497-514","source":"Crossref","is-referenced-by-count":33,"title":["Collusion-Free Protocols in the Mediated Model"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[]},{"given":"Abhi","family":"Shelat","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Alparone, M., Persiano, G.: Staganography-free implementation of yao\u2019s protocol. Technical report (unpublished, 2006)"},{"issue":"1","key":"28_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-4068(74)90037-8","volume":"1","author":"R.J. Aumann","year":"1974","unstructured":"Aumann, R.J.: Subjectivity and Correlation in Randomized Strategies. Journal of Mathematical Economics\u00a01(1), 67\u201396 (1974)","journal-title":"Journal of Mathematical Economics"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/11535218_22","volume-title":"Crypto 2006","author":"B. Barak","year":"2005","unstructured":"Barak, B., Canetti, R., Lindell, Y., Pass, R., Rabin, T.: Secure computation without authentication. In: CRYPTO 2006. LNCS, vol.\u00a04622, pp. 361\u2013377. Springer, Heidelberg (2005)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: STOC 1988: Proceedings of the twentieth annual ACM symposium on Theory of computing, pp. 1\u201310. ACM, New York (1988)"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Golle, P.: Almost Entirely Correct Mixing with Applications to Voting. In: CCS 2002, pp. 68\u201377 (2002)","DOI":"10.1145\/586110.586121"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. 42nd FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11555827_8","volume-title":"Computer Security \u2013 ESORICS 2005","author":"D. Chaum","year":"2005","unstructured":"Chaum, D., Ryan, P., Schneider, S.: A Practical Voter-Verifiable Election Scheme. In: de Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 118\u2013139. Springer, Heidelberg (2005)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","first-page":"103","volume-title":"EUROCRYPT 2006","author":"R. Cramer","year":"2006","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: EUROCRYPT 2006. LNCS, pp. 103\u2013118. Springer, Heidelberg (2006)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Cramton, P., Schwartz, J.: Collusive bidding in the fcc spectrum auctions. Technical Report 02collude, University of Maryland, Department of Economics (December 2002), http:\/\/ideas.repec.org\/p\/pcc\/pccumd\/02collude.html","DOI":"10.2202\/1538-0645.1078"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/276698.276853","volume-title":"30th ACM Symposium on Theory of Computing (STOC 1998)","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 409\u2013418. ACM, New York (1998)"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game. In: STOC 1987: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218\u2013229. ACM Press, New York (1987)"},{"issue":"3","key":"28_CR12","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but their Validity or all Languages in NP have Zero-Knowledge Proof Systems. J. ACM\u00a038(3), 690\u2013728 (1991)","journal-title":"J. ACM"},{"key":"28_CR13","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":"28_CR14","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/SFCS.2005.64","volume-title":"FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science","author":"S. Izmalkov","year":"2005","unstructured":"Izmalkov, S., Micali, S., Lepinski, M.: Rational Secure Computation and Ideal Mechanism Design. In: FOCS 2005: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 585\u2013595. IEEE Computer Society, Los Alamitos (2005)"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1145\/1060590.1060671","volume-title":"STOC 2005: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","author":"M. Lepinksi","year":"2005","unstructured":"Lepinksi, M., Micali, S., Shelat, A.: Collusion-Free Protocols. In: STOC 2005: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp. 543\u2013552. ACM, New York (2005)"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1011767.1011769","volume-title":"PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","author":"M. Lepinski","year":"2004","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely Fair SFE and Coalition-Safe Cheap Talk. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 1\u201310. ACM Press, New York (2004)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/3-540-39200-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Micciancio","year":"2003","unstructured":"Micciancio, D., Petrank, E.: Simulatable Commitments and Efficient Concurrent Zero-Knowledge. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 140\u2013159. Springer, Heidelberg (2003)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Neff, C.: A Verifiable Secret Shuffle and its Application to e-Voting. In: CCS 2001, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero-Knowledge with Logarithmic Round Complexity. In: 43th IEEE Symposium on Foundations of Computer Science (FOCS 2002), pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: The prisoners\u2019 problem and the subliminal channel. In: CRYPTO 1983, pp. 51\u201367 (1983)","DOI":"10.1007\/978-1-4684-4730-9_5"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:22:30Z","timestamp":1606184550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}