Efficient completely non-malleable and RKA secure public key encryptions

Shi Feng Sun; Udaya Parampalli; Tsz Hon Yuen; Yu Yu; Dawu Gu

doi:10.1007/978-3-319-40367-0_9

Efficient completely non-malleable and RKA secure public key encryptions

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

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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 language	English
Title of host publication	Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings
Editors	Joseph K. Liu, Ron Steinfeld
Publisher	Springer Verlag
Pages	134-150
Number of pages	17
ISBN (Print)	9783319403663
DOIs	https://doi.org/10.1007/978-3-319-40367-0_9
State	Published - 2016
Externally published	Yes
Event	21st Australasian Conference on Information Security and Privacy, ACISP 2016 - Melbourne, Australia Duration: 4 Jul 2016 → 6 Jul 2016

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9723
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	21st Australasian Conference on Information Security and Privacy, ACISP 2016
Country/Territory	Australia
City	Melbourne
Period	4/07/16 → 6/07/16

Keywords

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

Access to Document

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

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, Proceedings (pp. 134-150). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9723). Springer Verlag. https://doi.org/10.1007/978-3-319-40367-0_9

Sun, Shi Feng ; Parampalli, Udaya ; Yuen, Tsz Hon et al. / Efficient completely non-malleable and RKA secure public key encryptions. Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings. editor / Joseph K. Liu ; Ron Steinfeld. Springer Verlag, 2016. pp. 134-150 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b6be58e3468b46c4b3c9628d0ebb71c9,

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 = "Sun, \{Shi Feng\} and Udaya Parampalli and Yuen, \{Tsz Hon\} and Yu Yu and Dawu Gu",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 21st Australasian Conference on Information Security and Privacy, ACISP 2016 ; Conference date: 04-07-2016 Through 06-07-2016",

year = "2016",

doi = "10.1007/978-3-319-40367-0\_9",

language = "英语",

isbn = "9783319403663",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "134--150",

editor = "Liu, \{Joseph K.\} and Ron Steinfeld",

booktitle = "Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings",

address = "德国",

}

Sun, SF, 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, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9723, Springer Verlag, pp. 134-150, 21st Australasian Conference on Information Security and Privacy, ACISP 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 et al.
Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings. ed. / Joseph K. Liu; Ron Steinfeld. Springer Verlag, 2016. p. 134-150 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9723).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

N1 - Publisher Copyright: © Springer International Publishing Switzerland 2016.

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 - https://www.scopus.com/pages/publications/84978872997

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

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

M3 - 会议稿件

AN - SCOPUS:84978872997

SN - 9783319403663

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 134

EP - 150

BT - Information Security and Privacy - 21st Australasian Conference, ACISP 2016, Proceedings

A2 - Liu, Joseph K.

A2 - Steinfeld, Ron

PB - Springer Verlag

T2 - 21st Australasian Conference on Information Security and Privacy, ACISP 2016

Y2 - 4 July 2016 through 6 July 2016

ER -

Sun SF, 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, Proceedings. Springer Verlag. 2016. p. 134-150. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-40367-0_9

Efficient completely non-malleable and RKA secure public key encryptions

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this