{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:51:54Z","timestamp":1774716714765,"version":"3.50.1"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,4]],"date-time":"2010-11-04T00:00:00Z","timestamp":1288828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10207-010-0122-1","type":"journal-article","created":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T07:43:26Z","timestamp":1288770206000},"page":"49-60","source":"Crossref","is-referenced-by-count":11,"title":["A general and efficient countermeasure to relation attacks in mix-based e-voting"],"prefix":"10.1007","volume":"10","author":[{"given":"Kun","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,4]]},"reference":[{"key":"122_CR1","doi-asserted-by":"crossref","unstructured":"Abe, M.: Mix-networks on permutation networks. In: ASIACRYPT \u201998 of Lecture Notes in Computer Science, vol. 1716, pp. 258\u2013273. Berlin, Springer-Verlag (1999)","DOI":"10.1007\/978-3-540-48000-6_21"},{"key":"122_CR2","doi-asserted-by":"crossref","unstructured":"Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: Public Key Cryptography 2001 of Lecture Notes in Computer Science, vol. 1992, pp. 317\u2013324. Berlin, Springer-Verlag (2001)","DOI":"10.1007\/3-540-44586-2_23"},{"key":"122_CR3","doi-asserted-by":"crossref","unstructured":"Abe, M., Imai, H.: Flaws in some robust optimistic mix-nets. In: ACISP 2003 of Lecture Notes in Computer Science, vol. 2727, pp. 39\u201350. Berlin, Springer (2003)","DOI":"10.1007\/3-540-45067-X_4"},{"key":"122_CR4","doi-asserted-by":"crossref","unstructured":"Abe, M., Imai, H.: Flaws in robust optimistic mix-nets and stronger security notions. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A(1), pp. 99\u2013105 (2006)","DOI":"10.1093\/ietfec\/e89-a.1.99"},{"key":"122_CR5","doi-asserted-by":"crossref","unstructured":"Adida, B., Wikstrom, D.: How to shuffle in public. In: Theory of Cryptography 2007 of Lecture Notes in Computer Science, vol. 4392, pp. 555\u2013574. Berlin, Springer-Verlag (2007)","DOI":"10.1007\/978-3-540-70936-7_30"},{"key":"122_CR6","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P.-A., Pointcheval, D., Poupard, G., Stern, J.: Practical multi-candidate election system. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 274\u2013283. Newport, Rhode Island, USA (2001)","DOI":"10.1145\/383962.384044"},{"key":"122_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Crypto \u201997 of Lecture Notes in Computer Science, vol. 1233, pp. 425\u2013439. Berlin, Springer-Verlag (2004)","DOI":"10.1007\/BFb0052253"},{"key":"122_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Golle, P.: Almost entirely correct mixing with applications to voting. In: Proceedings of the 9th ACM conference on Computer and communications security, pp. 68\u201377 (2002)","DOI":"10.1145\/586110.586121"},{"key":"122_CR9","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: TCC \u201905 of Lecture Notes in Computer Science, vol. 3378, pp. 325\u2013341. Berlin, Springer-Verlag (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"122_CR10","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Mityagin, A.: A formal treatment of onion routing. In: CRYPTO \u201905 of Lecture Notes in Computer Science, vol. 3089, pp. 169\u2013187. Berlin, Springer-Verlag (2005)","DOI":"10.1007\/11535218_11"},{"issue":"2","key":"122_CR11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum D.: Untraceable electronic mail, return address and digital pseudonym. Commun ACM 24(2), 84\u201388 (1981)","journal-title":"Commun ACM"},{"key":"122_CR12","doi-asserted-by":"crossref","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: CRYPTO \u201992 of Lecture Notes in Computer Science, vol. 740, pp. 89\u2013105. Berlin, Springer-Verlag (1992)","DOI":"10.1007\/3-540-48071-4_7"},{"key":"122_CR13","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. PKC \u201901, pp. 119\u2013136 (1992)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"122_CR14","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. EUROCRYPT \u2019012045:152\u2013165","DOI":"10.1007\/3-540-44987-6_10"},{"key":"122_CR15","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Kurosawa, K.: How to break a practical mix and design a new one. In: EUROCRYPT \u201900 of Lecture Notes in Computer Science, vol. 1807, pp. 557\u2013572. Berlin, Springer-Verlag (2005)","DOI":"10.1007\/3-540-45539-6_39"},{"key":"122_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"122_CR17","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO \u201986 of Lecture Notes in Computer Science, vol. 263, pp. 186\u2013194. Berlin, Springer-Verlag (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"122_CR18","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Financial Cryptography 2000, Lecture Notes in Computer Science, vol. 1962, pp. 90\u2013104. Berlin, Springer-Verlag (2000)","DOI":"10.1007\/3-540-45472-1_7"},{"key":"122_CR19","doi-asserted-by":"crossref","unstructured":"Furukawa, J.: Efficient and verifiable shuffling and shuffle-decryption. In: IEICE Transactions 88-A(1): pp. 172\u2013188 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.172"},{"key":"122_CR20","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: CRYPTO \u201901 of Lecture Notes in Computer Science, vol. 2139, pp. 368\u2013387. Berlin, Springer (2001)","DOI":"10.1007\/3-540-44647-8_22"},{"key":"122_CR21","doi-asserted-by":"crossref","unstructured":"Gennaro, V., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: EUROCRYPT \u201999, Lecture Notes in Computer Science 1592\u00a0pp. 123\u2013139. Berlin, Springer-Verlag (1999)","DOI":"10.1007\/3-540-48910-X_21"},{"key":"122_CR22","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. In: Journal of Computer Security, 28(2) pp. 270\u2013299 (1984)","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"122_CR23","doi-asserted-by":"crossref","unstructured":"Golle, P., Zhong, S., Boneh, D., Jakobsson, M., Juels, A.: Optimistic mixing for exit-polls. In: ASIACRYPT \u201902 of Lecture Notes in Computer Science, vol. 1592, pp. 451\u2013465. Berlin, Springer-Verlag 2002","DOI":"10.1007\/3-540-36178-2_28"},{"key":"122_CR24","doi-asserted-by":"crossref","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: Public Key Cryptography 2003 of Lecture Notes in Computer Science, vol. 2567, pp. 145\u2013160. Berlin, Springer-Verlag (2003)","DOI":"10.1007\/3-540-36288-6_11"},{"key":"122_CR25","doi-asserted-by":"crossref","unstructured":"Horster, P., Michels, M.: Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In: ASIACRYPT \u201996 of Lecture Notes in Computer Science, vol. 1163, pp. 125\u2013132. Berlin, Springer (1996)","DOI":"10.1007\/BFb0034841"},{"key":"122_CR26","doi-asserted-by":"crossref","unstructured":"Jakobsson, M: Flash mixing. In: PODC \u201998, pp. 83\u201389 (1998)","DOI":"10.1145\/301308.301333"},{"key":"122_CR27","doi-asserted-by":"crossref","unstructured":"Jakobsson, M.: A practical mix. In: EUROCRYPT \u201998 of Lecture Notes in Computer Science, vol. 1403, pp. 448\u2013461. Berlin, Springer-Verlag (1998)","DOI":"10.1007\/BFb0054145"},{"key":"122_CR28","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: An optimally robust hybrid mix network. In: PODC \u201901, pp. 284\u2013292 (2001)","DOI":"10.1145\/383962.384046"},{"key":"122_CR29","unstructured":"Jakobsson, M., Juels, A., Rivest, L.R.: Making mix nets robust for electronic voting by randomized partial checking. In: Proceedings of the 11th USENIX Security Symposium 2002, pp. 339\u2013353. USENIX (2002)"},{"key":"122_CR30","doi-asserted-by":"crossref","unstructured":"Juels, A., Jakobsson, M.: An optimally robust hybrid mix network. In: Proceedings of the 20th annual ACM Symposium on Principles of Distributed Computation, pp. 284\u2013292. ACM (2001)","DOI":"10.1145\/383962.384046"},{"key":"122_CR31","unstructured":"Lee, B., Kim, K.: Receipt-free electronic voting through collaboration of voter and honest verifier. 2000. Available as. http:\/\/caislab.icu.ac.kr\/paper\/2000\/sultan\/jwisc2k_bclee.ps"},{"key":"122_CR32","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Frankel, Y., Yung, M.: Robust efficient distributed RSA-key generation. In: STOC \u201998, pp. 320 (1998)","DOI":"10.1145\/276698.276882"},{"key":"122_CR33","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: ACM Computer Science Conference 1998, pp. 160\u2013174 (1998)","DOI":"10.1145\/288090.288106"},{"key":"122_CR34","doi-asserted-by":"crossref","unstructured":"Neff, C.A.: 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":"122_CR35","unstructured":"Neff, C. A.: Verifiable mixing (shuffling) of elgamal pairs. (2004). Available as. http:\/\/theory.lcs.mit.edu\/~rivest\/voting\/papers\/Neff-2004-04-21-ElGamalShuffles.pdf"},{"key":"122_CR36","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10207-006-0004-8","volume":"4","author":"L. Nguyen","year":"2006","unstructured":"Nguyen L., Safavi-Naini R., Kurosawa K.: Verifiable shuffles: a formal model and a paillier-based three-round construction with provable security. Int J Inf Secur 4, 241\u2013255 (2006)","journal-title":"Int J Inf Secur"},{"key":"122_CR37","doi-asserted-by":"crossref","unstructured":"Nieto, J.M.G., Boyd, C., Dawson, E.D: A Public Key Cryptosystem Based On A Subgroup Membership Problem. Designs, Codes and Cryptography, Issue 3, 2005, pp. 301\u2013316 (2005)","DOI":"10.1007\/s10623-004-1721-5"},{"key":"122_CR38","doi-asserted-by":"crossref","unstructured":"Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault tolerant anonymous channel. In: Proceedings of International Conference on Information and Communication Security 1997 of Lecture Notes in Computer Science, vol. 1334, pp. 440\u2013444. Berlin, Springer-Verlag (2000)","DOI":"10.1007\/BFb0028500"},{"key":"122_CR39","doi-asserted-by":"crossref","unstructured":"Ohkubo, M., Abe, M.: A length-invariant hybrid mix. In ASIACRYPT \u201900 of Lecture Notes in Computer Science, vol. 1976, pp. 178\u2013191. Berlin, Springer-Verlag (2000)","DOI":"10.1007\/3-540-44448-3_14"},{"key":"122_CR40","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key encyptosystem as secure as factoring. In: CRYPTO \u201998 of Lecture Notes in Computer Science, vol. 1403, pp. 308\u2013318. Berlin, Springer-Verlag (1998)","DOI":"10.1007\/BFb0054135"},{"key":"122_CR41","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public key cryptosystem based on composite degree residuosity classes. In: EUROCRYPT \u201999 of Lecture Notes in Computer Science, vol. 1592, pp. 223\u2013238. Berlin, Springer-Verlag (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"122_CR42","doi-asserted-by":"crossref","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: EUROCRYPT \u201993 of Lecture Notes in Computer Science, vol. 765, pp. 248\u2013259. Berlin, Springer-Verlag (1993)","DOI":"10.1007\/3-540-48285-7_21"},{"key":"122_CR43","doi-asserted-by":"crossref","unstructured":"Pedersen, T. P.: A threshold cryptosystem without a trusted party. In: EUROCRYPT \u201991, pp. 522\u2013526. Berlin, Springer-Verlag. Lecture Notes in Computer Science 547 (1991)","DOI":"10.1007\/3-540-46416-6_47"},{"key":"122_CR44","doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C., Dawson, E.D., Viswanathan, Kapali: A correct, private and efficient mix network. In: 2004 International Workshop on Practice and Theory in Public Key Cryptography of Lecture Notes in Computer Science, vol. 2947, pp. 439\u2013454. Berlin, Springer-Verlag (2004)","DOI":"10.1007\/978-3-540-24632-9_32"},{"key":"122_CR45","doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C., Dawson, E.D.: Simple and efficient shuffling with provable correctness and ZK privacy. In: CRYPTO \u201905 of Lecture Notes in Computer Science, vol. 089, pp. 188\u2013204. Berlin, Springer-Verlag (2005)","DOI":"10.1007\/11535218_12"},{"key":"122_CR46","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B.: Breaking an efficient anonymous channel. In: EUROCRYPT \u201994 of Lecture Notes in Computer Science, vol. 950, pp. 339\u2013348. Berlin, Springer-Verlag (1994)","DOI":"10.1007\/BFb0053448"},{"key":"122_CR47","doi-asserted-by":"crossref","unstructured":"Sako, K., Killian, J.: Receipt-free mix-type voting scheme\u2013a practical solution to the implementation of a voting booth. In: EUROCRYPT \u201995 of Lecture Notes in Computer Science, vol. 921, pp. 393\u2013403. Berlin, Springer-Verlag (1995)","DOI":"10.1007\/3-540-49264-X_32"},{"key":"122_CR48","doi-asserted-by":"crossref","unstructured":"Wikstrom, D.: Five practical attacks for optimistic mixing for exit-polls. In: SAC \u201903 of Lecture Notes in Computer Science, vol. 3006, pp. 160\u2013175. Berlin, Springer (2004)","DOI":"10.1007\/978-3-540-24654-1_12"},{"key":"122_CR49","doi-asserted-by":"crossref","unstructured":"Wikstrom, D.: A universally composable mix-net. In: Theory of Cryptography 2004 of Lecture Notes in Computer Science, vol. 2951, pp. 317\u2013335. Berlin, Springer (2004)","DOI":"10.1007\/978-3-540-24638-1_18"},{"key":"122_CR50","doi-asserted-by":"crossref","unstructured":"Wikstrom, D.: A sender verifiable mix-net and a new proof of a shuffle. In: ASIACRYPT \u201905 of Lecture Notes in Computer Science, vol. 3788, pp. 273\u2013292. Berlin, Springer (2005)","DOI":"10.1007\/11593447_15"},{"key":"122_CR51","doi-asserted-by":"crossref","unstructured":"Wikstrom, D., Groth, J.: An adaptively secure mix-netwithout erasures. In: ICALP \u201906 of Lecture Notes in Computer Science, vol. 4052, pp. 276\u2013287. Berlin, Springer (2006)","DOI":"10.1007\/11787006_24"},{"key":"122_CR52","doi-asserted-by":"crossref","unstructured":"Yamamura, A., Saito, T.: Private Information Retrieval Based on the Subgroup Membership Problem. In: ACISP \u201905, pp. 206\u2013220 (2005)","DOI":"10.1007\/3-540-47719-5_18"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0122-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-010-0122-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0122-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T14:55:40Z","timestamp":1740668140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-010-0122-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,4]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s10207-010-0122-1","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,4]]}}}