File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Efficient completely non-malleable and RKA secure public key encryptions

TitleEfficient completely non-malleable and RKA secure public key encryptions
Authors
KeywordsRelated-key attack
Public key encryption
Complete non-malleability
Chosen-ciphertext attack
Issue Date2016
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, v. 9723, p. 134-150 How to Cite?
Abstract© Springer International Publishing Switzerland 2016. Motivated by tampering attacks in practice, two different but related security notions, termed complete non-malleability and relatedkey attack security, have been proposed recently. In this work, we study their relations and present the first public key encryption scheme that is secure in both notions under standard assumptions. Moreover, by exploiting the technique for achieving complete non-malleability, we give a practical scheme for the related-key attack security. Precisely, the scheme is proven secure against polynomial functions of bounded degree d under a newly introduced hardness assumption called dmodified extended decisional bilinear Diffie-Hellman assumption. Since the schemes are constructed in a direct way instead of relying on the noninteractive zero knowledge proof or signature techniques, they not only achieve the strong security notions but also have better performances.
Persistent Identifierhttp://hdl.handle.net/10722/260257
ISSN
2023 SCImago Journal Rankings: 0.606

 

DC FieldValueLanguage
dc.contributor.authorSun, Shi Feng-
dc.contributor.authorParampalli, Udaya-
dc.contributor.authorYuen, Tsz Hon-
dc.contributor.authorYu, Yu-
dc.contributor.authorGu, Dawu-
dc.date.accessioned2018-09-12T02:00:55Z-
dc.date.available2018-09-12T02:00:55Z-
dc.date.issued2016-
dc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016, v. 9723, p. 134-150-
dc.identifier.issn0302-9743-
dc.identifier.urihttp://hdl.handle.net/10722/260257-
dc.description.abstract© Springer International Publishing Switzerland 2016. Motivated by tampering attacks in practice, two different but related security notions, termed complete non-malleability and relatedkey attack security, have been proposed recently. In this work, we study their relations and present the first public key encryption scheme that is secure in both notions under standard assumptions. Moreover, by exploiting the technique for achieving complete non-malleability, we give a practical scheme for the related-key attack security. Precisely, the scheme is proven secure against polynomial functions of bounded degree d under a newly introduced hardness assumption called dmodified extended decisional bilinear Diffie-Hellman assumption. Since the schemes are constructed in a direct way instead of relying on the noninteractive zero knowledge proof or signature techniques, they not only achieve the strong security notions but also have better performances.-
dc.languageeng-
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)-
dc.subjectRelated-key attack-
dc.subjectPublic key encryption-
dc.subjectComplete non-malleability-
dc.subjectChosen-ciphertext attack-
dc.titleEfficient completely non-malleable and RKA secure public key encryptions-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-319-40367-0_9-
dc.identifier.scopuseid_2-s2.0-84978872997-
dc.identifier.volume9723-
dc.identifier.spage134-
dc.identifier.epage150-
dc.identifier.eissn1611-3349-
dc.identifier.issnl0302-9743-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats