{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:37:22Z","timestamp":1756636642289,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434009"},{"type":"electronic","value":"9783540459958"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_37","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"415-429","source":"Crossref","is-referenced-by-count":9,"title":["Electronic Jury Voting Protocols"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"Hevia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos","family":"Kiwi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"37_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BFb0054144","volume-title":"Universally verifiable MIX-net with verification work independent of the number of MIX-servers","author":"M. Abe","year":"1998","unstructured":"M. Abe. Universally verifiable MIX-net with verification work independent of the number of MIX-servers. Proc. of EuroCrypt\u201998, 437\u2013447. Springer-Verlag. LNCS Vol. 1403."},{"key":"37_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Mix-Networks on Permutation Networks","author":"M. Abe","year":"1999","unstructured":"M. Abe. Mix-Networks on Permutation Networks. Proc. of Asiacrypt\u201999, 258\u2013273. Springer-Verlag. LNCS Vol. 1716."},{"key":"37_CR3","unstructured":"J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Dept. of Computer Science, Sep. 1987."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proc. of STOC\u201988, 1\u201310, ACM.","DOI":"10.1145\/62212.62213"},{"key":"37_CR5","series-title":"Lect Notes Comput Sci","first-page":"617","volume-title":"A new multiple key cipher and an improved voting scheme","author":"C. Boyd","year":"1989","unstructured":"C. Boyd. A new multiple key cipher and an improved voting scheme. Proc. of EuroCrypt\u201989, 617\u2013625. Springer-Verlag. LNCS Vol. 434."},{"issue":"1","key":"37_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00342-5","volume":"111","author":"F. Boudot","year":"2001","unstructured":"F. Boudot, B. Schoenmakers and J. Traore. A fair and efficient solution to the socialist millionaires\u2019 problem. Discrete Applied Mathematics, 111(1\u20132):23\u201336, 2001.","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. Proc. of STOC\u201994, 544\u2013553, ACM.","DOI":"10.1145\/195058.195407"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. Proc. of PODC\u201986, 52\u201362. ACM.","DOI":"10.1145\/10590.10595"},{"key":"37_CR9","series-title":"Lect Notes Comput Sci","first-page":"462","volume-title":"Multiparty unconditionally secure protocols","author":"D. Chaum","year":"1987","unstructured":"D. Chaum, C. Cr\u00e9peau and I. B. Damg\u00e5rd. Multiparty unconditionally secure protocols. Proc. of Crypto\u201987, 462\u2013462. Springer-Verlag. LNCS Vol. 293."},{"key":"37_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Proofs of partial knowledge simplified design of witness","author":"R. Cramer","year":"1994","unstructured":"R. Cramer, I. Damg\u00e5rd and B. Schoenmakers. Proofs of partial knowledge simplified design of witness. Proc. of Crypto\u201994, 174\u2013187. Springer-Verlag. LNCS Vol. 839."},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"J. D. Cohen and M. J. Fischer. A robust and verifiable cryptographically secure election scheme. Proc. of FOCS\u201985, 372\u2013382, IEEE.","DOI":"10.1109\/SFCS.1985.2"},{"key":"37_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-68339-9_7","volume-title":"Multiauthority secret-ballot elections with linear work","author":"R. Cramer","year":"1996","unstructured":"R. Cramer, M. K. Franklin, B. Schoenmakers and M. Yung. Multiauthority secret-ballot elections with linear work. Proc. of EuroCrypt\u201996, 72\u201383. Springer-Verlag. LNCS Vol. 1070."},{"key":"37_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"A secure and optimally efficient multi-authority election scheme","author":"R. Cramer","year":"1997","unstructured":"R. Cramer, R. Gennaro and B. Schoenmakers. A secure and optimally efficient multi-authority election scheme. Proc. of EuroCrypt\u201997, 103\u2013118. Springer-Verlag. LNCS Vol. 1233."},{"key":"37_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-48910-X_7","volume-title":"An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack","author":"R. Canetti","year":"1999","unstructured":"R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. Proc. of EuroCrypt\u2019 99, 90\u2013106. Springer-Verlag. LNCS Vol. 1592."},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. L. Chaum","year":"1981","unstructured":"D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84\u201388, 1981. ACM.","journal-title":"Communications of the ACM"},{"key":"37_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-45961-8_15","volume-title":"Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA","author":"D. Chaum","year":"1988","unstructured":"D. Chaum. Elections with unconditionally-secret ballots and disruption equivalent to breaking RSA. Proc. of EuroCrypt\u201988, 177\u2013182. Springer-Verlag. LNCS Vol. 330."},{"key":"37_CR17","series-title":"Lect Notes Comput Sci","first-page":"89","volume-title":"Wallet databases with observers","author":"D. Chaum","year":"1992","unstructured":"D. Chaum and T. P. Pedersen. Wallet databases with observers. Proc. of Crypto\u201992, 89\u2013105. Springer-Verlag. LNCS Vol. 740."},{"key":"37_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"How to break a practical MIX and design a new one","author":"Y. Desmedt","year":"2000","unstructured":"Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. Proc. of EuroCrypt\u201900, 557\u2013572. Springer-Verlag. LNCS Vol. 1807."},{"issue":"4","key":"37_CR19","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions of Information Theory, IT-31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions of Information Theory"},{"key":"37_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"An efficient scheme for proving a shuffle","author":"J. Furukawa","year":"2001","unstructured":"J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. Proc. of Crypto\u201901, 368\u2013387. Springer-Verlag. LNCS Vol. 2139."},{"key":"37_CR21","unstructured":"R. Gennaro. Manuscript, 1995."},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"R. Gennaro. Achieving independence efficiently and securely. Proc. of PODC\u201995, 130\u2013136, ACM.","DOI":"10.1145\/224964.224979"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key bgeneration for discrete-log based cryptosystems. Proc. of EuroCrypt\u201999, 295\u2013310. Springer-Verlag. LNCS Vol. 1592.","DOI":"10.1007\/3-540-48910-X_21"},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. Proc. of FOCS\u201986 174\u2013187, IEEE.","DOI":"10.1109\/SFCS.1986.47"},{"key":"37_CR25","unstructured":"A. Hevia and M. Kiwi. Electronic Jury Voting Protocols. Cryptology ePrint Archive, Report 2000\/035, Jul. 2000."},{"key":"37_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Efficient receipt-free voting based on homomorphic encryption","author":"M. Hirt","year":"2000","unstructured":"M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. Proc. of EuroCrypt\u201900, 539\u2013556. Springer-Verlag. LNCS Vol. 1807."},{"key":"37_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/BFb0054145","volume-title":"A practical mix","author":"M. Jakobsson","year":"1998","unstructured":"M. Jakobsson. A practical mix. Proc. of EuroCrypt\u201998, 448\u2013461. Springer-Verlag. LNCS Vol. 1403."},{"key":"37_CR28","unstructured":"M. Jakobsson and A. Juels. Millimix: Mixing in small batches. Technical Report 99-33, DIMACS, 1999."},{"key":"37_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-44448-3_13","volume-title":"Mix and match: Secure function evaluation via ciphertexts","author":"M. Jakobsson","year":"2000","unstructured":"M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. Proc. of Asiacrypt\u201900, 162\u2013178. Springer-Verlag. LNCS Vol. 1976."},{"key":"37_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-44448-3_15","volume-title":"Attack for flash MIX","author":"M. Mitomo","year":"2000","unstructured":"M. Mitomo and K. Kurosawa. Attack for flash MIX. Proc. of Asiacrypt\u2019 00, 192\u2013204. Springer-Verlag. LNCS Vol. 1976."},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"C. A. Neff. A verifiable secret shuffle and its application to e-voting. Proc. of CCS\u201901. ACM.","DOI":"10.1145\/501983.502000"},{"key":"37_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-44448-3_14","volume-title":"A length-invariant hybrid mix","author":"M. Ohkubo","year":"2000","unstructured":"M. Ohkubo and M. Abe. A length-invariant hybrid mix. Proc. of Asiacrypt\u2019 00, 178\u2013191. Springer-Verlag. LNCS Vol. 1976."},{"key":"37_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/3-540-46416-6_20","volume-title":"EuroCrypt\u201991","author":"T. P. Pedersen","year":"1991","unstructured":"T. P. Pedersen. Distributed provers with applications to undeniable signatures. In EuroCrypt\u201991, 221\u2013242. Springer-Verlag. LNCS Vol. 547."},{"key":"37_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BFb0053448","volume-title":"Breaking an efficient anonymous channel","author":"B. Pfitzmann","year":"1995","unstructured":"B. Pfitzmann. Breaking an efficient anonymous channel. Proc. of Euro-Crypt\u201994, 332\u2013340. Springer-Verlag. LNCS Vol. 950."},{"key":"37_CR35","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Efficient anonymous channel and all\/nothing election scheme","author":"C. Park","year":"1994","unstructured":"C. Park, K. Itoh and K. Kurosawa. Efficient anonymous channel and all\/nothing election scheme. Proc. of EuroCrypt\u201993, 248\u2013259. Springer-Verlag. LNCS Vol. 765."},{"key":"37_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"A simple publicly verifiable secret sharing scheme and its application to electronic voting","author":"B. Schoenmakers","year":"1999","unstructured":"B. Schoenmakers. A simple publicly verifiable secret sharing scheme and its application to electronic voting. Proc. of Crypto\u201999, 148\u2013164. Springer-Verlag. LNCS Vol. 1666."},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"P. Syverson, D. Goldschlag and M. Reed. Anonymous connections and onion routing. Proc. of IEEE Symposium on Security and Privacy, 44\u201354, IEEE, 1997.","DOI":"10.1109\/SECPRI.1997.601314"},{"key":"37_CR38","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/3-540-48658-5_37","volume-title":"Secure voting using partially compatible homomorphisms","author":"K. Sako","year":"1994","unstructured":"K. Sako and J. Kilian. Secure voting using partially compatible homomorphisms. Proc. of Crypto\u201994, 411\u2013424. Springer-Verlag. LNCS Vol. 839."},{"key":"37_CR39","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/3-540-49264-X_32","volume-title":"Receipt-free mix-type voting scheme-A practical solution to the implementation of a voting booth","author":"K. Sako","year":"1995","unstructured":"K. Sako and J. Kilian. Receipt-free mix-type voting scheme-A practical solution to the implementation of a voting booth. Proc. of EuroCrypt\u201995, 393\u2013403. Springer-Verlag. LNCS Vol. 921."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T19:25:59Z","timestamp":1737055559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}