{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T05:53:32Z","timestamp":1791352412987,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262237","type":"print"},{"value":"9783540315421","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11496137_32","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T15:14:24Z","timestamp":1285427664000},"page":"467-482","source":"Crossref","is-referenced-by-count":96,"title":["Non-interactive Zero-Knowledge Arguments for Voting"],"prefix":"10.1007","author":[{"given":"Jens","family":"Groth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Benaloh, J.C.: Verifiable secret ballot elections. Technical Report 561, Yale University, PhD thesis. x+123 pp. (1987)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G.: a. Stern. Practical multi-candidate election scheme. In: Proceedings of PODC 2001, pp. 274\u2013283 (2001)","DOI":"10.1145\/383962.384044"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 431. Springer, Heidelberg (2000)"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM CCS 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Benaloh, J.C., Yung, M.: Distributing the power of a government to enhance the privacy of voters. In: proceedings of PODC 1986, pp. 52\u201362 (1986)","DOI":"10.1145\/10590.10595"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, J.D., Fischer, M.J.: A robust and verifiable cryptographically secure election scheme. In: proceedings of FOCS 1985, pp. 372\u2013382 (1985)","DOI":"10.1109\/SFCS.1985.2"},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"I.B. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I.B., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 125\u2013142. Springer, Heidelberg (2002)"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4615-0239-5_6","volume-title":"Secure Electronic Voting","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Groth, J., Salomonsen, G.: The theory and implementation of an electronic voting system. In: Gritzalis, D. (ed.) Secure Electronic Voting, pp. 77\u2013100. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.J.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992. Springer, Heidelberg (2001)"},{"key":"32_CR12","unstructured":"Damg\u00e5rd, I., Jurik, M.J., Nielsen, J.B.: A generalization of paillier\u2019s public-key system with applications to electronic voting (2003) (manuscript), \n                  \n                    http:\/\/www.brics.dk\/~ivan\/GenPaillierfinaljour.ps"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"E. Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 16\u201330. Springer, Heidelberg (1997)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Furukawa, J.: Efficient, verifiable shuffle decryption and its requirement of unlinkability. Manuscript, Full version of [Fur04b] (2004)","DOI":"10.1007\/978-3-540-24632-9_23"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-24632-9_23","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"J. Furukawa","year":"2004","unstructured":"Furukawa, J.: Efficient, verifiable shuffle decryption and its requirement of unlinkability. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 319\u2013332. Springer, Heidelberg (2004)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-36288-6_11","volume-title":"Public Key Cryptography - PKC 2003","author":"J. Groth","year":"2002","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 145\u2013160. Springer, Heidelberg (2002)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-30576-7_4","volume-title":"Theory of Cryptography","author":"J. Groth","year":"2005","unstructured":"Groth, J.: Cryptography in subgroups of formula_image. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 50\u201365. Springer, Heidelberg (2005)"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/10958513_11","volume-title":"Information Security","author":"N. Ishida","year":"2003","unstructured":"Ishida, N., Matsuo, S., Ogata, W.: Divisible voting scheme. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol.\u00a02851, pp. 137\u2013150. Springer, Heidelberg (2003)"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-36504-4_7","volume-title":"Financial Cryptography","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 87\u2013101. Springer, Heidelberg (2003)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-540-40061-5_26","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"H. Lipmaa","year":"2003","unstructured":"Lipmaa, H.: On diophantine complexity and statistical zero-knowledge arguments. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 398\u2013415. Springer, Heidelberg (2003)"},{"key":"32_CR22","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013239. Springer, Heidelberg (1999)"},{"issue":"suppl.","key":"32_CR23","first-page":"S240","volume":"39","author":"M. Rabin","year":"1986","unstructured":"Rabin, M., Shallit, J.: Randomized algorithms in number theory. Commun. Pure and Appl. Math. 39(suppl.), S240\u2013S256 (1986)","journal-title":"Commun. Pure and Appl. Math."},{"key":"32_CR24","unstructured":"Wang, C.: Personal communication (2005)"},{"key":"32_CR25","unstructured":"Wang, C., Leung, H.F.: A secure and fully private borda voting protocol with universal verifiability. In: Proceedings of COMPSAC 2004, pp. 224\u2013229 (2004)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496137_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:42:06Z","timestamp":1558291326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496137_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262237","9783540315421"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11496137_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}