{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T20:55:47Z","timestamp":1791492947787,"version":"4.3.4"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,4]]},"DOI":"10.1145\/1866307.1866366","type":"proceedings-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T10:38:23Z","timestamp":1286275103000},"page":"526-535","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":114,"title":["Accountability"],"prefix":"10.1145","author":[{"given":"Ralf","family":"K\u00fcsters","sequence":"first","affiliation":[{"name":"University of Trier, Trier, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomasz","family":"Truderung","sequence":"additional","affiliation":[{"name":"University of Trier, Trier, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Vogt","sequence":"additional","affiliation":[{"name":"University of Trier, Trier, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.002"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"e_1_3_2_1_3_1","first-page":"86","author":"Asokan N.","year":"1998","unstructured":"}} N. Asokan , V. Shoup , and M. Waidner . Asynchronous Protocols for Optimistic Fair Exchange. In S &P 1998 , p. 86 -- 99 , IEEE Computer Society. }}N. Asokan, V. Shoup, and M. Waidner. Asynchronous Protocols for Optimistic Fair Exchange. In S &P 1998, p. 86--99, IEEE Computer Society.","journal-title":"Asynchronous Protocols for Optimistic Fair Exchange. In S &P"},{"key":"e_1_3_2_1_4_1","series-title":"LNCS","volume-title":"TCC","author":"Aumann Y.","year":"2007","unstructured":"}} Y. Aumann and Y. Lindell . Security against Covert Adversaries: Efficient Protocols for Realistic Adversaries . In TCC 2007 , vol. 4392 of LNCS , p. 137--156. Springer . }}Y. Aumann and Y. Lindell. Security against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In TCC 2007, vol. 4392 of LNCS, p. 137--156. Springer."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151414.1151416"},{"key":"e_1_3_2_1_6_1","series-title":"LNCS","volume-title":"VOTE-ID","author":"Bohli J.-M.","year":"2007","unstructured":"}} J.-M. Bohli , J. M \u00fcller-Quade , and S. R \u00f6hrich. Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator . In VOTE-ID 2007 , vol. 4896 of LNCS , p. 111--124. Springer . }}J.-M. Bohli, J. M \u00fcller-Quade, and S. R \u00f6hrich. Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator. In VOTE-ID 2007, vol. 4896 of LNCS, p. 111--124. Springer."},{"key":"e_1_3_2_1_7_1","volume-title":"EVT","author":"Chaum D.","year":"2008","unstructured":"}} D. Chaum , R. Carback , J. Clark , A. Essex , S. Popoveniuc , R. L. Rivest , P. Ryan , E. Shen , and A. Sherman . Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes . In EVT 2008 , USENIX Association . }}D. Chaum, R. Carback, J. Clark, A. Essex, S. Popoveniuc, R. L. Rivest, P. Ryan, E. Shen, and A. Sherman. Scantegrity II: End-to-End Verifiability for Optical Scan Election Systems using Invisible Ink Confirmation Codes. In EVT 2008, USENIX Association."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11555827_8"},{"key":"e_1_3_2_1_9_1","volume-title":"On Some Incompatible Properties of Voting Schemes. In WOTE","author":"Chevallier-Mames B.","year":"2006","unstructured":"}} B. Chevallier-Mames , P.-A. Fouque , D. Pointcheval , J. Stern , and J. Traor \u00e9. On Some Incompatible Properties of Voting Schemes. In WOTE 2006 . }}B. Chevallier-Mames, P.-A. Fouque, D. Pointcheval, J. Stern, and J. Traor \u00e9. On Some Incompatible Properties of Voting Schemes. In WOTE 2006."},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Garay J.A.","year":"1999","unstructured":"}} J.A. Garay , M. Jakobsson , and P. MacKenzie . Abuse-free Optimistic Contract Signing . In CRYPTO 1999 , vol. 1666 of LNCS , p. 449--466, Springer . }}J.A. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free Optimistic Contract Signing. In CRYPTO 1999, vol. 1666 of LNCS, p. 449--466, Springer."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455824"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813084.1813099"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1813084.1813098"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.06.014"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102213"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315277"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151454.1151478"},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","volume-title":"CRYPTO","author":"Pedersen T.","year":"1991","unstructured":"}} T. Pedersen . Non-interactive and Information-theoretic Secure Verifiable Secret Sharing . In CRYPTO 1991 , vol. 576 of LNCS , p. 129--140, Springer . }}T. Pedersen. Non-interactive and Information-theoretic Secure Verifiable Secret Sharing. In CRYPTO 1991, vol. 576 of LNCS, p. 129--140, Springer."},{"key":"e_1_3_2_1_21_1","series-title":"LNCS","volume-title":"EUROCRYPT","author":"Sako K.","year":"1999","unstructured":"}} K. Sako and J. Kilian . Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth . In EUROCRYPT 1999 , vol. 921 of LNCS , p. 393--403, Springer . }}K. Sako and J. Kilian. Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth. In EUROCRYPT 1999, vol. 921 of LNCS, p. 393--403, Springer."},{"key":"e_1_3_2_1_22_1","volume-title":"WISSec","author":"Smyth B.","year":"2009","unstructured":"}} B. Smyth , M. Ryan , S. Kremer , and M. Kourjieh . Election Verifiability in Electronic Voting Protocols . In WISSec 2009 . }}B. Smyth, M. Ryan, S. Kremer, and M. Kourjieh. Election Verifiability in Electronic Voting Protocols. In WISSec 2009."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88625-9_27"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCEE.2008.24"},{"key":"e_1_3_2_1_25_1","volume-title":"S &P","author":"Zhou J.","year":"1996","unstructured":"}} J. Zhou and D. Gollmann . A Fair Non-repudiation Protocol . In S &P 1996 , p. 55--61, IEEE Computer Society Press . }}J. Zhou and D. Gollmann. A Fair Non-repudiation Protocol. In S &P 1996, p. 55--61, IEEE Computer Society Press."}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","location":"Chicago Illinois USA","acronym":"CCS '10","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 17th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866366","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866307.1866366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:59Z","timestamp":1750234139000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866307.1866366"}},"subtitle":["definition and relationship to verifiability"],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":24,"alternative-id":["10.1145\/1866307.1866366","10.1145\/1866307"],"URL":"https:\/\/doi.org\/10.1145\/1866307.1866366","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}