163 search results - page 12 / 33 » Relaxing Chosen-Ciphertext Security |
AAECC
2006
Springer
14 years 1 months ago
2006
Springer
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
Security of mobile communications comes with the cost of computational overhead. Reducing the overhead in security computations is critical to ensure the overall performance of a ...
JOC
2007
13 years 7 months ago
2007
Signcryption is a public key or asymmetric cryptographic method that provides simultaneously both message confidentiality and unforgeability at a lower computational and communica...
CIS
2005
Springer
14 years 1 months ago
2005
Springer
A secure group signature is required to be anonymous, that is, given two group signatures generated by two different members on the same message or two group signatures generated ...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...