{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:23Z","timestamp":1750308203707,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,10,25]],"date-time":"2004-10-25T00:00:00Z","timestamp":1098662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,10,25]]},"DOI":"10.1145\/1030083.1030113","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"220-226","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Parallel mixing"],"prefix":"10.1145","author":[{"given":"Philippe","family":"Golle","sequence":"first","affiliation":[{"name":"Palo Alto Research Center"}]},{"given":"Ari","family":"Juels","sequence":"additional","affiliation":[{"name":"RSA Laboratories"}]}],"member":"320","published-online":{"date-parts":[[2004,10,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"258","volume-title":"ASIACRYPT '99","author":"Abe M.","unstructured":"M. Abe . Mix-networks on permutation networks . In ASIACRYPT '99 , pages 258 -- 273 .]] M. Abe. Mix-networks on permutation networks. In ASIACRYPT '99, pages 258--273.]]"},{"key":"e_1_3_2_1_2_1","first-page":"317","volume-title":"PKC '01","author":"Abe M.","unstructured":"M. Abe and F. Hoshino . Remarks on mix-network based on permutation networks . In PKC '01 , pages 317 -- 324 .]] M. Abe and F. Hoshino. Remarks on mix-network based on permutation networks. In PKC '01, pages 317--324.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_5_1","first-page":"2","volume-title":"IEEE Symposium on Security and Privacy '03","author":"Danezis G.","unstructured":"G. Danezis , R. Dingledine , and N. Mathewson . Mixminion: Design of a type III anonymous remailer protocol . In IEEE Symposium on Security and Privacy '03 , pages 2 -- 15 .]] G. Danezis, R. Dingledine, and N. Mathewson. Mixminion: Design of a type III anonymous remailer protocol. In IEEE Symposium on Security and Privacy '03, pages 2--15.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756169.1756223"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11423409_12"},{"key":"e_1_3_2_1_8_1","first-page":"16","volume-title":"Financial Cryptography '02","author":"Furukawa J.","unstructured":"J. Furukawa , H. Miyauchi , K. Mori , S. Obana , and K. Sako . An implementation of a universally verifiable electronic voting scheme based on shuffling . In Financial Cryptography '02 , pages 16 -- 30 .]] J. Furukawa, H. Miyauchi, K. Mori, S. Obana, and K. Sako. An implementation of a universally verifiable electronic voting scheme based on shuffling. In Financial Cryptography '02, pages 16--30.]]"},{"key":"e_1_3_2_1_9_1","first-page":"368","volume-title":"CRYPTO '01","author":"Furukawa J.","unstructured":"J. Furukawa and K. Sako . An efficient scheme for proving a shuffle . In CRYPTO '01 , pages 368 -- 387 .]] J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In CRYPTO '01, pages 368--387.]]"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586121"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301333"},{"key":"e_1_3_2_1_12_1","first-page":"448","volume-title":"EUROCRYPT '98","author":"Jakobsson M.","unstructured":"M. Jakobsson . A practical mix . In EUROCRYPT '98 , pages 448 -- 461 .]] M. Jakobsson. A practical mix. In EUROCRYPT '98, pages 448--461.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384046"},{"key":"e_1_3_2_1_15_1","first-page":"339","volume-title":"USENIX'02","author":"Jakobsson M.","unstructured":"M. Jakobsson , A. Juels , and R. Rivest . Making mix nets robust for electronic voting by randomized partial checking . In USENIX'02 , pages 339 -- 353 .]] M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In USENIX'02, pages 339--353.]]"},{"key":"e_1_3_2_1_16_1","first-page":"72","volume-title":"Financial Cryptography '04","author":"Kiayias A.","unstructured":"A. Kiayias and M. Yung . The vector-ballot e-voting approach . In Financial Cryptography '04 , pages 72 -- 89 .]] A. Kiayias and M. Yung. The vector-ballot e-voting approach. In Financial Cryptography '04, pages 72--89.]]"},{"key":"e_1_3_2_1_17_1","volume-title":"Vol 3: Sorting and Searching","author":"Knuth D.","year":"1998","unstructured":"D. Knuth . The Art of Computer Programming , Vol 3: Sorting and Searching . Addison-Wesley , 1998 .]] D. Knuth. The Art of Computer Programming, Vol 3: Sorting and Searching. Addison-Wesley, 1998.]]"},{"key":"e_1_3_2_1_18_1","volume-title":"Distributed Algorithms. Morgan Kaufmann","author":"Lynch N.","year":"1995","unstructured":"N. Lynch . Distributed Algorithms. Morgan Kaufmann , 1995 .]] N. Lynch. Distributed Algorithms. Morgan Kaufmann, 1995.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_20_1","first-page":"440","volume-title":"ICICS '97","author":"Ogata W.","unstructured":"W. Ogata , K. Kurosawa , K. Sako , and K. Takatani . Fault tolerant anonymous channel . In ICICS '97 , pages 440 -- 444 .]] W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS '97, pages 440--444.]]"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647096.716874"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167260"},{"key":"e_1_3_2_1_23_1","first-page":"41","volume-title":"Privacy Enhancing Technologies '02","author":"Serjantov A.","unstructured":"A. Serjantov and G. Danezis . Towards an information theoretic metric for anonymity . In Privacy Enhancing Technologies '02 , pages 41 -- 53 .]] A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In Privacy Enhancing Technologies '02, pages 41--53.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_25_1","first-page":"39","volume-title":"NDSS '02","author":"Wright M.","unstructured":"M. Wright , M. Adler , B. N. Levine , and C. Shields . An analysis of the degradation of anonymous protocols . In NDSS '02 , pages 39 -- 50 .]] M. Wright, M. Adler, B. N. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In NDSS '02, pages 39--50.]]"}],"event":{"name":"CCS04: 11th ACM Conference on Computer and Communications Security 2004","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"],"location":"Washington DC USA","acronym":"CCS04"},"container-title":["Proceedings of the 11th ACM conference on Computer and communications security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1030083.1030113","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1030083.1030113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:25:07Z","timestamp":1750263907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1030083.1030113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,25]]},"references-count":24,"alternative-id":["10.1145\/1030083.1030113","10.1145\/1030083"],"URL":"https:\/\/doi.org\/10.1145\/1030083.1030113","relation":{},"subject":[],"published":{"date-parts":[[2004,10,25]]},"assertion":[{"value":"2004-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}