Improved Constructions for Universal Re-encryption.

Peter Fairbrother

Paper 2003/255

Improved Constructions for Universal Re-encryption.

Peter Fairbrother

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.

Note: Tidied up, new section on semantic security

Metadata

Available format(s): PDF PS
Category: Implementation
Publication info: Published elsewhere. Unknown where it was published
Contact author(s): peter @ m-o-o-t org
History: 2004-04-30: revised; 2003-12-20: received; See all versions
Short URL: https://ia.cr/2003/255
License: CC BY

BibTeX

@misc{cryptoeprint:2003/255,
      author = {Peter Fairbrother},
      title = {Improved Constructions for Universal Re-encryption.},
      howpublished = {Cryptology {ePrint} Archive, Paper 2003/255},
      year = {2003},
      url = {https://eprint.iacr.org/2003/255}
}