عنوان انگلیسی مقاله:
Tightly secure signature schemes from the LWE and subset sum assumptions
ترجمه فارسی عنوان مقاله:
طرح های امضایی کاملاً امن از مفروضات LWE و زیر مجموعه
Sciencedirect - Elsevier - Theoretical Computer Science, 795 (2019) 326–344: 10:1016/j:tcs:2019:07:015
XiaoZhanga, ShengliLiua,b,c,∗, JiaxinPand, DawuGua
In this paper, we study how to construct tightlysecure signature scheme against adaptive chosen message attacks in the multi-user setting (i.e., tightly euf-m-cmasecure signature) from the learning with errors (LWE) assumptions. More precisely, we propose a modular framework of euf-m-cmasecure signature from a weak partial one-time signature (POS) scheme that is secure only against random message attacks in the multi-user setting (i.e., euf-m-rmasecure) and possesses imperfect correctness. By instantiating the weak POS with the LWE assumption, we obtain the first LWE-based tightlyeuf-m-cmasecure signature scheme in the multi-user setting. Moreover, we also present an instantiation of the weak POS based on the Subset Sum (SS) assumption, and again we obtain the first almost tightlyeuf-cmasecure signature scheme from the SS assumption in the single-user setting. All our security reductions are tight and without random oracles.
Keywords: Digital signature | Tight security | Lattice-based cryptography | LWE | Subset Sum