CryptoDB
Improved Constructions for Universal Re-encryption
Authors: | |
---|---|
Download: | |
Abstract: | Golle et al introduced universal re-encryption, defining it as re- encryption by a player who does not know the key used for the original encryption, but which still allows an intended player to recover the plaintext. Universal re-encryption is potentially useful as part of many information-hiding techniques, as it allows any player to make ciphertext unidentifiable without knowing the key used. Golle et al?s techniques for universal re-encryption are reviewed, and improved constructions for both simple and hybrid universal re-encryption systems are presented, including a hybrid construction that permits indefinite re-encryptions with better efficiency and an almost-optimally small increase in file size. Some implementational issues and possible future directions are also discussed. |
BibTeX
@misc{eprint-2003-11968, title={Improved Constructions for Universal Re-encryption}, booktitle={IACR Eprint archive}, keywords={implementation / information hiding reencryption mixnet anonymity}, url={http://eprint.iacr.org/2003/255}, note={ peter@m-o-o-t.org 12538 received 3 Dec 2003, last revised 30 Apr 2004}, author={Peter Fairbrother}, year=2003 }