31 search results - page 4 / 7 » Signatures on Randomizable Ciphertexts |
ICALP
2005
Springer
14 years 2 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...
ESORICS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
PKC
2009
Springer
14 years 9 months ago
2009
Springer
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
CSFW
2008
IEEE
14 years 3 months ago
2008
IEEE
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
IACR
2011
12 years 8 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...