Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/19435
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Barbosa, Manuel | - |
dc.contributor.author | Farshim, Pooya | - |
dc.date.accessioned | 2012-05-22T14:04:55Z | - |
dc.date.available | 2012-05-22T14:04:55Z | - |
dc.date.issued | 2010 | - |
dc.identifier.isbn | 978-3-642-14081-5 | - |
dc.identifier.issn | 0302-9743 | por |
dc.identifier.uri | https://hdl.handle.net/1822/19435 | - |
dc.description.abstract | 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. | por |
dc.description.sponsorship | The authors were funded in part by eCrypt II (EU FP7 - ICT-2007-216646) and FCT project PTDC/EIA/71362/2006. The second author was also funded by FCT grant BPD-47924-2008. | por |
dc.language.iso | eng | por |
dc.publisher | Springer | por |
dc.rights | openAccess | por |
dc.subject | Complete non-malleability | por |
dc.subject | Public key encryption | por |
dc.subject | Strong chosen-ciphertext | por |
dc.subject | Attacks | por |
dc.subject | Provable security | por |
dc.subject | Strong Chosen-Ciphertext Attacks | por |
dc.title | Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles | por |
dc.type | conferencePaper | - |
dc.peerreviewed | yes | por |
dc.relation.publisherversion | http://www.springerlink.com/ | por |
sdum.publicationstatus | published | por |
oaire.citationConferenceDate | 5 - 7 julho 2010 | - |
sdum.event.location | Sydney, Australia | - |
oaire.citationStartPage | 145 | por |
oaire.citationEndPage | 163 | por |
oaire.citationTitle | Information Security and Privacy : 15th Australasian Conference (ACISP 2010) | por |
oaire.citationVolume | 6168 | por |
dc.identifier.doi | 10.1007/978-3-642-14081-5_10 | por |
dc.subject.wos | Science & Technology | por |
sdum.journal | Lecture Notes in Computer Science | por |
sdum.conferencePublication | Information Security and Privacy : 15th Australasian Conference (ACISP 2010) | por |
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 |