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 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.
from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2kvJk6l
via IFTTT
Εγγραφή σε:
Σχόλια ανάρτησης (Atom)
Δημοφιλείς αναρτήσεις
-
Publication date: Available online 4 January 2018 Source: European Journal of Radiology Author(s): Peiyao Zhang, Jing Wang, Qin Xu, Zhen...
-
Related Articles Anatomic parameters of the sacral lamina for osteosynthesis in transverse sacral fractures. Surg Radiol Anat....
-
Background Hyperthyroidism is associated with increased thrombotic risk. As contact system activation through formation of neutrophil extrac...
-
Consulting to Finance: How to Network, Tell Your Story, Spin Your Resume, and Dominate Your Investment Banking and Private Equity Interviews...
-
Publication date: March 2017 Source: Anesthesiology Clinics, Volume 35, Issue 1 Author(s): Onyi C. Onuoha, Robert R. Gaiser from #Ale...
-
Abstract Purpose Investigate in patients with metastatic and/or irresectable colorectal cancer treated with systemic treatment with cape...
-
Abstract Objectives (1) To illustrate and describe the main types of pancreatic surgery; (2) to discuss the normal findings after pancre...
-
Medicine by Alexandros G. Sfakianakis,Αλέξανδρος Γ. Σφακιανάκης A Novel Technique for Endoscopic Repair of Large Anterior Skull Base Defect...
Δεν υπάρχουν σχόλια:
Δημοσίευση σχολίου