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’s flash MIX of PODC’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.
He is currently working for Fujitsu Laboratories Ltd.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Abe, “Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers,” Eurocrypt’ 98, pp. 437–447.
M. Abe, “A Mix-Network on permutation networks,” ISEC Technical report 99-10 (in Japanese) (May, 1999)
M. Abe, “Mix-Networks on permutation networks,” Asiacrypt’ 99, pp. 258–273.
D. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM, ACM 1981, pp. 84–88 “Undeniable Signatures,”
Y. Desmedt and K. Kurosawa, “How to break a practical MIX and design a new one”, Eurocrypt’2000.
T. ElGamal, “A Public-Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” Crypto’ 84, pp. 10–18
A. Fujioka, T. Okamoto and K. Ohta, “A practical secret voting scheme for large scale elections,” Auscrypt’ 92, pp. 244–251
M. Jakobsson, “A practical MIX,” Eurocrypt’ 98, pp. 448–461.
M. Jakobsson and D. M’Raihi, “Mix-based Electronic Payments,” SAC’98, pp. 157–173.
M. Jakobsson, “Flash Mixing,” PODC’99, pp. 83–89.
M. Jakobsson and A. Juels “Millimix: Mixing in small batches,” DIMACS Technical report 99-33 (June 1999)
W. Ogata, K. Kurosawa, K. Sako, K. Takatani, “Fault Tolerant Anonymous Channel,” ICICS’ 97, pp. 440–444
C. Park, K. Itoh, K. Kurosawa, “All/nothing election scheme and anonymous channel,” Eurocrypt’ 93, pp. 248–259
B. Pfitzmann and A. Pfitzmann. “How to break the direct RSA-implementation of MIXes,” Eurocrypt’ 89, pp. 373–381
K. Sako, J. Kilian, “Receipt-Free Mix-Type Voting Scheme,” Eurocrypt’ 95, pp. 393–403
A. Shamir, “How to Share a Secret,” Communications of the ACM, Vol. 22, 1979, pp. 612–613
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mitomo, M., Kurosawa, K. (2000). Attack for Flash MIX. In: Okamoto, T. (eds) Advances in Cryptology — ASIACRYPT 2000. ASIACRYPT 2000. Lecture Notes in Computer Science, vol 1976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44448-3_15
Download citation
DOI: https://doi.org/10.1007/3-540-44448-3_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41404-9
Online ISBN: 978-3-540-44448-0
eBook Packages: Springer Book Archive