Efficient completely non-malleable and RKA secure public key encryptions

Shi-Feng Sun, Udaya Parampalli, Tsz Hon Yuen, Yu Yu, Dawu Gu

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

Abstract

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.

Original languageEnglish
Title of host publicationInformation Security and Privacy
Subtitle of host publication21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II
EditorsJoseph K. Liu, Ron Steinfeld
Place of PublicationSwitzerland
PublisherSpringer
Pages134-150
Number of pages17
ISBN (Electronic)9783319403670
ISBN (Print)9783319403663
DOIs
Publication statusPublished - 2016
Externally publishedYes
EventAustralasian Conference on Information Security and Privacy 2016 - Melbourne, Australia
Duration: 4 Jul 20166 Jul 2016
Conference number: 21

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9723
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceAustralasian Conference on Information Security and Privacy 2016
Abbreviated titleACISP 2016
CountryAustralia
CityMelbourne
Period4/07/166/07/16

Keywords

  • Chosen-ciphertext attack
  • Complete non-malleability
  • Public key encryption
  • Related-key attack

Cite this

Sun, S-F., Parampalli, U., Yuen, T. H., Yu, Y., & Gu, D. (2016). Efficient completely non-malleable and RKA secure public key encryptions. In J. K. Liu, & R. Steinfeld (Eds.), Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II (pp. 134-150). (Lecture Notes in Computer Science; Vol. 9723). Switzerland: Springer. https://doi.org/10.1007/978-3-319-40367-0_9
Sun, Shi-Feng ; Parampalli, Udaya ; Yuen, Tsz Hon ; Yu, Yu ; Gu, Dawu. / Efficient completely non-malleable and RKA secure public key encryptions. Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II. editor / Joseph K. Liu ; Ron Steinfeld. Switzerland : Springer, 2016. pp. 134-150 (Lecture Notes in Computer Science).
@inproceedings{83fcf4e21cfc4bb89302b67e892c891b,
title = "Efficient completely non-malleable and RKA secure public key encryptions",
abstract = "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.",
keywords = "Chosen-ciphertext attack, Complete non-malleability, Public key encryption, Related-key attack",
author = "Shi-Feng Sun and Udaya Parampalli and Yuen, {Tsz Hon} and Yu Yu and Dawu Gu",
year = "2016",
doi = "10.1007/978-3-319-40367-0_9",
language = "English",
isbn = "9783319403663",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "134--150",
editor = "Liu, {Joseph K.} and Ron Steinfeld",
booktitle = "Information Security and Privacy",

}

Sun, S-F, Parampalli, U, Yuen, TH, Yu, Y & Gu, D 2016, Efficient completely non-malleable and RKA secure public key encryptions. in JK Liu & R Steinfeld (eds), Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9723, Springer, Switzerland, pp. 134-150, Australasian Conference on Information Security and Privacy 2016, Melbourne, Australia, 4/07/16. https://doi.org/10.1007/978-3-319-40367-0_9

Efficient completely non-malleable and RKA secure public key encryptions. / Sun, Shi-Feng; Parampalli, Udaya; Yuen, Tsz Hon; Yu, Yu; Gu, Dawu.

Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II. ed. / Joseph K. Liu; Ron Steinfeld. Switzerland : Springer, 2016. p. 134-150 (Lecture Notes in Computer Science; Vol. 9723).

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

TY - GEN

T1 - Efficient completely non-malleable and RKA secure public key encryptions

AU - Sun, Shi-Feng

AU - Parampalli, Udaya

AU - Yuen, Tsz Hon

AU - Yu, Yu

AU - Gu, Dawu

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

KW - Chosen-ciphertext attack

KW - Complete non-malleability

KW - Public key encryption

KW - Related-key attack

UR - http://www.scopus.com/inward/record.url?scp=84978872997&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-40367-0_9

DO - 10.1007/978-3-319-40367-0_9

M3 - Conference Paper

SN - 9783319403663

T3 - Lecture Notes in Computer Science

SP - 134

EP - 150

BT - Information Security and Privacy

A2 - Liu, Joseph K.

A2 - Steinfeld, Ron

PB - Springer

CY - Switzerland

ER -

Sun S-F, Parampalli U, Yuen TH, Yu Y, Gu D. Efficient completely non-malleable and RKA secure public key encryptions. In Liu JK, Steinfeld R, editors, Information Security and Privacy: 21st Australasian Conference, ACISP 2016, Melbourne, VIC, Australia, July 4-6, 2016, Proceedings, Part II. Switzerland: Springer. 2016. p. 134-150. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-40367-0_9