Speny

Space-efficient, byte-wise incremental and perfectly private encryptio

1 post in this topic

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.

Full white paper with examples and refferences:

https://www.evernote.com/shard/s271/sh/6f125a57-3bcd-458c-bb7c-c390b7e9483b/3a9576728d9b5a9ecacc6a56fbe70034

0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now