View : 131 Download: 0

A lattice attack on homomorphic NTRU with non-invertible public keys

Title
A lattice attack on homomorphic NTRU with non-invertible public keys
Authors
Ahn S.Lee H.-S.Lim S.Yie I.
Ewha Authors
이향숙
SCOPUS Author ID
이향숙scopus
Issue Date
2018
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN
0302-9743JCR Link
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 10631 LNCS, pp. 248 - 254
Keywords
Homomorphic NTRUIND-CPA securityLatticesLLL algorithmNTRU
Publisher
Springer Verlag
Indexed
SCOPUS scopus
Document Type
Conference Paper
Abstract
In 2011, Stehlé and Steinfeld modified the original NTRU to get a provably IND-CPA secure NTRU under the hardness assumption of standard worst-case problems over ideal lattices. In 2012, López-Alt et al. proposed the first multikey fully homomorphic encryption scheme based on the IND-CPA secure NTRU. Interestingly, this homomorphic NTRU and subsequent homomorphic variants of NTRU removed the condition ‘invertible public key’ of the underlying IND-CPA secure NTRU. In this paper, we investigate the security influence of using non-invertible public key in the homomorphic NTRU. As a result, we present how to mount a lattice attack to message recovery for the homomorphic NTRU when the public key is non-invertible. Our result suggests that using invertible public keys in the homomorphic NTRU is necessary for its security. © Springer International Publishing AG, part of Springer Nature 2018.
DOI
10.1007/978-3-319-89500-0_22
ISBN
9783319894997
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE