@conference {DBLP:conf/acisp/BarbosaF10,
	title = {Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles},
	booktitle = {Proceedings of 15th Australasian Conference - ACISP},
	series = {Lecture Notes in Computer Science},
	volume = {6168},
	year = {2010},
	month = {July},
	pages = {145-163},
	publisher = {Springer},
	organization = {Springer},
	address = {Sydney, Australia},
	abstract = {<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>
},
	isbn = {978-3-642-14080-8},
	attachments = {https://haslab.uminho.pt/sites/default/files/mbb/files/strongcca_full.pdf},
	author = {Manuel Bernardo Barbosa and Pooya Farshim}
}