Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/19435
Título: | Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles |
Autor(es): | Barbosa, Manuel Farshim, Pooya |
Palavras-chave: | Complete non-malleability Public key encryption Strong chosen-ciphertext Attacks Provable security Strong Chosen-Ciphertext Attacks |
Data: | 2010 |
Editora: | Springer |
Revista: | Lecture Notes in Computer Science |
Resumo(s): | 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. |
Tipo: | Artigo em ata de conferência |
URI: | https://hdl.handle.net/1822/19435 |
ISBN: | 978-3-642-14081-5 |
DOI: | 10.1007/978-3-642-14081-5_10 |
ISSN: | 0302-9743 |
Versão da editora: | http://www.springerlink.com/ |
Arbitragem científica: | yes |
Acesso: | Acesso aberto |
Aparece nas coleções: | DI/CCTC - Artigos (papers) |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
StrongCCACRC.pdf | Preprint | 504,47 kB | Adobe PDF | Ver/Abrir |