%0 Conference Paper
%B Proceedings of 15th Australasian Conference - ACISP
%D 2010
%T Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles
%A Manuel Bernardo Barbosa
%A Pooya Farshim
%C Sydney, Australia
%I Springer
%P 145-163
%S Lecture Notes in Computer Science
%V 6168
%X <p>We study relations among various notions of complete non-malleability, where an adversary can tamper with both ciphertexts and public-keys, and ciphertext indistinguishability. We follow the pattern of relations previously established for standard non-malleability. To this end, we propose a more convenient and conceptually simpler indistinguishability-based security model to analyse completely non-malleable schemes. Our model is based on strong decryption oracles, which provide decryptions under arbitrarily chosen public keys. We give the first precise definition of a strong decryption oracle, pointing out the subtleties in different approaches that can be taken. We construct the first efficient scheme, which is fully secure against strong chosen-ciphertext attacks, and therefore completely non-malleable, without random oracles.</p>
%8 July
%@ 978-3-642-14080-8
%> https://haslab.uminho.pt/sites/default/files/mbb/files/strongcca_full.pdf