How to break a practical MIX and design a new one (2000)
| Citations: | 37 - 0 self |
BibTeX
@MISC{Desmedt00howto,
author = {Yvo Desmedt and Kaoru Kurosawa},
title = {How to break a practical MIX and design a new one},
year = {2000}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. A MIX net takes a list of ciphertexts (c1 ; \Delta \Delta \Delta ; cN ) and outputs a permuted list of the plaintexts (m1 ; \Delta \Delta \Delta ; mN ) without revealing the relationship between (c1 ; \Delta \Delta \Delta ; cN ) and (m1 ; \Delta \Delta \Delta ; 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(t 2 ) 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. 1
