{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:45:37Z","timestamp":1725529537349},"publisher-location":"Berlin, Heidelberg","reference-count":31,"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_22","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T07:22:23Z","timestamp":1237274543000},"page":"354-367","source":"Crossref","is-referenced-by-count":1,"title":["Proving a Shuffle Using Representations of the Symmetric Group"],"prefix":"10.1007","author":[{"given":"Soojin","family":"Cho","sequence":"first","affiliation":[]},{"given":"Manpyo","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-48000-6_21","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M. Abe","year":"1999","unstructured":"Abe, M.: Mix-networks on permutation networks. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 258\u2013273. Springer, Heidelberg (1999)"},{"key":"22_CR2","series-title":"London Mathematical Society Student Texts","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511623714","volume-title":"Designs, graphs, codes and their links","author":"P.J. Cameron","year":"1991","unstructured":"Cameron, P.J., van Lint, J.H.: Designs, graphs, codes and their links. London Mathematical Society Student Texts, vol.\u00a022. Cambridge University Press, Cambridge (1991)"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM\u00a024(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-40956-4_1","volume-title":"Privacy Enhancing Technologies","author":"G. Danezis","year":"2003","unstructured":"Danezis, G.: Mix-networks with restricted routes. In: Dingledine, R. (ed.) PET 2003. LNCS, vol.\u00a02760, pp. 1\u201317. Springer, Heidelberg (2003)"},{"key":"22_CR5","first-page":"2","volume-title":"IEEE Symposium on Security and Privacy","author":"G. Danezis","year":"2003","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In: IEEE Symposium on Security and Privacy, pp. 2\u201315. IEEE Computer Society, Los Alamitos (2003)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/3-540-45539-6_39","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"Y.G. Desmedt","year":"2000","unstructured":"Desmedt, Y.G., Kurosawa, K.: How to break a practical MIX and design a new one. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 557\u2013572. Springer, Heidelberg (2000)"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"D\u00edaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine and Syverson [10], pp. 54\u201368","DOI":"10.1007\/3-540-36467-6_5"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45496-9_10","volume-title":"Information Hiding","author":"R. Dingledine","year":"2001","unstructured":"Dingledine, R., Freedman, M.J., Hopwood, D., Molnar, D.: A reputation system to increase mix-net reliability. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 126\u2013141. Springer, Heidelberg (2001)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: The second-generation onion router. In: USENIX Security Symposium, pp. 303\u2013320. USENIX (2004)","DOI":"10.21236\/ADA465464"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36467-6_1","volume-title":"Privacy Enhancing Technologies","author":"I. Goldberg","year":"2003","unstructured":"Goldberg, I.: Privacy-enhancing technologies for the internet, II: Five years later. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 1\u201312. Springer, Heidelberg (2003)"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0097-3165(90)90007-J","volume":"54","author":"P. Frankl","year":"1990","unstructured":"Frankl, P.: Intersection theorems and mod p rank of inclusion matrices. J. Combin. Theory Ser. A\u00a054(1), 85\u201394 (1990)","journal-title":"J. Combin. Theory Ser. A"},{"key":"22_CR12","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":"22_CR13","unstructured":"Goh, E.-J.: Encryption Schemes from Bilinear Maps, Ph.D. thesis, Department of Computer Science, Stanford University (September 2007)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-24660-2_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"P. Golle","year":"2004","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.F.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 163\u2013178. Springer, Heidelberg (2004)"},{"key":"22_CR15","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":"22_CR16","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":"22_CR17","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":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/3-540-44448-3_15","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Mitomo","year":"2000","unstructured":"Mitomo, M., Kurosawa, K.: Attack for flash MIX. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 192\u2013204. Springer, Heidelberg (2000)"},{"key":"22_CR19","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, pp. 116\u2013125 (2001)","DOI":"10.1145\/501997.502000"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24852-1_5","volume-title":"Applied Cryptography and Network Security","author":"L. Nguyen","year":"2004","unstructured":"Nguyen, L., Safavi-Naini, R., Kurosawa, K.: Verifiable shuffles: A formal model and a paillier-based efficient construction with provable security. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol.\u00a03089, pp. 61\u201375. Springer, Heidelberg (2004)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"Information and Communications Security","author":"W. Ogata","year":"1997","unstructured":"Ogata, W., Kurosawa, K., Sako, K., Takatani, K.: Fault tolerant anonymous channel. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 440\u2013444. Springer, Heidelberg (1997)"},{"key":"22_CR22","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 cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"22_CR23","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.-s. Park","year":"1994","unstructured":"Park, C.-s., 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":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11535218_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"K. Peng","year":"2005","unstructured":"Peng, K., Boyd, C., Dawson, E.: Simple and efficient shuffling with provable correctness and ZK privacy. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 188\u2013204. Springer, Heidelberg (2005)"},{"key":"22_CR25","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":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-46885-4_37","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"B. Pfitzmann","year":"1990","unstructured":"Pfitzmann, B., Pfitzmann, A.: How to break the direct RSA-implementation of mixes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 373\u2013381. Springer, Heidelberg (1990)"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-49264-X_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201995","author":"B. Pfitzmann","year":"1995","unstructured":"Pfitzmann, B., Schunter, M., Waidner, M.: How to break another \u201cProvably secure\u201d payment system. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol.\u00a0921, pp. 121\u2013132. Springer, Heidelberg (1995)"},{"key":"22_CR28","unstructured":"Sagan, B.E.: The symmetric group, The Wadsworth & Brooks\/Cole Mathematics Series, Wadsworth & Brooks\/Cole Advanced Books & Software, Pacific Grove, CA, Representations, combinatorial algorithms, and symmetric functions (1991)"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine and Syverson [10], pp. 41\u201353","DOI":"10.1007\/3-540-36467-6_4"},{"key":"22_CR30","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. Wikstr\u00f6m","year":"2005","unstructured":"Wikstr\u00f6m, 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)"},{"issue":"6","key":"22_CR31","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/S0195-6698(13)80046-7","volume":"11","author":"R.M. Wilson","year":"1990","unstructured":"Wilson, R.M.: A diagonal form for the incidence matrices of t-subsets vs. k-subsets. European J. Combin.\u00a011(6), 609\u2013615 (1990)","journal-title":"European J. Combin."}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T17:28:04Z","timestamp":1558200484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00730-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642007293","9783642007309"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00730-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}