Sciweavers

CODCRY
2009
Springer
111views Cryptology» more  CODCRY 2009»
13 years 10 months ago
On the Impossibility of Strong Encryption Over
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 on...
Raphael C.-W. Phan, Serge Vaudenay