{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T11:02:10Z","timestamp":1790938930283,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_22","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"411-428","source":"Crossref","is-referenced-by-count":22,"title":["Universally Composable Incoercibility"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Unruh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"STOC 1988","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, pp. 1\u201310. ACM, New York (1988)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1145\/195058.195407","volume-title":"STOC 1994","author":"J. Benaloh","year":"1994","unstructured":"Benaloh, J., Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In: STOC 1994, pp. 544\u2013553. ACM, New York (1994)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-77493-8_10","volume-title":"E-Voting and Identity","author":"J.M. Bohli","year":"2007","unstructured":"Bohli, J.M., M\u00fcller-Quade, J., R\u00f6hrich, S.: Bingo voting: Secure and coercion-free voting using a trusted random number generator. In: Alkassar, A., Volkamer, M. (eds.) VOTE-ID 2007. LNCS, vol.\u00a04896, pp. 111\u2013124. Springer, Heidelberg (2007)"},{"key":"22_CR4","first-page":"504","volume-title":"FOCS 1996","author":"R. Canetti","year":"1996","unstructured":"Canetti, R., Gennaro, R.: Incoercible multiparty computation. In: FOCS 1996, p. 504. IEEE, Los Alamitos (1996)"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"3","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multi-party cryptographic protocols. Journal of Cryptology\u00a03(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"#cr-split#-22_CR6.1","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136???145. IEEE, Los Alamitos (2001);","DOI":"10.1109\/SFCS.2001.959888"},{"key":"#cr-split#-22_CR6.2","unstructured":"Full version is IACR ePrint 2000\/067"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 61\u201385. Springer, Heidelberg (2007)"},{"key":"22_CR8","first-page":"639","volume-title":"STOC 1995","author":"R. Canetti","year":"1995","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: STOC 1995, pp. 639\u2013648. ACM Press, New York (1995)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/509907.509980","volume-title":"STOC 2002","author":"R. Canetti","year":"2002","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC 2002, pp. 494\u2013503. ACM, New York (2002)"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/MSECP.2004.1264852","volume":"2","author":"D. Chaum","year":"2004","unstructured":"Chaum, D.: Secret-ballot receipts: True voter-verifiable elections. IEEE Security & Privacy\u00a02(1), 38\u201347 (2004)","journal-title":"IEEE Security & Privacy"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/62212.62214","volume-title":"STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: STOC 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"22_CR12","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.Y.A., Schneider, S.A.: A practical voter-verifiable election scheme. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 118\u2013139. Springer, Heidelberg (2005)"},{"issue":"4","key":"22_CR13","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2009-0340","volume":"17","author":"S. Delaune","year":"2009","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security\u00a017(4), 435\u2013487 (2009)","journal-title":"Journal of Computer Security"},{"key":"22_CR14","unstructured":"Forsyth, F.: The Deceiver. Bantam Books (1991), http:\/\/tinyurl.com\/ycvhuod"},{"key":"22_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography (Basic Applications)","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography (Basic Applications), vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"22_CR17","unstructured":"Herzberg, A.: Rumpsession. Crypto 1991 (1991)"},{"key":"22_CR18","unstructured":"Hofheinz, D., Unruh, D., M\u00fcller-Quade, J.: Universally composable zero-knowledge arguments and commitments from signature cards. In: Tatra. Mt. Math. Pub., pp. 93\u2013103 (2007)"},{"key":"22_CR19","first-page":"61","volume-title":"4nd ACM Workshop on Privacy in the Electronic Society (WPES)","author":"A. Juels","year":"2005","unstructured":"Juels, A., Catalano, D., Jakobsson, M.: Coercion-resistant electronic elections. In: 4nd ACM Workshop on Privacy in the Electronic Society (WPES), pp. 61\u201370. ACM Press, New York (2005)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/11818175_22","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"T. Moran","year":"2006","unstructured":"Moran, T., Naor, M.: Receipt-free universally-verifiable voting with everlasting privacy. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 373\u2013392. Springer, Heidelberg (2006)"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Unruh, D., M\u00fcller-Quade, J.: Universally composable incoercibility. IACR ePrint 2009\/520 (October 2009)","DOI":"10.1007\/978-3-642-14623-7_22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T01:24:46Z","timestamp":1740360286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}