38 search results - page 1 / 8 » On the Impossibility of Strong Encryption Over |
CODCRY
2009
Springer
13 years 11 months ago
2009
Springer
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...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
A new framework for protection against key exposure was recently suggested by Dodis et. al. [16]. We take its realization further towards practice by presenting simple new schemes...
TCC
2005
Springer
13 years 10 months ago
2005
Springer
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret...
GRC
2007
IEEE
13 years 10 months ago
2007
IEEE
— One of the most substantial ways to protect users’ sensitive information is encryption. This paper is about the keyword index search system on encrypted documents. It has bee...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...