Loading...
conference paper
On the Impossibility of Strong Encryption over ℵ0
2009
Coding and Cryptology. IWCC 2009
We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphertext attacks in streaming mode with bounded resources: memory, time delay or output length. Curiously, both impossibility results can be achieved with either finite or continuous domains. The latter result explains why known CCA-secure cryptosystem constructions require at least two passes to decrypt a mes- sage with bounded resources.
Loading...
Name
onlv-iwcc09proc.pdf
Access type
openaccess
Size
244.72 KB
Format
Adobe PDF
Checksum (MD5)
96745b7c914556ca507ed4e9ffa18ce0