sam jabbehdari
-
Protecting sensitive data is crucial in various fields, including Information Technologies, Network Security, and healthcare records. Implementing precise access policies for encrypted data is vital in large networks. Attribute-Based Encryption (ABE) emerges as a solution to this challenge, enabling encryption and access control simultaneously. With the increasing significance of quantum-safe measures due to advancements in quantum computing, there is a growing need for quantum-resistant access control mechanisms for encrypted data, as addressed by Lattice-Based Attribute-Based Encryption.However, some existing Lattice-Based ABE schemes lack robust support for fine-grained access policies. In this paper, we present an enhancement to a Key Policy Attribute-Based Encryption (ABE) scheme to not only accommodate threshold gates but also any boolean circuits. Our proposed scheme's security is grounded in the Learning with Errors (LWE) assumption within the selective security model under the Indistinguishable CPA game. Importantly, the scheme is well-suited for the Disjunctive Normal Form (DNF) representation of boolean functions, offering enhanced flexibility and security in access control mechanisms for encrypted data.
Keywords: Attribute-Based Encryption(ABE), Learning With Errors(LWE), Access Policy, Key Policy Attribute-Based Encryption(KP-ABE), Post-Quantum Attribute-Based Encryption(PQ-ABE), Disjunctive Normal Form (DNF) -
In this study, an optimization algorithm based on the generalized Laguerre polynomials (GLPs) as the basis functions and the Lagrange multipliers is presented to obtain approximate solution of nonlinear fractional optimal control problems. The Caputo fractional derivatives of GLPs is constructed. The operational matrices of the Caputo and ordinary derivatives are introduced. The established scheme transforms obtaining the solution of such problems into finding the solution of algebraic systems of equations by approximating the state and control variables using the mentioned basis functions. The method is very accurate and is computationally very attractive. Examples are included to provide the capacity of the proposal method.
Keywords: Generalized Laguerre Polynomials, Operational Matrix, Optimization Algorithm, Nonlinear Fractional Optimal Control Problems, Coefficients, Parameters -
Applying access control to encrypted data is a crucial aspect of network security. Although Attribute-Based Encryption (ABE) provides a suitable solution, it comes with limitations, primarily its high computational complexity due to the use of pairing operations. In this paper, we propose the first attribute-based encryption scheme based on RSA encryption, which is pairing-free and more efficient than previous pairing-based approaches. This scheme is particularly well-suited for lightweight applications such as those in the Internet of Things (IoT).
The proposed encryption scheme is a Key-Policy Attribute-Based Encryption (KP-ABE) that allows its access policy to be any Boolean function in disjunctive normal form (DNF). Our scheme also addresses the challenge of key revocation, which is often problematic in ABE schemes. The key advantages of our scheme are its efficiency and simplicity compared to other ABE schemes, which typically rely on complex pairing operations. Additionally, we present an Attribute-Based Signature (ABS) scheme based on RSA.Keywords: Efficiency, RSA Encryption, Attribute-Based Encryption, Key Policy, Revocation, Access Policy, Attribute-Based Signature, Lightweight -
In recent years, the problem of online data and information security has been increasingly serious and prevalent. Security issues are resolved via cryptography. Access control over the encrypted messages is necessary for some applications, therefore message encryption cannot simply achieve the stated aims. To achieve these requirements, attribute-based encryption (ABE) is used. This type of encryption provides both security and access structure for the network users simultaneously. Fuzzy Identity-Based Encryption (FIBE) is a special mode of ABE that provides a threshold access structure for the users. This threshold value is set by the authority for users, which is always fixed and cannot be changed. So, the sender (encryptor) will not play a role in determining the threshold value. The mentioned issue exists also in Key Policy Attribute Based Encryption (KP-ABE) schemes. In this paper, we present a FIBE scheme in addition to the authority, the sender also plays a role in determining the threshold value. Thus, the policy will be more flexible than previous FIBE schemes in that the threshold value is selected only by the authority. We can call the proposed scheme a dual-policy ABE. The proposed technique for flexibility of threshold value can be applied in most of exist KP-ABE schemes. We use the (indistinguishable) selective security model for a security proof. The hardness assumption that we use is the modified bilinear decision Diffie-Hellman problem.Keywords: Attribute-based encryption (ABE), Secret Sharing multiplication, Fuzzy Identity-Based Encryption (FIBE), fine-grained access policy, Threshold value flexibility
-
—In order to provide access control on encrypted data, Attribute-based encryption (ABE) defines each user using a set of attributes. Fuzzy identity-based encryption (FIBE) is a variant of ABE that allows for a threshold access structure for users. To address the potential threat posed by future quantum computers, this paper presents a postquantum fuzzy IBE scheme based on lattices. However, current lattice-based ABE schemes face challenges related to computational complexity and the length of ciphertext and keys. This paper aims to improve the performance of an existing fuzzy IBE scheme by reducing key length and computational complexity during the encryption phase. While negative attributes are not utilized in our scheme, we prove its security under the learning with error (LWE) hard problem assumption in the selective security model. These improvements have significant implications for the field of ABE.
Keywords: Attribute-Based Encryption (ABE), Fuzzy Identity-Based Encryption (FIBE), policy, access structure, lattice, Learning with Errors (LWE) -
امروزه میلیاردها دستگاه از طریق اینترنت اشیا و در اغلب موارد از طریق ارتباطات ناامن به هم متصل شده اند، بنابراین مسایل امنیتی و حریم خصوصی این دستگاه ها به عنوان یک نگرانی عمده مطرح است. با توجه به محدودیت منابع دستگاه های اینترنت اشیا، راه حل های امنیتی این محیط از نظر پردازش و حافظه باید امن و سبک وزن باشند. با این حال، بسیاری از راه حل های امنیتی موجود به طور خاص در زمینه احراز هویت به دلیل محاسبات زیاد برای اینترنت اشیا مناسب نیستند و نیاز به یک پروتکل احراز هویت سبک وزن برای دستگاه های اینترنت اشیا احساس می شود. در این مقاله، یک پروتکل احراز هویت سبک وزن متقابل بین گره ها با منابع محدود و سرور در اینترنت اشیا معرفی شده است که از اولویت بندی گره ها بر اساس نرخ ترافیک استفاده می کند. این طرح به دلیل استفاده از عملیات XOR و Hash سبک می باشد. طرح پیشنهادی در برابر حملات سایبری مانند استراق سمع و حمله تلاش مجدد مقاوم است و همچنین با استفاده از ابزار AVISPA و در مدل تهدید Dolev-Yao امن می باشد. ریسک های امنیتی این روش در مقایسه با روش های سبک وزن دیگر کم است. در ضمن طرح پیشنهادی باعث کاهش هزینه محاسباتی، حفظ حریم خصوصی از طریق گمنامی گره ها و فراهم آوردن رازداری رو به جلو می شود. در روش ما، هزینه زمانی احراز هویت نسبت به روش های بررسی شده 15% کاهش یافته است.
کلید واژگان: احراز هویت سبک وزن، احراز هویت مداوم، اینترنت اشیا، حریم خصوصیToday, billions of devices are connected via the Internet of Things, often through insecure communications. Therefore, security and privacy issues of these devices are a major concern. Since devices in IoT are typically resource-constrained devices, the security solutions of this environment in terms of processing and memory must be secure and lightweight. However, many existing security solutions are not particularly suitable for IoT due to high computation. So there is a need for a lightweight authentication protocol for IoT devices. In this paper, a mutual lightweight authentication protocol between nodes with limited resources and IoT servers is introduced that uses node prioritization based on traffic rates. This scheme is light due to the use of lightweight XOR and Hash operations. The proposed is resistant to cyber-attacks such as eavesdropping attack, and replay attack. The proposed is also secure using the AVISPA tool in the Dolev-Yao threat model. The security risks of this scheme are low compared to other lightweight methods. In addition, the proposal is compared with existing authentication schemes reduces the computational cost, protects privacy through anonymity of nodes, and provides forward secrecy. In our method, the execute time of authentication is reduced by 15% compared to the other methods.
Keywords: Lightweight authentication, mutual authentication, Internet of things, privacy key agreement -
VANETs are oneofthe important technologiesin recent decade. This importance is evident which can be used in road and mountains trails and also provides other information to vehicle from roads. There are many challenges and problems in this networks which can cited as routing, clustering, quality of services criteria, energy consumption, RSU placement and etc. This article triesto study and survey about VANET’s clustering methods in roads and mountain trails with high reliability.
Keywords: VANETs, Clustering, Roads Trails, Mountain Trails, Reliability -
Journal of Advances in Computer Engineering and Technology, Volume:3 Issue: 3, Summer 2017, PP 153 -165
The systems in which information and communication technologies and systems engineering concepts are utilized to develop and improve transportation systems of all kinds are called “The Intelligent Transportation Systems (ITS)”. ITS integrates information, communications, computers and other technologies and uses them in the field of transportation to build an integrated system of people, roads and vehicles by utilizing advanced data communication technologies. Vehicular Ad-hoc Networks which is a subset of Mobile Ad-hoc Networks, provide Vehicle to Vehicle (V2V), Vehicle to Roadside (V2R) and Vehicle to Infrastructure (V2I) communications and plays an important role in Intelligent Transportation System. Due to special characteristics of VANETs, QoS (Quality of Service) provisioning in these networks is a challenging task. QoS is the capability of a network for providing superior service to a selected network traffic over various heterogeneous technologies. In this paper we present an overview of Vehicular Networks, QoS Concepts, QoS challenges in VANETs and approaches which aim to enhance the Quality of Service in Vehicular Networks
Keywords: VANET, Vehicular Networks, Quality of Service (QoS), Delay, Packet loss, Throughput -
Journal of Advances in Computer Engineering and Technology, Volume:2 Issue: 3, Summer 2016, PP 43 -53
The Intelligent Transportation System (ITS) provides wireless and mobile communication between vehicles and infrastructure to improve the safety of transportation and make the journey more enjoyable. This system consists of many fixed and mobile nodes (Vehicles, Trains, Vessels, Air planes), Wireless and Wired Telecommunication Technologies to exchange information between mobile nodes or between mobile nodes and fixed stations. The most common transportation tools are cars. Vehicular Ad-hoc Networks as an Application of Mobile Ad-hoc Networks and one of the subsets of Intelligent Transportation System provides wireless Ad-hoc communication between vehicles. VANET is a mobile wireless technology which is designed to improve safety of transportation with exchanging real time data between vehicles and providing different services to the users. It has special characteristics like high mobility and provides a broad range of services to the users, so it has been emerged as one of the research interests in the field of computer and telecommunication networks. In This paper we present different aspects of ITS and VANET to help the researchers to understand the Architecture, Communication Technologies and Applications of these networks.
Keywords: ITS, VANET, Ad-hoc Networks, Mobile communication
- در این صفحه نام مورد نظر در اسامی نویسندگان مقالات جستجو میشود. ممکن است نتایج شامل مطالب نویسندگان هم نام و حتی در رشتههای مختلف باشد.
- همه مقالات ترجمه فارسی یا انگلیسی ندارند پس ممکن است مقالاتی باشند که نام نویسنده مورد نظر شما به صورت معادل فارسی یا انگلیسی آن درج شده باشد. در صفحه جستجوی پیشرفته میتوانید همزمان نام فارسی و انگلیسی نویسنده را درج نمایید.
- در صورتی که میخواهید جستجو را با شرایط متفاوت تکرار کنید به صفحه جستجوی پیشرفته مطالب نشریات مراجعه کنید.