با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
Tightly secure signature schemes from the LWE and subset sum assumptions
طرح های امضایی کاملاً امن از مفروضات LWE و زیر مجموعه-2019 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 |
مقاله انگلیسی |
2 |
Generalized public-key cryptography with tight security
رمزنگاری کلید عمومی کلی با تدابیر شدید امنیتی-2019 Tightly secure public-key cryptographic schemes enjoy the advantage that the selection of
the security parameter can be optimal to achieve a certain security level. Security models
in the multi-user setting with corruptions ( MU-C ) consider more realistic threats in practice.
Many effort s have been devoted to constructing tightly MU-C secure schemes. To date, we
have many concrete constructions. Nevertheless, the study on how to generally achieve
tight security in public-key cryptography remains lacking.
In this paper, we take an insight into the key generations in public-key cryptography.
We first generalize the key generation algorithms of traditional schemes and discuss the
requirements of achieving tight security. We notice that for some schemes (e.g. key-unique
schemes), these requirements inherently cannot be satisfied and hence these schemes cannot
achieve tight security. This is in accordance with the impossibility results of tight reductions
by Bader et al. (EUROCRYPT 2016). To further study possible constructions, we extend
the key generations of public-key cryptographic schemes to obtain a different framework.
To demonstrate its applications, we illustrate how to construct tightly secure keyunique
schemes under the extended framework. This circumvents the impossibility results
of tight security for key-unique schemes. Keywords: Public-key cryptography | General construction | Multi-user setting | Tight security |
مقاله انگلیسی |