{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:49:57Z","timestamp":1756385397095,"version":"3.38.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T00:00:00Z","timestamp":1285372800000},"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-0117-y","type":"journal-article","created":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T12:34:18Z","timestamp":1285331658000},"page":"33-47","source":"Crossref","is-referenced-by-count":13,"title":["Modification and optimisation of a shuffling scheme: stronger security, formal analysis and higher efficiency"],"prefix":"10.1007","volume":"10","author":[{"given":"Kun","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ed","family":"Dawson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,25]]},"reference":[{"key":"117_CR1","doi-asserted-by":"crossref","unstructured":"Abe, M.: Mix-networks on permutation net-works. In: ASIACRYPT \u201999, LNCS 1716, pp. 258\u2013273 (1999)","DOI":"10.1007\/978-3-540-48000-6_21"},{"key":"117_CR2","doi-asserted-by":"crossref","unstructured":"Abe, M., Hoshino, F.: Remarks on mix-network based on permutation networks. In: PKC \u201901, LNCS, pp. 317\u2013324 (1992)","DOI":"10.1007\/3-540-44586-2_23"},{"key":"117_CR3","doi-asserted-by":"crossref","unstructured":"Baudron, O., Fouque, P., Pointcheval, D., Poupard, G., Stern, J.: Practical multi-candidate election system. In: 12th Annual ACM Symposium on Principles of Distributed Computing, pp. 274\u2013283 (2001)","DOI":"10.1145\/383962.384044"},{"key":"117_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.: Efficient generation of shared RSA keys. In: Crypto \u201997, LNCS 1233, pp. 425\u2013439 (2001)","DOI":"10.1007\/BFb0052253"},{"key":"117_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D.: The decision Diffie-Hellman problem. In: The Third Algorithmic Number Theory Symposium, LNCS 1423, pp. 48\u201363 (1998)","DOI":"10.1007\/BFb0054851"},{"key":"117_CR6","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\/586119.586121"},{"key":"117_CR7","unstructured":"Brands, S.: An efficient off-line electronic cash system based on the representation problem. In: Technical Report: CS-R9323, Centre for Mathematics and Computer Science, pp. 68\u201377 (1993)"},{"key":"117_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Pedersen, T.: Wallet databases with observers. In: CRYPTO \u201992, LNCS 740, pp. 89\u2013105 (1997)","DOI":"10.1007\/3-540-48071-4_7"},{"key":"117_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. EUROCRYPT \u201900, LNCS 1807, pp. 431\u2013444 (2000)","DOI":"10.1007\/3-540-45539-6_30"},{"key":"117_CR10","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, LNCS 1992, pp. 119\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"117_CR11","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Koprowski, M.: Practical threshold RSA signatures without a trusted dealer. EUROCRYPT \u201901, LNCS 2045, pp. 152\u2013165 (2001)","DOI":"10.1007\/3-540-44987-6_10"},{"key":"117_CR12","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/0161-118491859060","volume":"8","author":"J. DeLaurentis","year":"1984","unstructured":"DeLaurentis J.: A further weakness in the common modulus protocol for the RSA cryptoalgorithm. Cryptologia 8, 253\u2013259 (1984)","journal-title":"Cryptologia"},{"key":"117_CR13","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":"117_CR14","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO \u201986, LNCS 263, pp. 186\u2013194 (1998)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"117_CR15","doi-asserted-by":"crossref","unstructured":"Fouque, P., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Financial Cryptography 2000, LNCS 1962, pp. 90\u2013104 (2001)","DOI":"10.1007\/3-540-45472-1_7"},{"key":"117_CR16","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: CRYPTO \u201901, LNCS 2139, pp. 368\u2013387 (2002)","DOI":"10.1007\/3-540-44647-8_22"},{"key":"117_CR17","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: EUROCRYPT \u201999, LNCS 1592, pp. 123\u2013139 (1996)"},{"issue":"2","key":"117_CR18","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S., Micali S.: Probabilistic encryption. J. Comput. Secur. 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Secur."},{"key":"117_CR19","doi-asserted-by":"crossref","unstructured":"Groth, J.: A verifiable secret shuffle of homomorphic encryptions. In: PKC \u201903, LNCS 2567, pp. 145\u2013160 (1999)","DOI":"10.1007\/3-540-36288-6_11"},{"key":"117_CR20","doi-asserted-by":"crossref","unstructured":"Groth, J., Lu, S.: Verifiable shuffle of large size ciphertexts. In: PKC \u201907, LNCS 4450, pp. 377\u2013392 (2007)","DOI":"10.1007\/978-3-540-71677-8_25"},{"key":"117_CR21","doi-asserted-by":"crossref","unstructured":"Groth, J., Ishai, Y.: Sub-linear zero-knowledge argument for correctness of a shuffle. In: EUROCRYPT \u201908, LNCS4965, pp. 379\u2013396 (2008)","DOI":"10.1007\/978-3-540-78967-3_22"},{"key":"117_CR22","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":"117_CR23","unstructured":"Lee, B., Kim, K.: Receipt-free electronic voting through collaboration of voter and honest verifier (2000). http:\/\/caislab.icu.ac.kr\/paper\/2000\/sultan\/jwisc2k_bclee.ps"},{"key":"117_CR24","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Frankel, Y., Yung, M.: Robust efficient distributed RSA-key generation. In: ACM Symposium on Principles of Distributed Computing, p. 320 (1998)","DOI":"10.1145\/277697.277779"},{"key":"117_CR25","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/S0022-0000(76)80043-8","volume":"13","author":"G. Miller","year":"1976","unstructured":"Miller G.: Riemann\u2019s hypothesis and tests for primality. J. Comput. Syst. Sci. 13, 300\u2013317 (1976)","journal-title":"J. Comput. Syst. Sci."},{"key":"117_CR26","doi-asserted-by":"crossref","unstructured":"Miyaji, A., Umeda, K.: A fully-functional group signature scheme over only known-order group. ACNS2004, LNCS 3089, pp. 164\u2013179 (2004)","DOI":"10.1007\/978-3-540-24852-1_12"},{"key":"117_CR27","doi-asserted-by":"crossref","unstructured":"Naccache, D., Stern, J.: A new public key cryptosystem based on higher residues. In: ACM Computer Science Conference, pp. 160\u2013174 (1998)","DOI":"10.1145\/288090.288106"},{"key":"117_CR28","doi-asserted-by":"crossref","unstructured":"Neff, C.: A verifiable secret shuffle and its application to e-voting. In: ACM Conference on Computer and Communications Security, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"117_CR29","unstructured":"Neff, C.: Verifiable mixing (shuffling) of ElGamal pairs (2004). Available as http:\/\/theory.lcs.mit.edu\/~rivest\/voting\/papers\/Neff-2004-04-21-ElGamalShuffles.pdf"},{"key":"117_CR30","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/s10207-006-0004-8","volume":"4","author":"L. Nguyen","year":"2006","unstructured":"Nguyen L., Naini R., Kurosawa K.: Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security. Int. J. Info. Secur. 4, 241\u2013255 (2006)","journal-title":"Int. J. Info. Secur."},{"key":"117_CR31","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Uchiyama, S.: A new public-key encyptosystem as secure as factoring. In: CRYPTO \u201998, LNCS 1403, pp. 308\u2013318 (1998)","DOI":"10.1007\/BFb0054135"},{"key":"117_CR32","doi-asserted-by":"crossref","unstructured":"Paillier, P.: Public key cryptosystem based on composite degree residuosity classes. In: EUROCRYPT \u201999, LNCS 1592, pp. 223\u2013238 (1999)","DOI":"10.1007\/3-540-48910-X_16"},{"key":"117_CR33","doi-asserted-by":"crossref","unstructured":"Pedersen, T.: A threshold cryptosystem without a trusted party. In: EUROCRYPT \u201991, LNCS 547, pp. 522\u2013526 (1992)","DOI":"10.1007\/3-540-46416-6_47"},{"key":"117_CR34","doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C., Dawson, E.: Simple and efficient shuffling with provable correctness and ZK privacy. In: CRYPTO \u201905, LNCS 3089, pp. 188\u2013204 (2005)","DOI":"10.1007\/11535218_12"},{"key":"117_CR35","doi-asserted-by":"crossref","unstructured":"Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: A correct, private and efficient mix network. In: PKC \u201904, LNCS 2947, pp. 439\u2013454 (2004)","DOI":"10.1007\/978-3-540-24632-9_32"},{"key":"117_CR36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. Schnorr","year":"1991","unstructured":"Schnorr C.: Efficient signature generation by smart cards. J. Cryptol. 4, 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"117_CR37","doi-asserted-by":"crossref","unstructured":"Wikstrom, D.: A sender verifiable mix-net and a new proof of a shuffle. In: ASIACRYPT \u201905, LNCS 3788, pp. 273\u2013292 (2004)","DOI":"10.1007\/11593447_15"},{"key":"117_CR38","unstructured":"Wikstrom, D.: A sender verifiable mix-net and a new proof of a shuffle. (2005) http:\/\/eprint.iacr.org\/2005\/137"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0117-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-010-0117-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0117-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T01:29:48Z","timestamp":1740533388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-010-0117-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,25]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["117"],"URL":"https:\/\/doi.org\/10.1007\/s10207-010-0117-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2010,9,25]]}}}