82 search results - page 6 / 17 » On Notions of Security for Deterministic Encryption, and Eff... |
ICCSA
2007
Springer
14 years 1 months ago
2007
Springer
An encrypted email is sent from Bob to Alice. A gateway wants to check whether a certain keyword exists in an email or not for some reason (e.g. routing). Nevertheless Alice does n...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
ersion of an extended abstract to be published in Advances in Cryptology—ASIACRYPT 2007, Springer-Verlag, 2007. Available online from: http://www.cs.stanford.edu/∼xb/asiacrypt0...
PKC
1999
Springer
13 years 11 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
IEICET
2006
13 years 7 months ago
2006
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
ICALP
2005
Springer
14 years 1 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...