{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:45:31Z","timestamp":1725529531496},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642007293"},{"type":"electronic","value":"9783642007309"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00730-9_13","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T11:22:23Z","timestamp":1237288943000},"page":"202-217","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Vote Validity Check in Homomorphic Electronic Voting"],"prefix":"10.1007","author":[{"given":"Kun","family":"Peng","sequence":"first","affiliation":[]},{"given":"Feng","family":"Bao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44586-2_23","volume-title":"Public Key Cryptography","author":"M. Abe","year":"2001","unstructured":"Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 317\u2013324. Springer, Heidelberg (2001)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-540-24852-1_36","volume-title":"Applied Cryptography and Network Security","author":"R. Aditya","year":"2004","unstructured":"Aditya, R., Peng, K., Boyd, C., Dawson, E.: Batch Verification for Equality of Discrete Logarithms and Threshold Decryptions. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 494\u2013508. Springer, Heidelberg (2004)"},{"key":"13_CR3","unstructured":"Adler, J.M., Dai, W., Green, R.L., Neff, C.A.: Computational details of the votehere homomorphic election system. Technical report, VoteHere\u00a0Inc. (2000) (last accessed June 22, 2002), http:\/\/www.votehere.net\/technicaldocs\/hom.pdf"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Stern, J., Poupard, G.: Practical multi-candidate election system. In: Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 274\u2013283 (2001)","DOI":"10.1145\/383962.384044"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-44448-3_5","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"C. Boyd","year":"2000","unstructured":"Boyd, C., Pavlovski, C.: Attacking and repairing batch verification schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 58\u201371. Springer, Heidelberg (2000)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1093\/ietfec\/e91-a.1.150","volume":"E91CA","author":"K. Chida","year":"2008","unstructured":"Chida, K., Yamamoto, G.: Batch processing for proofs of partial knowledge and its applications. IEICE Trans. Fundamentals\u00a0E91CA(1), 150\u2013159 (2008)","journal-title":"IEICE Trans. Fundamentals"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/3-540-45439-X_28","volume-title":"Information Security","author":"K. Chida","year":"2001","unstructured":"Chida, K., Kobayashi, K., Morita, H.: Efficient sealed-bid auctions for massive numbers of bidders with lump comparison. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 408\u2013419. Springer, Heidelberg (2001)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"R. Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 174\u2013187. Springer, Heidelberg (1994)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damga\u00e5rd","year":"2001","unstructured":"Damga\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s001459900011","volume":"9","author":"M.J. Fischer","year":"1996","unstructured":"Fischer, M.J., Micali, S., Rackoff, C.: A secure protocol for the oblivious transfer (extended abstract). Journal of Cryptology\u00a09(3), 191\u2013195 (1996)","journal-title":"Journal of Cryptology"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P.-A. Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol.\u00a01962, pp. 90\u2013104. Springer, Heidelberg (2001)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/3-540-44647-8_22","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"J. Furukawa","year":"2001","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 368\u2013387. Springer, Heidelberg (2001)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-36178-2_28","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"P. Golle","year":"2002","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exit-polls. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 451\u2013465. Springer, Heidelberg (2002)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/11496137_32","volume-title":"Applied Cryptography and Network Security","author":"J. Groth","year":"2005","unstructured":"Groth, J.: Non-interactive zero-knowledge arguments for voting. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 467\u2013482. Springer, Heidelberg (2005)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-540-71677-8_25","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"J. Groth","year":"2007","unstructured":"Groth, J., Lu, S.: Verifiable shuffle of large size ciphertexts. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 377\u2013392. Springer, Heidelberg (2007)"},{"key":"13_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":"2003","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 (2003)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/0-387-34799-2_16","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"L.C. Guillou","year":"1990","unstructured":"Guillou, L.C., Quisquater, J.J.: A \u201cparadoxical\u201d identity-based signature scheme resulting from zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 216\u2013231. Springer, Heidelberg (1990)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-45539-6_38","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Hirt","year":"2000","unstructured":"Hirt, M., Sako, K.: Efficient receipt-free voting based on homomorphic encryption. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 539\u2013556. Springer, Heidelberg (2000)"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1093\/ietfec\/E88-A.1.172","volume":"88-A","author":"J. Furukawa","year":"2005","unstructured":"Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. IEICE Transactions\u00a088-A(1), 172\u2013188 (2005)","journal-title":"IEICE Transactions"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-44987-6_6","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"Katz, J., Myers, S., Ostrovsky, R.: Cryptographic counters and applications to electronic voting. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 78\u201392. Springer, Heidelberg (2001)"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-45664-3_10","volume-title":"Public Key Cryptography","author":"A. Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: Self-tallying elections and perfect ballot secrecy. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 141\u2013158. Springer, Heidelberg (2002)"},{"key":"13_CR23","unstructured":"Kikuchi, H., Harkavy, M., Tygar, J.D.: Multi-round anonymous auction. In: Proceedings of the First IEEE Workshop on Dependable and Real-Time E-Commerce Systems, pp. 62\u201369 (June 1998)"},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-46088-8_27","volume-title":"Financial Cryptography","author":"H. Kikuchi","year":"2002","unstructured":"Kikuchi, H.: (m+1)st-price auction protocol. In: Syverson, P.F. (ed.) FC 2001. LNCS, vol.\u00a02339, pp. 291\u2013298. Springer, Heidelberg (2002)"},{"key":"13_CR25","first-page":"307","volume-title":"Proc. of International Workshop on Next Generation Internet (NGITA 2000)","author":"H. Kikuchi","year":"2000","unstructured":"Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In: Proc. of International Workshop on Next Generation Internet (NGITA 2000), pp. 307\u2013312. IEEE, Los Alamitos (2000)"},{"key":"13_CR26","unstructured":"Lee, B., Kim, K.: Receipt-free electronic voting through collaboration of voter and honest verifier. In: JW-ISC 2000, pp. 101\u2013108 (2000)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-36552-4_27","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. Lee","year":"2003","unstructured":"Lee, B., Kim, K.: Receipt-free electronic voting scheme with a tamper-resistant randomizer. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 389\u2013406. Springer, Heidelberg (2003)"},{"key":"13_CR28","unstructured":"Andrew Neff, C.: Conducting a universally verifiable electronic election using homomorphic encryption. White paper, VoteHere\u00a0Inc. (2000)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Andrew Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security 2001, pp. 116\u2013125 (2001)","DOI":"10.1145\/501997.502000"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Andrew Neff, C.: Verifiable mixing (shuffling) of elgamal pairs (2004), http:\/\/theory.lcs.mit.edu\/~rivest\/voting\/papers\/Neff-2004-04-21-ElGamalShuffles.pdf","DOI":"10.2469\/cp.v2004.n3.3391"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public key cryptosystem based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"C. Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 248\u2013259. Springer, Heidelberg (1994)"},{"key":"13_CR33","unstructured":"Peng, K., Aditya, R., Boyd, C., Dawson, E., Lee, B.: A secure and efficient mix-network using extended binary mixing gate. In: Cryptographic Algorithms and their Uses 2004, pp. 57\u201371 (2004)"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C.: Batch zero knowledge proof and verification and its applications. ACM TISSEC\u00a010(2), Article No. 6 (May 2007)","DOI":"10.1145\/1237500.1237502"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","first-page":"188","volume-title":"Applied Cryptography and Network Security","author":"K. Peng","year":"2004","unstructured":"Peng, K., Boyd, C., Dawson, E.: Simple and efficient shuffling with provable correctness and ZK privacy. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 188\u2013204. Springer, Heidelberg (2004)"},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"2798","DOI":"10.1016\/j.comcom.2005.10.031","volume":"29","author":"K. Peng","year":"2006","unstructured":"Peng, K., Boyd, C., Dawson, E.: Batch verification of validity of bids in homomorphic e-auction. Computer Communications\u00a029, 2798\u20132805 (2006)","journal-title":"Computer Communications"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-30556-9_6","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"K. Peng","year":"2004","unstructured":"Peng, K., Boyd, C., Dawson, E., Lee, B.: Multiplicative homomorphic e-voting. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol.\u00a03348, pp. 61\u201372. Springer, Heidelberg (2004)"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-24632-9_32","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"K. Peng","year":"2004","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: A correct, private and efficient mix network. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 439\u2013454. Springer, Heidelberg (2004)"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-72163-5_17","volume-title":"Information Security Practice and Experience","author":"K. Peng","year":"2007","unstructured":"Peng, K., Dawson, E.: Efficient bid validity check in elgamal-based sealed-bid e-auction. In: Dawson, E., Wong, D.S. (eds.) ISPEC 2007. LNCS, vol.\u00a04464, pp. 209\u2013224. Springer, Heidelberg (2007)"},{"key":"13_CR40","unstructured":"Schoenmakers, B.: Fully auditable electronic secret-ballot elections. XOOTIC Magazine (July 2000)"},{"key":"13_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11593447_15","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"D. Wikstrom","year":"2005","unstructured":"Wikstrom, D.: A sender verifiable mix-net and a new proof of a shuffle. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 273\u2013292. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2013 ICISC 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00730-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T21:28:04Z","timestamp":1558214884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00730-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642007293","9783642007309"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00730-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}