Lattice-based completely non-malleable PKE in the standard model (poster)

Reza Sepahi; Ron Steinfeld; Josef Pieprzyk

doi:10.1007/978-3-642-22497-3_26

Lattice-based completely non-malleable PKE in the standard model (poster)

Reza Sepahi^*, Ron Steinfeld, Josef Pieprzyk

^*Corresponding author for this work

School of Computing

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

2 Citations (Scopus)

Abstract

This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.

Original language	English
Title of host publication	Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings
Editors	Udaya Parampalli, Philip Hawkes
Place of Publication	Heidelberg
Publisher	Springer, Springer Nature
Pages	407-411
Number of pages	5
Volume	6812 LNCS
ISBN (Print)	9783642224966
DOIs	https://doi.org/10.1007/978-3-642-22497-3_26
Publication status	Published - 2011
Event	16th Australasian Conference on Information Security and Privacy, ACISP 2011 - Melbourne, VIC, Australia Duration: 11 Jul 2011 → 13 Jul 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6812 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	16th Australasian Conference on Information Security and Privacy, ACISP 2011
Country/Territory	Australia
City	Melbourne, VIC
Period	11/07/11 → 13/07/11

Access to Document

10.1007/978-3-642-22497-3_26

Cite this

Sepahi, R., Steinfeld, R., & Pieprzyk, J. (2011). Lattice-based completely non-malleable PKE in the standard model (poster). In U. Parampalli, & P. Hawkes (Eds.), Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings (Vol. 6812 LNCS, pp. 407-411). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6812 LNCS). Springer, Springer Nature. https://doi.org/10.1007/978-3-642-22497-3_26

Sepahi, Reza ; Steinfeld, Ron ; Pieprzyk, Josef. / Lattice-based completely non-malleable PKE in the standard model (poster). Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. editor / Udaya Parampalli ; Philip Hawkes. Vol. 6812 LNCS Heidelberg : Springer, Springer Nature, 2011. pp. 407-411 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2557455b7ad04967b90e3ccb287ee64a,

title = "Lattice-based completely non-malleable PKE in the standard model (poster)",

abstract = "This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.",

author = "Reza Sepahi and Ron Steinfeld and Josef Pieprzyk",

year = "2011",

doi = "10.1007/978-3-642-22497-3_26",

language = "English",

isbn = "9783642224966",

volume = "6812 LNCS",

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

publisher = "Springer, Springer Nature",

pages = "407--411",

editor = "Udaya Parampalli and Philip Hawkes",

booktitle = "Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings",

address = "United States",

note = "16th Australasian Conference on Information Security and Privacy, ACISP 2011 ; Conference date: 11-07-2011 Through 13-07-2011",

}

Sepahi, R, Steinfeld, R & Pieprzyk, J 2011, Lattice-based completely non-malleable PKE in the standard model (poster). in U Parampalli & P Hawkes (eds), Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. vol. 6812 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6812 LNCS, Springer, Springer Nature, Heidelberg, pp. 407-411, 16th Australasian Conference on Information Security and Privacy, ACISP 2011, Melbourne, VIC, Australia, 11/07/11. https://doi.org/10.1007/978-3-642-22497-3_26

Lattice-based completely non-malleable PKE in the standard model (poster). / Sepahi, Reza; Steinfeld, Ron; Pieprzyk, Josef.
Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. ed. / Udaya Parampalli; Philip Hawkes. Vol. 6812 LNCS Heidelberg: Springer, Springer Nature, 2011. p. 407-411 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6812 LNCS).

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

TY - GEN

T1 - Lattice-based completely non-malleable PKE in the standard model (poster)

AU - Sepahi, Reza

AU - Steinfeld, Ron

AU - Pieprzyk, Josef

PY - 2011

Y1 - 2011

N2 - This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.

AB - This paper presents ongoing work toward constructing efficient completely non-malleable public-key encryption scheme based on lattices in the standard (common reference string) model. An encryption scheme is completely non-malleable if it requires attackers to have negligible advantage, even if they are allowed to transform the public key under which the related message is encrypted. Ventre and Visconti proposed two inefficient constructions of completely non-malleable schemes, one in the common reference string model using non-interactive zero-knowledge proofs, and another using interactive encryption schemes. Recently, two efficient public-key encryption schemes have been proposed, both of them are based on pairing identity-based encryption.

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

U2 - 10.1007/978-3-642-22497-3_26

DO - 10.1007/978-3-642-22497-3_26

M3 - Conference proceeding contribution

AN - SCOPUS:79960272325

SN - 9783642224966

VL - 6812 LNCS

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

SP - 407

EP - 411

BT - Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings

A2 - Parampalli, Udaya

A2 - Hawkes, Philip

PB - Springer, Springer Nature

CY - Heidelberg

T2 - 16th Australasian Conference on Information Security and Privacy, ACISP 2011

Y2 - 11 July 2011 through 13 July 2011

ER -

Sepahi R, Steinfeld R, Pieprzyk J. Lattice-based completely non-malleable PKE in the standard model (poster). In Parampalli U, Hawkes P, editors, Information Security and Privacy - 16th Australasian Conference, ACISP 2011, Proceedings. Vol. 6812 LNCS. Heidelberg: Springer, Springer Nature. 2011. p. 407-411. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-22497-3_26

Lattice-based completely non-malleable PKE in the standard model (poster)

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this