New answers tagged

3

Using generic homomorphic encryption the answer for all three is essentially yes. Although 3. in general is probably mainly of theoretical interest as it would be impractically slow. For simply compressed data this is simple since compression should not do anything to hide the data. Just decompress, do the operation and possibly compress the result if ...


0

what I was originally thinking of was a way to compress random data. this compression data could be encrypted using one-time-pad and then used as a key. the approach of that is impractical. I have new approach to infinite one-time-pads. in every message include a reference to a randomly picked public file(s). encrypt said files to produce higher entropy ...



Top 50 recent answers are included