Name
Abstract | ||
|---|---|---|
We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits re-encryption, such as ElGamal, does so only for a player with knowledge of the public key corresponding to a given ciphertext. In contrast, universal re-encryption can be done without knowledge of public keys. We propose an asymmetric cryptosystern with universal re-encryption that is half as efficient as standard ElGamal in terms of computation and storage. While technically and conceptually simple, universal re-encryption leads to new types of functionality in mixnet architectures. Conventional mixnets are often called upon to enable players to communicate with one another through channels that are externally anonymous, i.e., that hide information permitting traffic-analysis. Universal re-encryption lets us construct a mixnet of this kind in which servers hold no public or private keying material, and may therefore dispense with the cumbersome requirements of key generation, key distribution, and private-key management, We describe two practical mixnet constructions, one involving asymmetric input ciphertexts, and another with hybrid-ciphertext inputs. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-24660-2_14 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
anonymity,mix networks,private channels,universal reencryption | Cramer–Shoup cryptosystem,Computer science,Cryptography,Computer security,Cryptosystem,Encryption,Theoretical computer science,Anonymity,Ciphertext,ElGamal encryption,Public-key cryptography,Distributed computing | Conference |
Volume | ISSN | Citations |
2964 | 0302-9743 | 174 |
PageRank | References | Authors |
21.76 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Golle | 1 | 2375 | 203.55 |
| Markus Jakobsson | 2 | 4055 | 398.52 |
| Ari Juels | 3 | 7263 | 590.42 |
| Paul Syverson | 4 | 4713 | 457.55 |