{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T00:26:16Z","timestamp":1753921576293,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540414049"},{"type":"electronic","value":"9783540444480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44448-3_28","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:22:44Z","timestamp":1181362964000},"page":"373-387","source":"Crossref","is-referenced-by-count":3,"title":["Commital Deniable Proofs and Electronic Campaign Finance"],"prefix":"10.1007","author":[{"given":"Matt","family":"Franklin","sequence":"first","affiliation":[]},{"given":"Tomas","family":"Sander","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,10,27]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"I. Ayres and J. Bulow, \u201cThe donation booth: Mandating donor anonymity to disrupt the market for political influence\u201d, Stanford Law Review 50(3), 1998.","DOI":"10.2307\/1229325"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver, \u201cPlug and play encryption\u201d, Crypto\u2019 97, pp. 75\u201389.","DOI":"10.1007\/BFb0052228"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"J. Benaloh and J. Leichter, \u201cGeneralized secret sharing and monotone functions\u201d, Crypto\u2019 88, pp. 27\u201335.","DOI":"10.1007\/0-387-34799-2_3"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tuinstra,\u201cReceipt-free secret-ballot elections\u201d, ACM Symposium on the Theory of Computing, 1994, pp. 544\u2013552.","DOI":"10.1145\/195058.195407"},{"key":"28_CR5","unstructured":"J. Benaloh and D. Tuinstra,\u201cIncoercible communication\u201d, Clarkson University Department of Mathematics and Computer Science Technical Report number TR-MCS-94-1. Feb. 94."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung, \u201cDistributing the power of a government to enhance the privacy of voters\u201d, ACM Symposium on Principles of Distributed Computing, 1985.","DOI":"10.1145\/10590.10595"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, \u201cDeniable encryption\u201d, Crypto\u2019 97, pp. 90\u2013104.","DOI":"10.1007\/BFb0052229"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"R. Canetti, U. Feige, O. Goldreich, and M. Naor, \u201cAdaptively secure computation\u201d, ACM Symposium on the Theory of Computing, 1996.","DOI":"10.1145\/237814.238015"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"R. Canetti and R. Gennaro, \u201cIncoercible multiparty computation\u201d, IEEE Foundations of Computer Science, 1996.","DOI":"10.1109\/SFCS.1996.548509"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"R. Canetti and R. Ostrovsky,\u201cSecure computation with honest-looking parties: What if nobody is truly honest?\u201d, ACM Symposium on the Theory of Computing, 1999.","DOI":"10.1145\/301250.301313"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"D. Chaum, \u201cBlind signatures for untraceable payments\u201d, Crypto\u201982, pp. 199\u2013203.","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"R. Cramer and I. Damgard, \u201cLinear zero-knowledge-A note on efficient zeroknowledge proofs and arguments\u201d, ACM Symposium on the Theory of Computing, 1997, 436\u2013445.","DOI":"10.1145\/258533.258635"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"R. Cramer, I. Damgard, B. Schoenmakers, \u201cProofs of partial knowledge and simplified design of witness hiding protocols\u201d, Crypto\u2019 94, pp. 174\u2013187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"28_CR14","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, ACM Symposium on Theory of Computing, 1987, 218\u2013229.","DOI":"10.1145\/28395.28420"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"M. Hirt and K. Sako, \u201cEfficient receipt-free voting based on homomorphic encryption\u201d, Eurocrypt 2000, pp.539\u2013556.","DOI":"10.1007\/3-540-45539-6_38"},{"key":"28_CR16","unstructured":"V. Niemi and A. Renvall, \u201cHow to prevent buying of votes in computer elections\u201d, Asiacrypt\u201994, pp. 141\u2013148."},{"key":"28_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BFb0028157","volume-title":"Receipt-free electronic voting schemes for large scale elections","author":"T. Okamoto","year":"1998","unstructured":"T. Okamoto, \u201cReceipt-free electronic voting schemes for large scale elections\u201d, Security Protocol Workshop\u2019 97, LNCS, pp. 25\u201335."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"K. Sako and J. Kilian, \u201cReceipt-free mix-type voting schemes\u201d, Eurocrypt\u2019 95, pp. 393\u2013403.","DOI":"10.1007\/3-540-49264-X_32"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44448-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:16:46Z","timestamp":1737087406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44448-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540414049","9783540444480"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44448-3_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}