How to Break a Practical MIX and Design a New One

  • Yvo Desmedt
  • Kaoru Kurosawa
Conference paper

DOI: 10.1007/3-540-45539-6_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1807)
Cite this paper as:
Desmedt Y., Kurosawa K. (2000) How to Break a Practical MIX and Design a New One. In: Preneel B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg


A MIX net takes a list of ciphertexts (c1, ..., cN) and outputs a permuted list of the plaintexts (m1, ..., mN) without revealing the relationship between (c1,..., cN) and (m1, ...,mN). This paper first shows that the Jakobsson’s MIX net of Eurocrypt’98, which was believed to be resilient and very efficient, is broken. We next propose an efficient t-resilient MIX net with O(t2) servers in which the cost of each MIX server is O(N). Two new concepts are introduced, existential-honesty and limited-open-verification. They will be useful for distributed computation in general.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Yvo Desmedt
    • 1
    • 2
  • Kaoru Kurosawa
    • 3
  1. 1.Department of Computer ScienceFlorida State UniversityTallahasseeUSA
  2. 2.Dept. of Mathematics, Royal HollowayUniversity of LondonUK
  3. 3.Dept. of Electrical and Electronic Engineering Faculty of EngineeringTokyo Institute of TechnologyTokyoJapan

Personalised recommendations