Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles

DOI10.1007/978-3-642-14081-5_10zbMath1323.94100OpenAlexW1581530935MaRDI QIDQ3163102

Manuel Barbosa, Pooya Farshim

Publication date: 25 October 2010

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/19435

zbMATH Keywords

provable securitypublic-key encryptioncomplete non-malleabilitystrong chosen-ciphertext attacks

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Lattice-based completely non-malleable public-key encryption in the standard model ⋮ Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions

This page was built for publication: Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles