Cryptography – Communication system using cryptography – Time segment interchange
Reexamination Certificate
2000-03-09
2004-11-02
Morse, Gregory (Department: 2134)
Cryptography
Communication system using cryptography
Time segment interchange
C705S012000, C235S05800M
Reexamination Certificate
active
06813354
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to improved methods and apparatus for providing mix networks.
BACKGROUND OF THE INVENTION
A mix network is a privacy primitive used to reorder a list of inputs, thereby producing a list of outputs, so that the items of the output correspond to the items of the inputs, but in a way that the relative order cannot be determined. There are essentially three types of mix networks: (1) Those in which the receiver of the output needs to trust that the output is of the right form (i.e. corresponds to the input); (2) Those in which the receiver needs to trust that one of the servers producing the output is honest—if that is so, then the output must be correct; and (3) Those in which the receiver can verify the correctness of the output, and does not need to trust anybody. Schemes of the first type are not very useful. Schemes of the second type are useful for most applications, and there exist efficient solutions for these, especially when the input sizes are large. For certain applications a scheme of the third type is preferred. There may be some recent proposals of how to do schemes of the third type. However, these recently proposed schemes are not as efficient as the methods disclosed in the present application. In addition, the applicant claims priority over some of the other most recently proposed methods and these may or may not be prior art. For the most part these proposed methods do not handle small inputs
Generally, a mix network takes a collection of n encrypted input data messages (each message including a plurality of data bits or data signals), re-encrypts them, and outputs them in an unrevealed, randomly permuted order. The original conception of mix networks is by Chaum. They have been used or proposed for use for anonymous e-mail, Web browsing, and secure elections, as well as for seemingly unrelated applications such as anonymous payments systems and secure multi-party computation.
In recent years threshold mix networks have been proposed which employ multiple mix servers where the correctness and privacy of the mix is robust against malicious coalitions of mix servers. However, most prior art multiple mix server techniques are inefficient, often requiring between fifty up to more than a thousand exponentiation operations. One prior art mix network proposed by Jakobsson brought the number of exponentiations down to one per input item (each item is a single message comprised of multiple data bits or data signals) but this prior art mix network assumed very large input batches (of about 1 million items).
SUMMARY OF THE INVENTION
The present invention provides the first highly efficient mix network for small numbers of inputs. Four data messages (each message comprised of multiple data bits or signals) would be a typical number of inputs. The solution, which is based on techniques used to sort data (but which in embodiments of the present invention are used to unsort data) allows a receiver to verify the correctness of the output.
The present invention uses the structure of sorting/permutation networks to permute the input. This is done in a way that changes the position of pairs of items (iteratively or in parallel), which allows efficient proofs to be employed for proving correctness (it is known that proofs become significantly more expensive as they become bigger, and in embodiment of the present invention, we break down the proofs in their smallest components, i.e., to prove statements about pairs of items instead of vectors). We develop novel methods relating to signature schemes to realize these proofs.
Embodiments of the present invention provide a mix network method and apparatus which is highly efficient on small input batches and is robust and private in the face of collusion by any minority set of mix servers. Additionally, the mix network method and apparatus has the feature of being publicly verifiable because the mixing method yields a transcript of results that can demonstrate to a third party that the mix proceeded correctly.
In one embodiment of the present invention an apparatus comprised of a plurality of mix servers is provided. Each mix server includes a randomizer network. Each randomizer network receives a plurality of input data messages and performs re-encryption and permutation operations on the plurality of input data messages to form a plurality of output data messages. The randomizer networks of the plurality of mix servers are arranged in a chain so that the first randomizer network of the first mix server in the chain receives its plurality of input data messages and provides its plurality of output data messages to the next randomizer network of the following mix server in the chain. Each randomizer network is comprised of a plurality of randomizers, wherein each randomizer receives first and second input data messages and produces first and second output data messages, wherein the first output data message is a re-encryption of either the first or the second input data message and the second output data message is a re-encryption of the other input data message. The apparatus may be further comprised of a bulletin board having computer memory. Each mix server produces proof to the bulletin board that each randomizer of each randomizer network has re-encrypted and permuted in a proper manner.
The re-encryption step may be replaced by decryption at one or more steps.
REFERENCES:
patent: 3962539 (1976-06-01), Ehrsam et al.
patent: 5120939 (1992-06-01), Claus et al.
patent: 5214703 (1993-05-01), Massey et al.
patent: 5625695 (1997-04-01), M'Raihi et al.
patent: 6009176 (1999-12-01), Gennaro et al.
patent: 6182216 (2001-01-01), Luyster
patent: 6389538 (2002-05-01), Gruse et al.
patent: 6598163 (2003-07-01), Jakobsson
Kaist Al Fuzzy, Kwangsu Lee, “Construction of Pseudo-Random Permutation using Unbalanced Feistel Network”, Jul. 29, 1999, http://monami.kaist.ac.kr/~guspin/seminar/prp_ufn/.*
Michael Luby, Charles Rackoff, Pseudo-random Permutation Generators and Cryptographic Composition, 1986, ACM.*
Mihir Bellare, Ted Krovetz, Phillip Rogaway, Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-Inverticable, Oct. 17, 1998, Advances in Cryptology—Eurocrypt 98 Proceedings.*
Masayuki, Abe, “University Verifiable Mix-net with Verification Work Independent of the Number if Mix-servers”, 1998, Advances in Cyptology—EUROCRYPT'98, LNCS 1403, pp. 437-447.*
Menezes, Alfred J., Handbook of Appied Cryptogrpahy, 1197, CRC Press, p. 250-251, 263, 408-411, 459.*
Chaum, David, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Feb. 1981, Communication of the ACM, vol. 24, No. 2.*
Goldschlag, David, “Onion Routing for Anonymous and Private Internet Connections”, Jan., 28, 1999, Center for High Assurance Computer Systems.*
Jakobsson, Markus, “A Practical Mix”, 1998, Advances in Crptology—EUROCRYPT'98, LNCS 1403, pp. 448-461.*
Reiter, Michael, “Crowds, Anonymity for Web Transactions”, Nov. 1998, ACM Transaction on Informatin and System Security, vol. 1, No. 1, pp. 66-92.
Jakobsson Bjorn Markus
Juels Ari
Morse Gregory
Zia Mossadeq
LandOfFree
Mixing in small batches does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Mixing in small batches, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mixing in small batches will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3297313