{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:24Z","timestamp":1750308204288,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"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.1030114","type":"proceedings-article","created":{"date-parts":[[2005,1,30]],"date-time":"2005-01-30T17:55:16Z","timestamp":1107107716000},"page":"227-235","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Fragile mixing"],"prefix":"10.1145","author":[{"given":"Michael K.","family":"Reiter","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]},{"given":"Xiaofeng","family":"Wang","sequence":"additional","affiliation":[{"name":"Indiana University at Bloomington"}]}],"member":"320","published-online":{"date-parts":[[2004,10,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054144"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647095.716723"},{"key":"e_1_3_2_1_3_1","volume-title":"On the Economics of Anonymity. In Financial Cryptography (FC '03)","author":"Acquisti A.","year":"2003","unstructured":"A. Acquisti , R. Dingledine , and P. Syverson . On the Economics of Anonymity. In Financial Cryptography (FC '03) , 2003 .]] A. Acquisti, R. Dingledine, and P. Syverson. On the Economics of Anonymity. In Financial Cryptography (FC '03), 2003.]]"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/332186.332211"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/829515.830555"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_39"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. Financial Cryptography (FC '02)","author":"Dingledine R.","year":"2002","unstructured":"R. Dingledine , M. J. Freedman , D. Hopwood , and D. Molnar . A Reputation System to Increase MIX-net Reliability . In Proc. Financial Cryptography (FC '02) . Springer-Verlag , 2002 .]] R. Dingledine, M. J. Freedman, D. Hopwood, and D. Molnar. A Reputation System to Increase MIX-net Reliability. In Proc. Financial Cryptography (FC '02). Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_9_1","first-page":"186","volume-title":"Advances in Cryptology --- Crypto '86","author":"Fiat A.","year":"1987","unstructured":"A. Fiat and A. Shamir . How to prove yourself: Practical solutions to identification and signature problems . In Advances in Cryptology --- Crypto '86 , pages 186 -- 194 , New York, 1987 . Springer-Verlag .]] A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology --- Crypto '86, pages 186--194, New York, 1987. Springer-Verlag.]]"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. 1992 AUSCRYPT","author":"Fujioka A.","year":"1992","unstructured":"A. Fujioka , T. Okamoto , and K. Ohta . A practical secret voting scheme for large scale elections . In Proc. 1992 AUSCRYPT , 1992 .]] A. Fujioka, T. Okamoto, and K. Ohta. A practical secret voting scheme for large scale elections. In Proc. 1992 AUSCRYPT, 1992.]]"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 2001 CRYPTO","author":"Furukawa J.","year":"2001","unstructured":"J. Furukawa and K. Sako . An efficient scheme for proving a shuffling . In Proc. 2001 CRYPTO , volume 2139 of Lecture Notes in Computer Science . Springer-Verlag , 2001 .]] J. Furukawa and K. Sako. An efficient scheme for proving a shuffling. In Proc. 2001 CRYPTO, volume 2139 of Lecture Notes in Computer Science. Springer-Verlag, 2001.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/519078"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/525423.830456"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054145"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301333"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384046"},{"key":"e_1_3_2_1_18_1","volume-title":"USENIX'02","author":"Jakobsson M.","year":"2002","unstructured":"M. Jakobsson , A. Juels , and R. Rivest . Making mix nets robust for electronic voting by randomized partial checking . In USENIX'02 , 2002 .]] M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In USENIX'02, 2002.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.668973"},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes on Computer Science","volume-title":"Proc. 2000 ASIACRYPT","author":"Mitomo M.","year":"2000","unstructured":"M. Mitomo and K. Kurosawa . Attack for flash mix . In Proc. 2000 ASIACRYPT , Lecture Notes on Computer Science . Springer-Verlag , 2000 .]] M. Mitomo and K. Kurosawa. Attack for flash mix. In Proc. 2000 ASIACRYPT, Lecture Notes on Computer Science. Springer-Verlag, 2000.]]"},{"key":"e_1_3_2_1_21_1","volume-title":"January","author":"M\u00f6ller U.","year":"2000","unstructured":"U. M\u00f6ller and L. Cottrell . Mixmaster Protocol --- Version 2. Unfinished draft , January 2000 .]] U. M\u00f6ller and L. Cottrell. Mixmaster Protocol --- Version 2. Unfinished draft, January 2000.]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_23_1","volume-title":"VOTEHERE","author":"Neff A.","year":"2003","unstructured":"A. Neff . Verifiable Mixing (Shuffling) of ElGamal Pairs . Technical report , VOTEHERE , September 2003 .]] A. Neff. Verifiable Mixing (Shuffling) of ElGamal Pairs. Technical report, VOTEHERE, September 2003.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/BFb0028500","volume-title":"Information and Communications Security --- First International Conference","author":"Ogata W.","year":"1997","unstructured":"W. Ogata , K. Kurosawa , K. Sako , and K. Takatani . Fault tolerant anonymous channel . In Information and Communications Security --- First International Conference , volume 1334 , pages 440 -- 444 , Beijing, China , 11--14 1997 . Springer-Verlag .]] W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In Information and Communications Security --- First International Conference, volume 1334, pages 440--444, Beijing, China, 11--14 1997. Springer-Verlag.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/647096.716874"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. 1993 EUROCRYPT","author":"Park C.","year":"1993","unstructured":"C. Park , K. Itoh , and K. Kurosawa . All\/nothing election scheme and anonymous channel . In Proc. 1993 EUROCRYPT , 1993 .]] C. Park, K. Itoh, and K. Kurosawa. All\/nothing election scheme and anonymous channel. In Proc. 1993 EUROCRYPT, 1993.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.668972"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/644527.644537"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. Financial Cryptography (FC '03)","author":"Roger Dingledine P. S.","year":"2003","unstructured":"P. S. Roger Dingledine , Nick Mathewson . Reliable MIX Cascade Networks through Reputation . In Proc. Financial Cryptography (FC '03) . Springer-Verlag , 2003 .]] P. S. Roger Dingledine, Nick Mathewson. Reliable MIX Cascade Networks through Reputation. In Proc. Financial Cryptography (FC '03). Springer-Verlag, 2003.]]"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. 1995","author":"Sako K.","year":"1995","unstructured":"K. Sako and J. Kilian . Receipt-free mix-type voting scheme . In Proc. 1995 EUROCRYPT. Springer-Verlag , 1995 .]] K. Sako and J. Kilian. Receipt-free mix-type voting scheme. In Proc. 1995 EUROCRYPT. Springer-Verlag, 1995.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/648115.746431"}],"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.1030114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1030083.1030114","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.1030114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10,25]]},"references-count":30,"alternative-id":["10.1145\/1030083.1030114","10.1145\/1030083"],"URL":"https:\/\/doi.org\/10.1145\/1030083.1030114","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"}}]}}