{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:08:38Z","timestamp":1767704918607,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540640400"},{"type":"electronic","value":"9783540696889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028157","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:50:22Z","timestamp":1132642222000},"page":"25-35","source":"Crossref","is-referenced-by-count":91,"title":["Receipt-free electronic voting schemes for large scale elections"],"prefix":"10.1007","author":[{"given":"Tatsuaki","family":"Okamoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation\u201d, Proc. of STOC'88, pp.1\u201310 (1988).","DOI":"10.1145\/62212.62213"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tuinstra, \u201cReceipt-Free Secret-Ballot Elections\u201d, Proc. of STOC'94, pp.544\u2013553 (1994).","DOI":"10.1145\/195058.195407"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung, \u201cDistributing the Power of a Government to Enhance the Privacy of Votes\u201d, Proc. of PODC'86, pp.52\u201362 (1986).","DOI":"10.1145\/10590.10595"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"D. Chaum, \u201cUntraceable Electronic Mail, Return Addresses, and Digital Pseudonyms\u201d, Communications of the ACM, Vol. 24, No. 2, pp. 84\u201388 (1981).","journal-title":"Communications of the ACM"},{"issue":"10","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1145\/4372.4373","volume":"28","author":"D. Chaum","year":"1985","unstructured":"D. Chaum, \u201cSecurity without Identification: Transaction systems to Make Big Brother Obsolete\u201d, Communications of the ACM, Vol.28, No.10, pp.1030\u20131044 (1985).","journal-title":"Communications of the ACM"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"D. Chaum, \u201cElections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA\u201d, Proceedings of Eurocrypt'88, LNCS 330, Springer-Verlag, pp.177\u2013182 (1988).","DOI":"10.1007\/3-540-45961-8_15"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"D. Chaum, C. Cr\u00e9peau, and 1. Damg\u00e5rd, \u201cMultiparty Unconditionally Secure Protocols\u201d, Proc. of STOC'88, pp.11\u201319 (1988).","DOI":"10.1145\/62212.62214"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"J. Cohen and M. Fisher, \u201cA Robust and Verifiable Cryptographically Secure Election Scheme\u201d, Proc. of FOCS, pp.372\u2013382 (1985).","DOI":"10.1109\/SFCS.1985.2"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"R. Cramer, M. Franklin, B. Schoenmakers, and M. Yung, \u201cMulti-Authority Secret-Ballot Elections with Linear Work\u201d, Proc. of Eurocrypt'96, LNCS 1070, Springer-Verlag, pp.72\u201382 (1996).","DOI":"10.1007\/3-540-68339-9_7"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"P. Feldman, \u201cA Practical Scheme for Non-interactive Verifiable Secret Sharing\u201d, Proc. of FOCS, pp. 427\u2013437 (1987).","DOI":"10.1109\/SFCS.1987.4"},{"issue":"2","key":"3_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A. and Shamir, A.: Zero-Knowledge Proofs of Identity, Journal of CRYPTOLOGY, Vol. 1, Number 2 pp.77\u201394 (1988)","journal-title":"Journal of CRYPTOLOGY"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"A. Fujioka, T. Okamoto, and K. Ohta, \u201cA Practical Secret Voting Scheme for Large Scale Elections\u201d, Proc. of Auscrypt '92, LNCS, Springer-Verlag, pp. 244\u2013251 (1992).","DOI":"10.1007\/3-540-57220-1_66"},{"key":"3_CR13","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, Proc. of STOC, pp.218\u2013229 (1987).","DOI":"10.1145\/28395.28420"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"K. R. Iversen, \u201cA Cryptographic Scheme for Computerized General Elections\u201d, Proc. of Crypto'91, LNCS 576, Springer-Verlag, pp.405\u2013419 (1992).","DOI":"10.1007\/3-540-46766-1_33"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"M. Jakobsson, K. Sako, and R. Impagliazzo, \u201cDesignated Verifier Proofs and Their Applications\u201d, Proc. of Eurocrypt '96, LNCS 1070, Springer-Verlag, pp.143\u2013154 (1996).","DOI":"10.1007\/3-540-68339-9_13"},{"key":"3_CR16","unstructured":"M. Michels, \u201cComments on a receipt-free voting scheme\u201d, manuscript (Jan. 1997)."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"T. Okamoto, \u201cAn Electronic Voting Scheme\u201d, Proc. of IFIP'96, Advanced IT Tools, Chapman & Hall, pp.21\u201330 (1996).","DOI":"10.1007\/978-0-387-34979-4_3"},{"key":"3_CR18","unstructured":"Tompa, M. and Woll, H.: Random SelfReducibility and Zero Knowledge Interactive Proofs of Possession of Information, Proc. of FOCS'87, pp.472\u2013482 (1987)."},{"key":"3_CR19","unstructured":"Pedersen, T. P., \u201cDistributed Provers with Applications to Undeniable Signatures\u201d, Proceedings of Eurocrypt 91 (1992)."},{"key":"3_CR20","first-page":"129","volume":"91","author":"T. P. Pedersen","year":"1992","unstructured":"Pedersen, T. P., \u201cNon-Interactive and Information-Theoretic Secure Verifiable Secret Sharing\u201d, Proceedings of Crypto 91, pp. 129\u2013140 (1992).","journal-title":"Proceedings of Crypto"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P., \u201cEfficient Signature Generation by Smart Cards\u201d, Journal of Cryptology, Vol. 4, No. 3, pp.161\u2013174 (1991).","journal-title":"Journal of Cryptology"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"K. Sako, and J. Kilian, \u201cSecure Voting Using Partially Compatible Homomorphisms\u201d, Proc. of Crypto'94, LNCS 839, Springer-Verlag, pp.411\u2013424 (1994)","DOI":"10.1007\/3-540-48658-5_37"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"K. Salvo, and J. Kilian, \u201cReceipt-Free Mix-type Voting Scheme\u201d, Proc. of Eurocrypt'95, LNCS 921, Springer-Verlag, pp393\u2013403 (1995)","DOI":"10.1007\/3-540-49264-X_32"}],"container-title":["Lecture Notes in Computer Science","Security Protocols"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:48:49Z","timestamp":1586573329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540640400","9783540696889"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0028157","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}