دانلود و نمایش مقالات مرتبط با Bilinear pairing::صفحه 1
دانلود بهترین مقالات isi همراه با ترجمه فارسی 2

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

نتیجه جستجو - Bilinear pairing

تعداد مقالات یافته شده: 7
ردیف عنوان نوع
1 An Efficient Identity-Based Signature Scheme without Bilinear Pairing for Vehicle-To-Vehicle Communication in VANETs
یک طرح امضایی مبتنی بر هویت کارآمد و بدون جفت دو طرفه برای ارتباط وسیله نقلیه به وسیله نقلیه در VANET-2019
Vehicles exchange traffic-related messages with neighboring vehicles to aid passengers and provide efficient traffic management. This is done via wireless communication channels in Vehicular Ad Hoc Networks (VANETs). Security and privacy issues are a major concern in VANETs. A typical attack consists of a malicious third party modifying and retransmitting intercepted messages. Current state of the art solutions enable a verifier to authenticate the source of received messages as well as to check their integrity before accepting them. However, these solutions do not adequately address the efficiency with which multiple messages are verified in VANETs deployed in high traffic density areas. Due to this, the computational load on a verifier is increased. In this paper, an efficient Identity-Based Signature with Conditional Privacy-Preserving Authentication (IBS-CPPA) scheme based on the Elliptic Curve Cryptography (ECC) and general one-way hash functions for V2V communication is proposed. This scheme supports the batch signature verification method, which enables each vehicle to authenticate a large number of messages at the same time. We provide a security proof of the proposed IBS-CPPA scheme in the random oracle model. The performance evaluation indicates that our scheme is more efficient in terms of computational cost with respect to similar schemes.
Keywords: Privacy-preservation | Identity-based cryptography | Bilinear pairing | Computational cost
مقاله انگلیسی
2 An efficient CPPA scheme for intelligent transportation networks
یک طرح کارآمد CPPA برای شبکه های حمل و نقل هوشمند-2019
To defend intelligent transportation networks’ security and privacy, existing standards employ the Public Key Infrastructure (PKI) authentication framework. However, the high associated PKI computation and communication overheads break ground for utilizing an alternative candidate, the Identity-based Cryptographic (IBC) authentication. Most of the underlined calculations of the IBC approaches rely on the elliptic curves’ pairing operation. Since the pairing function is a complex and computation intensive operation, several studies have developed pairingless IBC authentications and applied the hardware security of tamper-proof devices to secure the cryptographic parameters at user-end. Motivated by this trend, we compose a Pairingless Modified Efficient Conditional Privacy- Preserving Authentication Scheme (PME-CPPAS). Our scheme omits the utilization of the complex pairing operation as well as the demand for expensive tamper-proof devices. When analyzing the performance of the presented design, its effectiveness, in comparison to the available pairing-based and pairingless approaches, is proved in terms of computation complexity, communication overhead, and storage overhead. PME-CPPAS achieves less signing computational cost and comparable verification computational performance.
Keywords: Intelligent transportation/vehicular | networks | Authentication | Conditional privacy | Elliptic curve cryptography | Identity-based signature | Bilinear pairings | Tamper-proof device
مقاله انگلیسی
3 An improved certificateless aggregate signature scheme without bilinear pairings for vehicular ad hoc networks
یک طرح امضایی جمع دارایی دارای قابلیت اطمینان بدون جفت شدن دوقطبی برای شبکه های ادهاک وسایل نقلیه-2019
Certificateless aggregate signature (CL-AS) is a digital signature technique used to achieve improved per- formance in resource-constrained environments like vehicular ad hoc networks (VANETs) by eliminating the certificate issue in the traditional public key cryptography (PKC), addressing the key escrow problem in identity-based PKC, and utilizing the efficiency benefits of aggregate signature. Recently, an efficient CL- AS scheme for VANETs was proposed which the authors claimed to be existentially secure against forgery attacks in the random oracle model. In this paper, the scheme was analyzed and found to be insecure under existing security model. Consequently, we propose a new efficient certificateless aggregate signa- ture scheme for VANETs applications based on elliptic curve cryptography. The proposed scheme does not only meet the privacy and security requirements for VANETs, but supports batch verification, auton- omy, and conditional privacy preservation. In addition, the proposed scheme is provably secure against existential forgery on adaptive chosen message attack in the random oracle model based on the hardness assumption of the elliptic curve discrete logarithm problem. Extensive efficiency analysis demonstrates that the performance of the proposed scheme exceeds those of the recent related schemes in terms of computation cost and communication overhead.
Keywords: Certificateless aggregate signature | Vehicular ad hoc networks (VANETs) | Random oracle | Elliptic curve cryptography | Conditional privacy | Batch verification
مقاله انگلیسی
4 طرح امضای بدون گواهی امن عاری از جفت‌شدگی و قابل‌اعتماد
سال انتشار: 2018 - تعداد صفحات فایل pdf انگلیسی: 18 - تعداد صفحات فایل doc فارسی: 37
طرح امضاء بدون گواهی (CLS) یک روش رمزنگاری قابل‌توجه برای حل مسئله امان سپاری کلیدی در رمزنگاری مبتنی بر هویت (IBC) است. در CLS، کلید خصوصی به‌طورکلی توسط مرکز تولید کلید (KGC) و امضاء کننده محاسبه می‌شود که تضمین می‌کند که هیچ KGC انتقامی، امضای واقعی را جعل نمی‌کند. به‌تازگی تعدادی از طرح‌های CLS با استفاده از جفت سازی دوخطی ارائه شده‌اند و ایمنی آن‌ها را با استفاده از مدل امنیتی استاندارد نشان می‌دهد. به‌خوبی مشخص شده است که یکی از این عملیات جفت سازی نیاز به هزینه‌های محاسباتی بسیار بیشتری نسبت به سایر عملیات رمزنگاری دارد. در این مقاله، ما یک طرح CLS جدید با استفاده از رمزنگاری منحنی بیضوی (ECC) پیشنهاد می‌کنیم که نیازی به عمل جفت سازی دوخطی ندارد. طرح CLS ما به صورت رسمی مورد تجزیه‌وتحلیل قرار گرفته است و ثابت شده است بر اساس عدم قطعیت یك مسئله لگاریتم گسسته منحنی بیضوی (ECDLP) تحت مدل اوراکل تصادفی در برابر حملات نوع I و نوع II امن است. ارزیابی عملکرد نشان می‌دهد که طرح CLS پیشنهادی از سایر طرح‌های CLS رقابتی بهتر است.
واژه‌های کليدی: امضاي ديجيتال | منحني بيضوی | رمزنگاري بدون گواهي | مدل اوراکل تصادفي | امنيت قابل‌اعتماد.
مقاله ترجمه شده
5 Efficient and secure identity-based encryption scheme with equality test in cloud computing
طرح رمزنگاری مبتنی بر هویت کارآمد و مطمئن با آزمون برابری در محاسبات ابری-2017
Efficient searching on encrypted data outsourced to the cloud remains a research challenge. Identity based encryption with equality test (IBEET) scheme has recently been identified as a viable solution, in which users can delegate a trapdoor to the server and the server then searches on user outsourced encrypted data to determine whether two different ciphertexts are encryptions of the same plaintext. Such schemes are, unfortunately, inefficient particularly for deployment on mobile devices (with limited power/battery life and computing capacity). In this paper, we propose an efficient IBEET scheme with bilinear pairing, which reduces the need for time-consuming HashToPoint function. We then prove the security of our scheme for one-way secure against chosen identity and chosen ciphertext attacks (OW–ID–CCA) in the random oracle model (ROM). The performance evaluation of our scheme demonstrates that in comparison to the scheme of Ma (2016), our scheme achieves a reduction of 36.7% and 39.24% in computation cost during the encryption phase and test phase, respectively, and that our scheme is suitable for (mobile) cloud deployment.
Keywords: Identity-based encryption | Equality test | Searchable encryption | Cloud computing | Provable security
مقاله انگلیسی
6 Publicly verifiable databases with efficient insertion/deletion operations
پایگاه داده های قابل اطمینان قابل اعتماد با عملیات درج / حذف کارآمد-2017
The notion of verifiable database (VDB) enables a resource-constrained client to securely outsource a very large database to an untrusted server and the client could later retrieve a database record and update it efficiently. Meanwhile, any tampering with the database by the server will be detected by the client. We argue that all existing VDB schemes can only support the updating operation called replacement. That is, the client can efficiently update a data record by assigning a new value. However, the proposed solutions are not applicable for other updating operations such as insertion and deletion. In this paper, we first propose a new VDB scheme that supports all updating operations of replacement, deletion, and insertion by incorporating the techniques of commitment binding and hierarchical commitment. Security evaluation shows that the proposed construction can achieve the desired security properties in the standard computational Diffie–Hellman assumption.
Keywords: Verifiable database | Vector commitment | Public verifiability | Outsourcing of storage | Bilinear pairings
مقاله انگلیسی
7 A lightweight attribute-based encryption scheme for the Internet of Things
طرح رمزگذاری سبک مبتنی بر ویژگی برای اینترنت اشیاء-2015
Article history:Received 30 April 2014 Received in revised form 2 August 2014Accepted 8 October 2014Available online 18 October 2014Keywords:Internet of Things Attribute-based encryption Elliptic curve cryptographyDecision Diffie–Hellman problem Selective-set modelInternet of Things (IoT) is an emerging network paradigm, which realizes the interconnections among the ubiquitous things and is the foundation of smart society. Since IoT are always related to user’s daily life or work, the privacy and security are of great importance. The pervasive, complex and heterogeneous properties of IoT make its security issues very challenging. In addition, the large number of resources- constraint nodes makes a rigid lightweight requirement for IoT security mechanisms. Presently, the attribute-based encryption (ABE) is a popular solution to achieve secure data transmission, storage and sharing in the distributed environment such as IoT. However, the existing ABE schemes are based on expensive bilinear pairing, which make them not suitable for the resources-constraint IoT applications. In this paper, a lightweight no-pairing ABE scheme based on elliptic curve cryptography (ECC) is proposed to address the security and privacy issues in IoT. The security of the proposed scheme is based on the ECDDH assumption instead of bilinear Diffie–Hellman assumption, and is proved in the attribute based selective-set model. By uniformly determining the criteria and defining the metrics for measuring the communication overhead and computational overhead, the comparison analyses with the existing ABE schemes are made in detail. The results show that the proposed scheme has improved execution efficiency and low communication costs. In addition, the limitations and the improving directions of it are also discussed in detail.© 2014 Elsevier B.V. All rights reserved.
Keywords: Internet of Things | Attribute-based encryption | Elliptic curve cryptography | Decision Diffie–Hellman problem | Selective-set model
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 1289 :::::::: بازدید دیروز: 0 :::::::: بازدید کل: 1289 :::::::: افراد آنلاین: 7