Cryptology ePrint Archive: Report 2014/104

Space-efficient, byte-wise incremental and perfectly private encryption schemes

Kévin Atighehchi

Abstract: The problem raised by incremental encryption is the overhead due to the larger storage space required by the provision of random blocks together with the ciphered versions of a given document. Besides, permitting variable-length modifications on the ciphertext leads to privacy preservation issues. In this paper we present incremental encryption schemes which are space-efficient, byte-wise incremental and which preserve perfect privacy in the sense that they hide the fact that an update operation has been performed on a ciphered document. For each scheme, the run time of updates performed turns out to be very efficient and we discuss the statistically adjustable trade-off between computational cost and storage space required by the produced ciphertexts.

Category / Keywords: secret-key cryptography

Date: received 11 Feb 2014, last revised 18 Feb 2014

Contact author: kevin atighehchi at univ-amu fr

Available format(s): PDF | BibTeX Citation

Note: Preliminary version

Version: 20140218:232242 (All versions of this report)

Short URL: ia.cr/2014/104

Discussion forum: Show discussion | Start new discussion