کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4952242 | 1442022 | 2017 | 35 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Strongly full-hiding inner product encryption
ترجمه فارسی عنوان
رمزنگاری محصول داخلی کاملا مخفی شده است
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
رمزگذاری عملکردی، محصول داخلی، حریم خصوصی عملکرد گروه بیلیار نامتقارن،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
Functional encryption (FE) is a noble cryptographic paradigm which enables delegation of computations on private sensitive data to external untrustworthy entities. In FE, it is possible to derive restricted decryption keys, also called functional keys, corresponding to specific functions from a master secret key. Such a functional key allows the evaluation of its associated functionality on encrypted data-items, but does not help to extract any additional information about the encrypted data. While confidentiality of the encrypted data is the prime security concern in FE, various scenarios of computation delegation, especially when the delegated functionalities themselves involve sensitive informations, privacy must also be ensured for the functions embedded within the issued functional keys. This paper presents a non-generic and simple private key FE scheme for the inner product functionality, also known as inner product encryption (IPE). In contrast to other similar constructions, our IPE scheme achieves the strongest indistinguishability-based notion of combined data and function privacy in the private key setting, termed as the full-hiding security, in the standard model without employing any heavy-duty cryptographic tool or non-standard complexity assumption. Our construction is built in the asymmetric bilinear pairing group setting of prime order. The security of our scheme is based on the well-studied Symmetric External Diffie-Hellman (SXDH) assumption.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 667, 8 March 2017, Pages 16-50
Journal: Theoretical Computer Science - Volume 667, 8 March 2017, Pages 16-50
نویسندگان
Pratish Datta, Ratna Dutta, Sourav Mukhopadhyay,