به جمع مشترکان مگیران بپیوندید!

تنها با پرداخت 70 هزارتومان حق اشتراک سالانه به متن مقالات دسترسی داشته باشید و 100 مقاله را بدون هزینه دیگری دریافت کنید.

برای پرداخت حق اشتراک اگر عضو هستید وارد شوید در غیر این صورت حساب کاربری جدید ایجاد کنید

عضویت
جستجوی مقالات مرتبط با کلیدواژه

elliptic curve cryptography

در نشریات گروه برق
تکرار جستجوی کلیدواژه elliptic curve cryptography در نشریات گروه فنی و مهندسی
تکرار جستجوی کلیدواژه elliptic curve cryptography در مقالات مجلات علمی
  • Iman Jafarian, Siavash Khorsandi *

    The Internet of Things has significantly improved healthcare with its promise of transforming technological, social, and economic perspectives. Medical devices with wireless internet access enable remote monitoring of patients, and collectively, these increasingly smart and connected medical devices can provide unique and contemporary medical and health services envisioned to be deployed in a large-scale fashion. For this, medical data and records generally are collected, stored, and shared through open-air wireless networks and public cloud infrastructures, which poses severe challenges regarding the confidentiality of sensitive medical data while maintaining low service overhead and system complexity. This paper presents a novel scheme for secure cloud-assisted Internet of Medical Things connecting patients/smart medical devices to smart applications/medical service providers in a scalable one-to-many fashion to make novel medical services practical. The proposed scheme uses index-based searchable encryption for data screening without decryption. It uses a low-overhead proxy re-encryption scheme for secure data sharing through public clouds

    Keywords: Proxy Re-encryption, Elliptic Curve Cryptography, Secure Sharing, E-Health, Internet of Medical Things
  • Afshin Karampour *, Maede Ashouri-Talouki, Behrouz Tork Ladani
    Smart grids using information technology (IT) and communication networks control smart home appliances to reduce costs and increase reliability and transparency. Preserving the privacy of the user data is one of the biggest challenges in smart grid research; by disclosing user-related data, an internal or external adversary can understand the habits and behavior of the users. A solution to address this challenge is, however, a data aggregation mechanism in which the aggregated data of all of the users in a residential area. The security and efficiency of the data aggregation approach are important. The drawback of the previous works is leaking fine-grained user data or the high computation and communication overhead. In this paper, we present an efficient privacy-preserving data-aggregation protocol, called PPDA, based on the Elliptic Curve Cryptography (ECC) and Anonymous Veto network protocol. The PPDA protocol aggregates metering data efficiently and securely so that it becomes applicable for resource-constraint metering devices. We also present an improved multi-cycle proposal of PPDA, called MC-PPDA. In the improved approach, the system initialization step runs only at the first cycle of the protocol which increases the efficiency of the protocol. Evaluation results show that the proposed approaches preserve the privacy of the fine-grained user data against an internal and external adversary; the improved multi-cycle approach is also secure against collusion. Compared to the previous approaches, the proposed approaches incur less computation and communication overhead.
    Keywords: smart grid, Smart Meter, data aggregation, Privacy-Preserving, Elliptic Curve Cryptography, AV-Net Mask
  • فهیمه احمدی، مرتضی نیکوقدم*

    در سال های اخیر شبکه های سیار سراسری رشد سریع و چشم گیری را به خود اختصاص داده اند و دستگاه های تلفن همراه هوشمند، به ابزاری کاربردی و حتی حیاتی برای کاربران تبدیل شده است. همچنین، خدمات رومینگ دستگاه های تلفن همراه هوشمند این امکان را فراهم می آورد تا کاربران بتوانند در خارج از محدوده جغرافیایی تحت پوشش شبکه اپراتور مرجع و با استفاده از شبکه اپراتورهای کمکی، اطلاعات خود را با دیگران به اشتراک بگذارند. در این مقاله، ابتدا اثبات می شود که روش هایی که تاکنون در این زمینه پیشنهادشده اند نه تنها در مقابل برخی از حملات ازجمله حمله تکرار، حمله داخلی، حمله جعل هویت کاربر، اپراتور مرجع و اپراتور کمکی و حمله منع سرویس آسیب پذیرند، بلکه برخی ویژگی های امنیتی ازجمله گمنامی و عدم ردیابی کاربر، احراز هویت متقابل، محرمانگی کامل روبه جلو و امنیت کلید نشست را فراهم نمی آورند. سپس، یک طرح احراز هویت مبتنی بر کارت هوشمند برای شبکه های سیار سراسری ارائه می شود که نه تنها ضعف های امنیتی موجود در طرح های پیشین را برطرف می سازد، بلکه احراز هویت متقابل میان هر سه موجودیت (کاربر، اپراتور مرجع و اپراتور کمکی) را به همراه حفظ گمنامی کاربر نیز فراهم می کند. درنهایت، به مقایسه امنیت و کارایی طرح پیشنهادی با طرح های پیشین پرداخته شده است و نشان داده می شود که طرح پیشنهادی از امنیت و کارایی قابل قبولی برخوردار است.

    کلید واژگان: شبکه های سیار سراسری، خدمات رومینگ، توافق کلید، احراز هویت متقابل، گمنامی، غیرقابل ردیابی، کارت هوشمند، بیومتریک، رمزنگاری منحنی بیضوی
    F. Ahmadi, M. Nikooghadam*

    In recent years, the global mobility networks have grown rapidly and significantly and the smart phones have become practical and even vital tools for users. Furthermore, the roaming service of smart phones provides a possibility for users to share their information with others outside of the geographical region of home agent with the aid of foreign agent. In this paper, first, we prove that the previously-published schemes in this field not only are vulnerable to some known attacks, such as the reply attack, insider attack, user, home agent, and foreign agent impersonation attacks, and Denial of Service attack, but also some security features such as user anonymity, untraceability, mutual authentication, perfect forward secrecy, and session key security are not provided. Second, an authentication scheme based on smart card is presented for the global mobility networks, which not only can solve the security weaknesses of the previous schemes, but also can provide the anonymity and mutual authentication between the three entities of user, home agent, and foreign agent. Finally, security and efficiency of the proposed scheme are compared with the previously-proposed schemes. The results demonstrate that the proposed scheme provides a proper level of both security and efficiency.

    Keywords: Global mobility networks, Roaming, Key agreement, Mutual authentication, Anonymity, Untraceability, Smart card, Biometric, Elliptic curve cryptography
  • Bahram Rashidi, Reza Rezaeian Farashahi, Sayed Masoud Sayedi
    This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The parallel computation provides regular and low-cost structure with low critical path delay. In addition، the pipelining technique is applied to the proposed structures to shorten the critical path and to perform the computation in two clock cycles. The implementations of the proposed methods over the binary extension fields GF (2163) and GF (2233) have been successfully verified and synthesized using Xilinx ISE 11 by Virtex-4، XC4VLX200 FPGA.
    Keywords: Bit, parallel Multiplier, Elliptic Curve Cryptography, Trinomials, Pentanomials, Pipelining
  • M. Masoumi, H. Mahdizadeh
    A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical paths. The results we obtained show that with G = 55 our proposed design is able to compute GF(2163) elliptic curve scalar multiplication in 9.6 μs with the maximum achievable frequency of 250 MHz on Xilinx Virtex-4 (XC4VLX200), where G is the digit size of the underlying digit-serial finite field multiplier. Another implementation variant for less resource consumption is also proposed. With G=33, the design performs the same operation in 11.6 μs at 263 MHz on the same platform. The results of synthesis show that in the first implementation 17929 slices or 20% of the chip area is occupied which makes it suitable for speed critical cryptographic applications while in the second implementation 14203 slices or 16% of the chip area is utilized which makes it suitable for applications that may require speed-area trade-off. The new design shows superior performance compared to the previously reported designs.
    Keywords: Elliptic Curve Cryptography, Scalar Point Multiplication, FPGA Implementation, Finite, Field Arithmetic
نکته
  • نتایج بر اساس تاریخ انتشار مرتب شده‌اند.
  • کلیدواژه مورد نظر شما تنها در فیلد کلیدواژگان مقالات جستجو شده‌است. به منظور حذف نتایج غیر مرتبط، جستجو تنها در مقالات مجلاتی انجام شده که با مجله ماخذ هم موضوع هستند.
  • در صورتی که می‌خواهید جستجو را در همه موضوعات و با شرایط دیگر تکرار کنید به صفحه جستجوی پیشرفته مجلات مراجعه کنید.
درخواست پشتیبانی - گزارش اشکال