UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

How to break a practical MIX and design a new one

Desmedt, Y; Kurosawa, K; (2000) How to break a practical MIX and design a new one. In: Preneel, B, (ed.) ADVANCES IN CRYPTOLOGY - EUROCRYPT 2000. (pp. 557 - 572). SPRINGER-VERLAG BERLIN

Full text not available from this repository.

Abstract

A MIX 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 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.

Type:Proceedings paper
Title:How to break a practical MIX and design a new one
Event:19th Annual Eurocrypt Conference on Theory and Application of Cryptographic Techniques
Location:BRUGGE, BELGIUM
Dates:2000-05-14 - 2000-05-18
ISBN:3-540-67517-5
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record