![](/images/graphics-bg.png)
Security Analysis of a Certificateless Signature from Lattices
Joint Authors
Chang, Seunghwan
Lee, Hyang-Sook
Lee, Juhee
Lim, Seongan
Source
Security and Communication Networks
Issue
Vol. 2017, Issue 2017 (31 Dec. 2017), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2017-01-26
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Information Technology and Computer Science
Abstract EN
Tian and Huang proposed a lattice-based CLS scheme based on the hardness of the SIS problem and proved, in the random oracle model, that the scheme is existentially unforgeable against strong adversaries.
Their security proof uses the general forking lemma under the assumption that the underlying hash function H is a random oracle.
We show that the hash function in the scheme is neither one-way nor collision-resistant in the view of a strong Type 1 adversary.
We point out flaws in the security arguments and present attack algorithms that are successful in the strong Type 1 adversarial model using the weak properties of the hash function.
American Psychological Association (APA)
Chang, Seunghwan& Lee, Hyang-Sook& Lee, Juhee& Lim, Seongan. 2017. Security Analysis of a Certificateless Signature from Lattices. Security and Communication Networks،Vol. 2017, no. 2017, pp.1-7.
https://search.emarefa.net/detail/BIM-1202867
Modern Language Association (MLA)
Chang, Seunghwan…[et al.]. Security Analysis of a Certificateless Signature from Lattices. Security and Communication Networks No. 2017 (2017), pp.1-7.
https://search.emarefa.net/detail/BIM-1202867
American Medical Association (AMA)
Chang, Seunghwan& Lee, Hyang-Sook& Lee, Juhee& Lim, Seongan. Security Analysis of a Certificateless Signature from Lattices. Security and Communication Networks. 2017. Vol. 2017, no. 2017, pp.1-7.
https://search.emarefa.net/detail/BIM-1202867
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1202867