دانلود و نمایش مقالات مرتبط با رمزنگاری عمومی کلید::صفحه 1
دانلود بهترین مقالات isi همراه با ترجمه فارسی 2

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - رمزنگاری عمومی کلید

تعداد مقالات یافته شده: 2
ردیف عنوان نوع
1 Somewhat semantic secure public key encryption with filtered-equality-test in the standard model and its extension to searchable encryption
رمزنگاری عمومی کلید امنیتی معقولانه با تست برابری فیلتر شده در مدل استاندارد و گسترش آن به رمزنگاری قابل جستجو-2017
Public key encryption with equality test (PKE-ET) is a public key encryption with an extra functionality, so-called ‘equality test’. An authorized third party can verify the equivalence between two ciphertexts encrypted under different public keys, while the decryption keeps unavailable. However, the privacy of most existing PKE-ET schemes drop to one-way security owing to the ‘equality test’ functionality. In this work, we propose a novel architecture called filtered equality test (FET), which ‘filtered’ denotes only few receiver-selected messages can be equality tested. In such model, we propose an equality test scheme, PKE-FET, which is the first one to be proved (somewhat) semantic secure. The concrete PKE-FET scheme and its rigorous security proof in the standard model are proposed. Furthermore, FET is also applied to construct a searchable encryption named PE MKS, which is inherently proved semantic secure (so called the indistinguishability against chosen keyword attacks) in the standard model.
Keywords: Computation over ciphertext | Equality test | Searchable encryption | Semantic security | Standard model
مقاله انگلیسی
2 Naor–Yung paradigm with shared randomness and applications
نمونه Naor–Yung با غیر مترقبه بودن و برنامه های کاربردی مشترک-2017
Article history:Received 18 September 2016Received in revised form 17 May 2017 Accepted 21 June 2017Available online xxxx Communicated by G. PersianoKeywords:Public-key cryptography KDM securityLeakage Subset SumThe Naor–Yung paradigm [63] allows to generically boost security under chosen-plaintext attacks (CPA) to security against chosen-ciphertext attacks (CCA) for public-key encryption (PKE) schemes. The main idea is to encrypt the plaintext twice (under independent public keys), and to append a non-interactive zero-knowledge (NIZK) proof that the two ciphertexts indeed encrypt the same message. Later work by Camenisch, Chandran, and Shoup [32] and Naor and Segev [28,30] established that the very same technique can also be used in the settings of key-dependent message (KDM) and key-leakage attacks (respectively).In this paper we study the conditions under which the two cipher texts in the Naor–Yung construction can share the same random coins. We find that this is possible, provided that the underlying PKE scheme meets an additional simple property. The motivation for re-using the same random coins is that this allows to design much more efficient NIZK proofs. We showcase such an improvement in the random oracle model, under standard complexity assumptions including Decisional Diffie–Hellman, Quadratic Residuosity, and Subset Sum. The length of the resulting cipher texts is reduced by 50%, yielding truly efficient PKE schemes achieving CCA security under KDM and key-leakage attacks.As an additional contribution, we design the first PKE scheme whose CPA security under KDM attacks can be directly reduced to (low-density instances of) the Subset Sum assumption. Our PKE scheme supports key-dependent messages computed via any affine function of the secret key. 2017 Elsevier B.V. All rights reserved.
Keywords:Public-key cryptography | KDM security | Leakage | Subset Sum
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 2704 :::::::: بازدید دیروز: 3097 :::::::: بازدید کل: 36971 :::::::: افراد آنلاین: 52