@conference {mitkuro,
	title = {Attack for Flash MIX},
	booktitle = {Proceedings of ASIACRYPT 2000},
	year = {2000},
	publisher = {Springer-Verlag, LNCS 1976},
	organization = {Springer-Verlag, LNCS 1976},
	abstract = {AMIX net takes a list of ciphertexts (c 1,... , c N) and outputs a permuted list of the plaintexts (m 1,... ,m N) without revealing the relationship between (c 1,... , c N) and (m 1,... ,m N). This paper shows that the Jakobsson{\textquoteright}s flash MIX of PODC{\textquoteright}99, which was believed to be the most efficient robust MIX net, is broken. The first MIX server can prevent computing the correct output with probability 1 in our attack. We also present a countermeasure for our attack.},
	isbn = {3-540-41404-5},
	doi = {10.1007/3-540-44448-3_15},
	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6972},
	author = {Masashi Mitomo and Kaoru Kurosawa}
}

{"_id":"NSzFemCSws3h2KsqF","bibbaseid":"mitomo-kurosawa-attackforflashmix-2000","downloads":0,"creationDate":"2018-07-03T04:50:29.799Z","title":"Attack for Flash MIX","author_short":["Mitomo, M.","Kurosawa, K."],"year":2000,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Attack for Flash MIX","booktitle":"Proceedings of ASIACRYPT 2000","year":"2000","publisher":"Springer-Verlag, LNCS 1976","organization":"Springer-Verlag, LNCS 1976","abstract":"AMIX net takes a list of ciphertexts (c 1,... , c N) and outputs a permuted list of the plaintexts (m 1,... ,m N) without revealing the relationship between (c 1,... , c N) and (m 1,... ,m N). This paper shows that the Jakobsson\\textquoterights flash MIX of PODC\\textquoteright99, which was believed to be the most efficient robust MIX net, is broken. The first MIX server can prevent computing the correct output with probability 1 in our attack. We also present a countermeasure for our attack.","isbn":"3-540-41404-5","doi":"10.1007/3-540-44448-3_15","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6972","author":[{"firstnames":["Masashi"],"propositions":[],"lastnames":["Mitomo"],"suffixes":[]},{"firstnames":["Kaoru"],"propositions":[],"lastnames":["Kurosawa"],"suffixes":[]}],"bibtex":"@conference {mitkuro,\n\ttitle = {Attack for Flash MIX},\n\tbooktitle = {Proceedings of ASIACRYPT 2000},\n\tyear = {2000},\n\tpublisher = {Springer-Verlag, LNCS 1976},\n\torganization = {Springer-Verlag, LNCS 1976},\n\tabstract = {AMIX net takes a list of ciphertexts (c 1,... , c N) and outputs a permuted list of the plaintexts (m 1,... ,m N) without revealing the relationship between (c 1,... , c N) and (m 1,... ,m N). This paper shows that the Jakobsson{\\textquoteright}s flash MIX of PODC{\\textquoteright}99, which was believed to be the most efficient robust MIX net, is broken. The first MIX server can prevent computing the correct output with probability 1 in our attack. We also present a countermeasure for our attack.},\n\tisbn = {3-540-41404-5},\n\tdoi = {10.1007/3-540-44448-3_15},\n\turl = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6972},\n\tauthor = {Masashi Mitomo and Kaoru Kurosawa}\n}\n","author_short":["Mitomo, M.","Kurosawa, K."],"key":"mitkuro","id":"mitkuro","bibbaseid":"mitomo-kurosawa-attackforflashmix-2000","role":"author","urls":{"Paper":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.6972"},"downloads":0},"search_terms":["attack","flash","mix","mitomo","kurosawa"],"keywords":[],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}