Einloggen

Thematische Bibliographien / Lightweight protocol / Zeitschriftenartikel

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Lightweight protocol.

Zeitschriftenartikel zum Thema „Lightweight protocol“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 3. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "Lightweight protocol" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Tsai, Chia-Wei, Chun-Wei Yang und Narn-Yih Lee. „Lightweight mediated semi-quantum key distribution protocol“. Modern Physics Letters A 34, Nr. 34 (05.11.2019): 1950281. http://dx.doi.org/10.1142/s021773231950281x.

Der volle Inhalt der Quelle

Annotation:

Classical users can share a secret key with a quantum user by using a semi-quantum key distribution (SQKD) protocol. Allowing two classical users to share a secret key is the objective of the mediated semi-quantum key distribution (MSQKD) protocol. However, the existing MSQKD protocols need a quantum user to assist two classical users in distributing the secret keys, and these protocols require that the classical users be equipped with a Trojan horse photon detector. This reduces the practicability of the MSQKD protocols. Therefore, in this study we propose a lightweight MSQKD, in which the two participants and third party are classical users. Due to the usage of the one-way transmission strategy, the proposed lightweight MSQKD protocol is free from quantum Trojan horse attack. The proposed MSQKD is more practical than the existing MSQKD protocols.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Wu, Yongdong, und Hweehua Pang. „A Lightweight Buyer-Seller Watermarking Protocol“. Advances in Multimedia 2008 (2008): 1–7. http://dx.doi.org/10.1155/2008/905065.

Der volle Inhalt der Quelle

Annotation:

The buyer-seller watermarking protocol enables a seller to successfully identify a traitor from a pirated copy, while preventing the seller from framing an innocent buyer. Based on finite field theory and the homomorphic property of public key cryptosystems such as RSA, several buyer-seller watermarking protocols (N. Memon and P. W. Wong (2001) and C.-L. Lei et al. (2004)) have been proposed previously. However, those protocols require not only large computational power but also substantial network bandwidth. In this paper, we introduce a new buyer-seller protocol that overcomes those weaknesses by managing the watermarks. Compared with the earlier protocols, ours isntimes faster in terms of computation, wherenis the number of watermark elements, while incurring onlyO(1/lN)times communication overhead given the finite field parameterlN. In addition, the quality of the watermarked image generated with our method is better, using the same watermark strength.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Gódor, Gyozo, und Sándor Imre. „Simple Lightweight Authentication Protocol“. International Journal of Business Data Communications and Networking 6, Nr. 3 (Juli 2010): 66–94. http://dx.doi.org/10.4018/jbdcn.2010070104.

Der volle Inhalt der Quelle

Annotation:

Radio frequency identification technology is becoming ubiquitous and, as a side effect, more authentication solutions come to light, which include numerous security issues. The authors’ have previously introduced a solely hash-based secure authentication algorithm that is capable of providing protection against most of the well-known attacks, which performs exceptionally well in very large systems. In this paper, the authors give a detailed examination of small computational capacity systems from the point of view of security. This paper defines the model of attacker and the well-known attacks that can be achieved in these kinds of environments, as well as an illustration of the proposed protocol’s performance characteristics with measurements carried out in a simulation environment. This paper shows the effects of numerous attacks and the system’s different parameters on the authentication time while examining the performance and security characteristics of two other protocols chosen from the literature to compare the SLAP algorithm and give a proper explanation for the differences between them.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Yu, Song Sen, Yun Peng und Jia Jing Zhang. „A Lightweight RFID Mechanism Design“. Advanced Materials Research 216 (März 2011): 120–23. http://dx.doi.org/10.4028/www.scientific.net/amr.216.120.

Der volle Inhalt der Quelle

Annotation:

Based on the study of existing RFID security protocols and RFID anti-collision algorithms, this paper proposes a processing mechanism integrating lightweight random key double-authentication and dynamic slot-ALOHA protocol. The mechanism is simple, practical, and compatible with EPC Gen2 standards. Research shows that comparing with the other security protocols and anti-collision protocols, the new mechanism has a little complexity and tag-cost.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

赵, 士琦. „Improved Lightweight Anonymous Authentication Protocol“. Advances in Applied Mathematics 09, Nr. 05 (2020): 759–64. http://dx.doi.org/10.12677/aam.2020.95090.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Yu, Ki-soon, Sung-joon Kim, Won-kyu Park, Min-Ho Jang und Dae-woon Lim. „Implement of Lightweight Security Protocol“. Journal of Korean Institute of Communications and Information Sciences 43, Nr. 4 (30.04.2018): 723–29. http://dx.doi.org/10.7840/kics.2018.43.4.723.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Mansoor, Khwaja, Anwar Ghani, Shehzad Chaudhry, Shahaboddin Shamshirband, Shahbaz Ghayyur und Amir Mosavi. „Securing IoT-Based RFID Systems: A Robust Authentication Protocol Using Symmetric Cryptography“. Sensors 19, Nr. 21 (01.11.2019): 4752. http://dx.doi.org/10.3390/s19214752.

Der volle Inhalt der Quelle

Annotation:

Despite the many conveniences of Radio Frequency Identification (RFID) systems, the underlying open architecture for communication between the RFID devices may lead to various security threats. Recently, many solutions were proposed to secure RFID systems and many such systems are based on only lightweight primitives, including symmetric encryption, hash functions, and exclusive OR operation. Many solutions based on only lightweight primitives were proved insecure, whereas, due to resource-constrained nature of RFID devices, the public key-based cryptographic solutions are unenviable for RFID systems. Very recently, Gope and Hwang proposed an authentication protocol for RFID systems based on only lightweight primitives and claimed their protocol can withstand all known attacks. However, as per the analysis in this article, their protocol is infeasible and is vulnerable to collision, denial-of-service (DoS), and stolen verifier attacks. This article then presents an improved realistic and lightweight authentication protocol to ensure protection against known attacks. The security of the proposed protocol is formally analyzed using Burrows Abadi-Needham (BAN) logic and under the attack model of automated security verification tool ProVerif. Moreover, the security features are also well analyzed, although informally. The proposed protocol outperforms the competing protocols in terms of security.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Safkhani, Masoumeh, Nasour Bagheri und Mahyar Shariat. „On the Security of Rotation Operation Based Ultra-Lightweight Authentication Protocols for RFID Systems“. Future Internet 10, Nr. 9 (21.08.2018): 82. http://dx.doi.org/10.3390/fi10090082.

Der volle Inhalt der Quelle

Annotation:

Passive Radio Frequency IDentification (RFID) tags are generally highly constrained and cannot support conventional encryption systems to meet the required security. Hence, designers of security protocols may try to achieve the desired security only using limited ultra-lightweight operations. In this paper, we show that the security of such protocols is not provided by using rotation functions. In the following, for an example, we investigate the security of an RFID authentication protocol that has been recently developed using rotation function named ULRAS, which stands for an Ultra-Lightweight RFID Authentication Scheme and show its security weaknesses. More precisely, we show that the ULRAS protocol is vulnerable against de-synchronization attack. The given attack has the success probability of almost ‘1’, with the complexity of only one session of the protocol. In addition, we show that the given attack can be used as a traceability attack against the protocol if the parameters’ lengths are an integer power of 2, e.g., 128. Moreover, we propose a new authentication protocol named UEAP, which stands for an Ultra-lightweight Encryption based Authentication Protocol, and then informally and formally, using Scyther tool, prove that the UEAP protocol is secure against all known active and passive attacks.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Oh, JiHyeon, SungJin Yu, JoonYoung Lee, SeungHwan Son, MyeongHyun Kim und YoungHo Park. „A Secure and Lightweight Authentication Protocol for IoT-Based Smart Homes“. Sensors 21, Nr. 4 (21.02.2021): 1488. http://dx.doi.org/10.3390/s21041488.

Der volle Inhalt der Quelle

Annotation:

With the information and communication technologies (ICT) and Internet of Things (IoT) gradually advancing, smart homes have been able to provide home services to users. The user can enjoy a high level of comfort and improve his quality of life by using home services provided by smart devices. However, the smart home has security and privacy problems, since the user and smart devices communicate through an insecure channel. Therefore, a secure authentication protocol should be established between the user and smart devices. In 2020, Xiang and Zheng presented a situation-aware protocol for device authentication in smart grid-enabled smart home environments. However, we demonstrate that their protocol can suffer from stolen smart device, impersonation, and session key disclosure attacks and fails to provide secure mutual authentication. Therefore, we propose a secure and lightweight authentication protocol for IoT-based smart homes to resolve the security flaws of Xiang and Zheng’s protocol. We proved the security of the proposed protocol by performing informal and formal security analyses, using the real or random (ROR) model, Burrows–Abadi–Needham (BAN) logic, and the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool. Moreover, we provide a comparison of performance and security properties between the proposed protocol and related existing protocols. We demonstrate that the proposed protocol ensures better security and lower computational costs than related protocols, and is suitable for practical IoT-based smart home environments.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Chen, Chien-Ming, Shuai-Min Chen, Xinying Zheng, Pei-Yu Chen und Hung-Min Sun. „A Secure RFID Authentication Protocol Adopting Error Correction Code“. Scientific World Journal 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/704623.

Der volle Inhalt der Quelle

Annotation:

RFID technology has become popular in many applications; however, most of the RFID products lack security related functionality due to the hardware limitation of the low-cost RFID tags. In this paper, we propose a lightweight mutual authentication protocol adopting error correction code for RFID. Besides, we also propose an advanced version of our protocol to provide key updating. Based on the secrecy of shared keys, the reader and the tag can establish a mutual authenticity relationship. Further analysis of the protocol showed that it also satisfies integrity, forward secrecy, anonymity, and untraceability. Compared with other lightweight protocols, the proposed protocol provides stronger resistance to tracing attacks, compromising attacks and replay attacks. We also compare our protocol with previous works in terms of performance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Zhang, Xiaowen, Zhanyang Zhang und Xinzhou Wei. „An Improved Lightweight RFID Authentication Protocol“. International Journal of Applied Logistics 2, Nr. 1 (Januar 2011): 76–84. http://dx.doi.org/10.4018/ijal.2011010105.

Der volle Inhalt der Quelle

Annotation:

This study extends the vulnerability analysis of a RFID authentication protocol and offers solutions to security weaknesses through enhanced measures. Vajda and Buttyan (VB) proposed a lightweight RFID authentication protocol, called XOR. Defend, Fu, and Juels (DFJ) analyzed it and proposed repeated keys and nibble attacks to the protocol. In this paper, we identify the source of vulnerability within VB’s original successive session key permutation algorithm. We propose three improvements, namely removing bad shuffles, hopping the runs, and authenticating mutually, to prevent DFJ’s attacks, thereby significantly strengthening the security of the protocol without introducing extra resource cost.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Taresh, Hiba. „PROPOSED LIGHTWEIGHT PROTOCOL FOR IOT AUTHENTICATION“. Iraqi Journal for Computers and Informatics 44, Nr. 1 (30.06.2018): 18–22. http://dx.doi.org/10.25195/ijci.v44i1.113.

Der volle Inhalt der Quelle

Annotation:

The Internet of Things (IoT) alludes to interestingly identifiable items (things) which can communicate with differentquestions through the worldwide framework of remote/wired Internet. The correspondence system among an expansive number of assetobliged gadgets that produce substantial volumes of information affects the security and protection of the included items. In thispaper, we propose a lightweight protocol for IoT authentication which based on two algorithms LA1 and RA1 which is used forauthentication and generating session key that is used for encryption.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Zhang, Xiaowen, Zhanyang Zhang und Xinzhou Wei. „An Improved Lightweight RFID Authentication Protocol“. International Journal of Applied Logistics 2, Nr. 1 (Januar 2011): 76–84. http://dx.doi.org/10.4018/jal.2011010105.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Xiao, Liang, He Xu, Feng Zhu, Ruchuan Wang und Peng Li. „SKINNY-Based RFID Lightweight Authentication Protocol“. Sensors 20, Nr. 5 (02.03.2020): 1366. http://dx.doi.org/10.3390/s20051366.

Der volle Inhalt der Quelle

Annotation:

With the rapid development of the Internet of Things and the popularization of 5G communication technology, the security of resource-constrained IoT devices such as Radio Frequency Identification (RFID)-based applications have received extensive attention. In traditional RFID systems, the communication channel between the tag and the reader is vulnerable to various threats, including denial of service, spoofing, and desynchronization. Thus, the confidentiality and integrity of the transmitted data cannot be guaranteed. In order to solve these security problems, in this paper, we propose a new RFID authentication protocol based on a lightweight block cipher algorithm, SKINNY, (short for LRSAS). Security analysis shows that the LRSAS protocol guarantees mutual authentication and is resistant to various attacks, such as desynchronization attacks, replay attacks, and tracing attacks. Performance evaluations show that the proposed solution is suitable for low-cost tags while meeting security requirements. This protocol reaches a balance between security requirements and costs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Anuradha, J. A. D. C., Rohan Samarasinghe und Saluka R. „SecAODV: Lightweight Authentication for AODV Protocol“. International Journal of Computer Applications 137, Nr. 13 (17.03.2016): 33–38. http://dx.doi.org/10.5120/ijca2016909034.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Chen, Chien-Ming, King-Hang Wang, Weicheng Fang, Tsu-Yang Wu und Eric Ke Wang. „Reconsidering a lightweight anonymous authentication protocol“. Journal of the Chinese Institute of Engineers 42, Nr. 1 (02.01.2019): 9–14. http://dx.doi.org/10.1080/02533839.2018.1537808.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Yang, Ming Hour. „Across-authority lightweight ownership transfer protocol“. Electronic Commerce Research and Applications 10, Nr. 4 (Juli 2011): 375–83. http://dx.doi.org/10.1016/j.elerap.2011.03.001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Hou, Yubao, Hua Liang und Juan Liu. „Super Lightweight Mobile RFID Authentication Protocol for Bit Replacement Operation“. International Journal of Mobile Computing and Multimedia Communications 12, Nr. 1 (Januar 2021): 63–77. http://dx.doi.org/10.4018/ijmcmc.2021010104.

Der volle Inhalt der Quelle

Annotation:

In the traditional RFID system, the secure wired channel communication is used between the reader and the server, and the new mobile RFID system is different from the traditional RFID system. The reader and the server communicate based on the wireless channel. This makes authentication protocols applicable to traditional RFID systems not applicable to mobile RFID systems. To solve this defect, a two-way authentication protocol MSB is proposed for ultra-lightweight mobile radio frequency identification system based on bit replacement operation. MSB (most significant bit) encrypts information based on bitwise operations, and the amount of computation of the communication entity is reduced. Tags, readers, and servers first authenticate and then communicate. MSB can be resistant to common attacks. The security analysis of the protocol shows that the protocol has high security attributes, and the performance analysis of the protocol shows that the protocol has the characteristics of low calculation volume. The formal analysis of the protocol is given based on GNY logic.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

He, Hong, Qi Li und Zhi Hong Zhang. „RFID Security Authentication Protocol Based on Hash for the Lightweight RFID Systems“. Applied Mechanics and Materials 380-384 (August 2013): 2831–36. http://dx.doi.org/10.4028/www.scientific.net/amm.380-384.2831.

Der volle Inhalt der Quelle

Annotation:

In order to solve the RFID authentication protocols, a new mutual authentication protocol based on Hash for the lightweight RFID system is proposed in this paper. Compared with several RFID authentication protocols with the similar structure, the proposed protocol can effectively solve the privacy and security of the RFID system, and it has significant performance advantages. It greatly reduces the amount storage and computation of tags.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Yasser R. Alselehibi, Yasser R. Alselehibi. „Secure Lightweight Routing Scheme for Energy Efficient Wireless Sensor Networks“. journal of King Abdulaziz University Computing and Information Technology Sciences 8, Nr. 2 (06.03.2019): 57–68. http://dx.doi.org/10.4197/comp.8-2.5.

Der volle Inhalt der Quelle

Annotation:

The technology revolution in wireless communications and micro-electro-mechanical systems (MEMS) directly affects the development of wireless sensor networks (WSNs), which are used in several application areas, including the military, home, and environment. One of the best categories of routing networks in WSNs are hierarchical protocols (cluster-based). The wellknown protocols in this category include the Low Energy Adaptive Clustering Hierarchy (LEACH). However, the LEACH is vulnerable to many attacks. To provide cryptographic protection against outsider attacks, a modified version of LEACH, called Enhancing Secure LEACH (MS-LEACH) protocol, is used. MS-LEACH enhances security but increases power consumption. To maintain an acceptable level of security and decrease the power consumption of secure LEACH protocols, the present research proposes a Secure Lightweight LEACH (SLWLEACH) scheme. The simulation results show that this proposed SLW-LEACH protocol outperforms the MS-LEACH in terms of ne

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

KIM, Jin Seok, Kookrae CHO, Dae Hyun YUM, Sung Je HONG und Pil Joong LEE. „Lightweight Distance Bounding Protocol against Relay Attacks“. IEICE Transactions on Information and Systems E95-D, Nr. 4 (2012): 1155–58. http://dx.doi.org/10.1587/transinf.e95.d.1155.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Venčkauskas, Algimantas, Nerijus Morkevicius, Kazimieras Bagdonas, Robertas Damaševičius und Rytis Maskeliūnas. „A Lightweight Protocol for Secure Video Streaming“. Sensors 18, Nr. 5 (14.05.2018): 1554. http://dx.doi.org/10.3390/s18051554.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Tian, Yun, Gong Liang Chen und Jian Hua Li. „A Lightweight Serverless RFID Tag Search Protocol“. Advanced Materials Research 684 (April 2013): 531–34. http://dx.doi.org/10.4028/www.scientific.net/amr.684.531.

Der volle Inhalt der Quelle

Annotation:

Radio frequency identification (RFID) has been applied to a variety of domains. RFID tag search problem becomes significant when the total number of tags is very large and only the data of a particular tag or a small group of tags are required. This paper proposes a lightweight serverless RFID tag search protocol in conformity with EPC C1G2 standards. The computation operations in the protocol are only PRNG and XOR. The security analysis shows that the protocol achieves authentication, data confidentiality, untraceability and data integrity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

Kim, Jin Ho. „A Lightweight NEMO Protocol to Support 6LoWPAN“. ETRI Journal 30, Nr. 5 (08.10.2008): 685–95. http://dx.doi.org/10.4218/etrij.08.1308.0054.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Al-Hamadi, Hussam, Amjad Gawanmeh, Joonsang Baek und Mahmoud Al-Qutayri. „Lightweight Security Protocol for ECG Bio-Sensors“. Wireless Personal Communications 95, Nr. 4 (19.04.2017): 5097–120. http://dx.doi.org/10.1007/s11277-017-4147-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Bartczak, Tomasz, und Piotr Zwierzykowski. „Lightweight PIM-a new multicast routing protocol“. International Journal of Communication Systems 27, Nr. 10 (25.07.2012): 1441–58. http://dx.doi.org/10.1002/dac.2407.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Jeon, Il-Soo, und Eun-Jun Yoon. „An ultra-lightweight RFID distance bounding protocol“. International Journal of Mathematical Analysis 8 (2014): 2265–75. http://dx.doi.org/10.12988/ijma.2014.48264.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Yang, Ming Hour. „Lightweight authentication protocol for mobile RFID networks“. International Journal of Security and Networks 5, Nr. 1 (2010): 53. http://dx.doi.org/10.1504/ijsn.2010.030723.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

Wu, Qianqian, und Meihong Li. „A Lightweight Authentication Protocol for Smart Grid“. IOP Conference Series: Earth and Environmental Science 234 (08.03.2019): 012106. http://dx.doi.org/10.1088/1755-1315/234/1/012106.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

Zhou, Shijie, Zhen Zhang, Zongwei Luo und Edward C. Wong. „A lightweight anti-desynchronization RFID authentication protocol“. Information Systems Frontiers 12, Nr. 5 (13.08.2009): 521–28. http://dx.doi.org/10.1007/s10796-009-9216-6.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Chen, Tzung-Her, und Gwoboa Horng. „A lightweight and anonymous copyright-protection protocol“. Computer Standards & Interfaces 29, Nr. 2 (Februar 2007): 229–37. http://dx.doi.org/10.1016/j.csi.2006.03.010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Wang, Shu Ching, Wen Pin Liao, Kuo Qin Yan, Shun Sheng Wang und Szu Hao Tsai. „Security of Cloud Computing Lightweight Authentication Protocol“. Applied Mechanics and Materials 284-287 (Januar 2013): 3502–6. http://dx.doi.org/10.4028/www.scientific.net/amm.284-287.3502.

Der volle Inhalt der Quelle

Annotation:

Nowadays, network bandwidth and hardware technology are developing rapidly, resulting in the vigorous development of the Internet. However, cloud computing, an Internet-based development in which dynamically scalable and often virtualized resources are provided as a service over the Internet has become a significant issue. According to the characteristics of cloud computing, there are a lot of applications and data centers in the cloud-computing environment, hence, the issues of information and communication security and authentication must to be considered. However, the most of the studies on the security and authentication require large amounts of computing resource; therefore not suitable for the cloud-computing environment. In this paper, a lightweight computing protocol, Lightweight Authentication Protocol (LAP), is proposed to enhance the security of cloud computing environment and provide the authentication of service.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Yu, Myung-han, und Sangkyung Kim. „TinyAP: Lightweight Application Protocol for LoRa Environment“. Journal of Korean Institute of Communications and Information Sciences 43, Nr. 1 (31.01.2018): 27–36. http://dx.doi.org/10.7840/kics.2018.43.1.27.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Aseeri, Aisha, und Omaimah Bamasag. „Achieving protection against man-in-the-middle attack in HB family protocols implemented in RFID tags“. International Journal of Pervasive Computing and Communications 12, Nr. 3 (05.09.2016): 375–90. http://dx.doi.org/10.1108/ijpcc-03-2016-0015.

Der volle Inhalt der Quelle

Annotation:

Purpose In the past few years, HB-like protocols have gained much attention in the field of lightweight authentication protocols due to their efficient functioning and large potential applications in low-cost radio frequency identification tags, which are on the other side spreading so fast. However, most published HB protocols are vulnerable to man-in-the-middle attacks such as GRS or OOV attacks. The purpose of this research is to investigate security issues pertaining to HB-like protocols with an aim of improving their security and efficiency. Design/methodology/approach In this paper, a new and secure variant of HB family protocols named HB-MP* is proposed and designed, using the techniques of random rotation. The security of the proposed protocol is proven using formal proofs. Also, a prototype of the protocol is implemented to check its applicability, test the security in implementation and to compare its performance with the most related protocol. Findings The HB-MP* protocol is found secure against passive and active adversaries and is implementable within the tight resource constraints of today’s EPC-type RFID tags. Accordingly, the HB-MP* protocol provides higher security than previous HB-like protocols without sacrificing performance. Originality/value This paper proposes a new HB variant called HB-MP* that tries to be immune against the pre-mentioned attacks and at the same time keeping the simple structure. It will use only lightweight operations to randomize the rotation of the secret.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

Fan, Kai, Chen Zhang, Kan Yang, Hui Li und Yintang Yang. „Lightweight NFC Protocol for Privacy Protection in Mobile IoT“. Applied Sciences 8, Nr. 12 (05.12.2018): 2506. http://dx.doi.org/10.3390/app8122506.

Der volle Inhalt der Quelle

Annotation:

The Internet of Things (IoT) aims to achieve the interconnection of all devices in our lives. Due to the complex network environment, the IoT with mobile devices often faces many security problems, such as privacy leakages and identity forgery attacks. As a developing technology in mobile IoT, near field communication (NFC) is widely used in electronic payments and identity authentications. The current NFC studies mainly focus on payment technology, but there are a few studies on privacy protection and the lightweight requirements in the mobile IoT authentication protocol. We focus on the lightweight privacy protection authentication technology in mobile IoT. In the paper, we summarize the clustering model in mobile IoT networks and propose a lightweight authentication protocol. A security analysis shows that the protocol can resist many security threats, such as privacy leakages, identity forgeries, and replay attacks. The simulation also shows that the protocol is lightweight, with the utilization of look-up-tables (LUTs) and registers in our protocol being less than 0.5%. Our work can provide a secure and lightweight mobile authentication serve in the NFC-based mobile IoT network such as smart home and office attendance.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

DURRESI, ARJAN, VAMSI PARUCHURI, MIMOZA DURRESI und LEONARD BAROLLI. „CLUSTERING PROTOCOL FOR SENSOR NETWORKS“. Journal of Interconnection Networks 07, Nr. 04 (Dezember 2006): 423–36. http://dx.doi.org/10.1142/s0219265906001788.

Der volle Inhalt der Quelle

Annotation:

In this paper we present Clustering Protocol for Sensor networks (CPS). Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach is based on the Covering Problem that aims at covering an area with minimum number of circular disks. CPS is a lightweight protocol that does not require any neighborhood information and imposes low communication overhead. We present simulation results to show the efficiency of CPS in both ideal cases and randomly distributed networks. Moreover, CPS is scalable with respect to density and network size.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Son, Seunghwan, Yohan Park und Youngho Park. „A Secure, Lightweight, and Anonymous User Authentication Protocol for IoT Environments“. Sustainability 13, Nr. 16 (17.08.2021): 9241. http://dx.doi.org/10.3390/su13169241.

Der volle Inhalt der Quelle

Annotation:

The Internet of Things (IoT) is being applied to various environments such as telecare systems, smart homes, and intelligent transportation systems. The information generated from IoT devices is stored at remote servers, and external users authenticate to the server for requesting access to the stored data. In IoT environments, the authentication process is required to be conducted efficiently, and should be secure against various attacks and ensure user anonymity and untraceability to ensure sustainability of the network. However, many existing protocols proposed in IoT environments do not meet these requirements. Recently, Rajaram et al. proposed a paring-based user authentication scheme. We found that the Rajaram et al. scheme is vulnerable to various attacks such as offline password guessing, impersonation, privileged insider, and known session-specific temporary information attacks. Additionally, as their scheme uses bilinear pairing, it requires high computation and communication costs. In this study, we propose a novel authentication scheme that resolves these security problems. The proposed scheme uses only hash and exclusive-or operations to be applicable in IoT environments. We analyze the proposed protocol using informal analysis and formal analysis methods such as the BAN logic, real-or-random (ROR) model, and the AVISPA simulation, and we show that the proposed protocol has better security and performance compared with existing authentication protocols. Consequently, the proposed protocol is sustainable and suitable for real IoT environments.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Yu, SungJin, KiSung Park, JoonYoung Lee, YoungHo Park, YoHan Park, SangWoo Lee und BoHeung Chung. „Privacy-Preserving Lightweight Authentication Protocol for Demand Response Management in Smart Grid Environment“. Applied Sciences 10, Nr. 5 (04.03.2020): 1758. http://dx.doi.org/10.3390/app10051758.

Der volle Inhalt der Quelle

Annotation:

With the development in wireless communication and low-power device, users can receive various useful services such as electric vehicle (EV) charging, smart building, and smart home services at anytime and anywhere in smart grid (SG) environments. The SG devices send demand of electricity to the remote control center and utility center (UC) to use energy services, and UCs handle it for distributing electricity efficiently. However, in SG environments, the transmitted messages are vulnerable to various attacks because information related to electricity is transmitted over an insecure channel. Thus, secure authentication and key agreement are essential to provide secure energy services for legitimate users. In 2019, Kumar et al. presented a secure authentication protocol for demand response management in the SG system. However, we demonstrate that their protocol is insecure against masquerade, the SG device stolen, and session key disclosure attacks and does not ensure secure mutual authentication. Thus, we propose a privacy-preserving lightweight authentication protocol for demand response management in the SG environments to address the security shortcomings of Kumar et al.’s protocol. The proposed protocol withstands various attacks and ensures secure mutual authentication and anonymity. We also evaluated the security features of the proposed scheme using informal security analysis and proved the session key security of proposed scheme using the ROR model. Furthermore, we showed that the proposed protocol achieves secure mutual authentication between the SG devices and the UC using Burrows–Abadi–Needham (BAN) logic analysis. We also demonstrated that our authentication protocol prevents man-in-the-middle and replay attacks utilizing AVISPA simulation tool and compared the performance analysis with other existing protocols. Therefore, the proposed scheme provides superior safety and efficiency other than existing related protocols and can be suitable for practical SG environments.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Ryu, Hyunho, und Hyunsung Kim. „Privacy-Preserving Authentication Protocol for Wireless Body Area Networks in Healthcare Applications“. Healthcare 9, Nr. 9 (28.08.2021): 1114. http://dx.doi.org/10.3390/healthcare9091114.

Der volle Inhalt der Quelle

Annotation:

Mobile healthcare service has become increasingly popular thanks to the significant advances in the wireless body area networks (WBANs). It helps medical professionals to collect patient’s healthcare data remotely and provides remote medical diagnosis. Since the health data are privacy-related, they should provide services with privacy-preserving, which should consider security and privacy at the same time. Recently, some lightweight patient healthcare authentication protocols were proposed for WBANs. However, we observed that they are vulnerable to tracing attacks because the patient uses the same identifier in each session, which could leak privacy-related information on the patient. To defeat the weakness, this paper proposes a privacy-preserving authentication protocol for WBANs in healthcare service. The proposed protocol is only based on one-way hash function and with exclusive-or operation, which are lightweight operations than asymmetric cryptosystem operations. We performed two rigorous formal security proofs based on BAN logic and ProVerif tool. Furthermore, comparison results with the relevant protocols show that the proposed protocol achieves more privacy and security features than the other protocols and has suitable efficiency in computational and communicational concerns.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Thammarat, Chalee. „Efficient and Secure NFC Authentication for Mobile Payment Ensuring Fair Exchange Protocol“. Symmetry 12, Nr. 10 (09.10.2020): 1649. http://dx.doi.org/10.3390/sym12101649.

Der volle Inhalt der Quelle

Annotation:

The standard protocol of near field communication (NFC) has concentrated primarily on the speed of communication while ignoring security properties. Message between an NFC-enabled smartphone and a point of sale are exchanged over the air (OTA), which is a message considered an authentication request for payment, billing, ticketing, loyalty services, identification or access control. An attacker who has an antenna can intercept or manipulate the exchanged messages to take advantage of these. In order to solve this problem, many researchers have suggested authentication methods for NFC communications. However, these remain inadequate transaction security and fairness. In this paper, we will propose a technique that ensures mutual authentication, security properties, and strong fairness. Mutual authentication is a security property that prevents replay attacks and man-in-the-middle attacks. Both fair exchange and transaction security are also significant issues in electronic transactions with regards to creating trust among the parties participating in the transaction. The suggested protocol deploys a secure offline session key generation technique to increase transaction security and, importantly, make our protocol lightweight while maintaining the fairness property. Our analysis suggests that our protocol is more effective than others regarding transaction security, fairness, and lightweight protocol. The proposed protocol checks robustness and soundness using Burrows, Abadi and Needham (BAN) logic, the Scyther tool, and automated validation of internet security protocols and applications (AVISPA) that provide formal proofs for security protocols. Furthermore, our protocol can resolve disputes in case one party misbehaves.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Chen, Chen, und Adrian Perrig. „PHI: Path-Hidden Lightweight Anonymity Protocol at Network Layer“. Proceedings on Privacy Enhancing Technologies 2017, Nr. 1 (01.01.2017): 100–117. http://dx.doi.org/10.1515/popets-2017-0007.

Der volle Inhalt der Quelle

Annotation:

Abstract We identify two vulnerabilities for existing highspeed network-layer anonymity protocols, such as LAP and Dovetail. First, the header formats of LAP and Dovetail leak path information, reducing the anonymity-set size when an adversary launches topological attacks. Second, ASes can launch session hijacking attacks to deanonymize destinations. HORNET addresses these problems but incurs additional bandwidth overhead and latency. In this paper, we propose PHI, a Path-HIdden lightweight anonymity protocol that solves both challenges while maintaining the same level of efficiency as LAP and Dovetail. We present an efficient packet header format that hides path information and a new back-off setup method that is compatible with current and future network architectures. Our experiments demonstrate that PHI expands anonymity sets of LAP and Dovetail by over 30x and reaches 120 Gbps forwarding speed on a commodity software router.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Lu, Xin Mei, und Lei He. „A Modified Two-Way Authentication Protocol without Server for RFID“. Applied Mechanics and Materials 29-32 (August 2010): 2709–13. http://dx.doi.org/10.4028/www.scientific.net/amm.29-32.2709.

Der volle Inhalt der Quelle

Annotation:

It is necessary for researchers to design lightweight authentication protocols to protect information security between tag and reader in RFID system. It is a great challenge to design an efficient and secure protocol because the tag has limited computation resource. In the paper, we firstly analyze some protocols. Secondly, we introduce a serverless authentication protocol for RFID system and analyze its security. We find it does not provide two-way authentication. Thirdly, we propose a modified two-way authentication protocol without server for RFID. The result indicates it provides privacy protection, resists tracking, and resists cloning attack. Moreover, it provides two-way authentication. For the efficiency, we think the computational complexity of our protocol is at the same level with the original protocol.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Yagoub, Mudathir F. S., Othman O. Khalifa, Abdelzahir Abdelmaboud, Valery Korotaev, Sergei A. Kozlov und Joel J. P. C. Rodrigues. „Lightweight and Efficient Dynamic Cluster Head Election Routing Protocol for Wireless Sensor Networks“. Sensors 21, Nr. 15 (31.07.2021): 5206. http://dx.doi.org/10.3390/s21155206.

Der volle Inhalt der Quelle

Annotation:

Wireless Sensor Networks (WSNs) have gained great significance from researchers and industry due to their wide applications. Energy and resource conservation challenges are facing the WSNs. Nevertheless, clustering techniques offer many solutions to address the WSN issues, such as energy efficiency, service redundancy, routing delay, scalability, and making WSNs more efficient. Unfortunately, the WSNs are still immature, and suffering in several aspects. This paper aims to solve some of the downsides in existing routing protocols for WSNs; a Lightweight and Efficient Dynamic Cluster Head Election routing protocol (LEDCHE-WSN) is proposed. The proposed routing algorithm comprises two integrated methods, electing the optimum cluster head, and organizing the re-clustering process dynamically. Furthermore, the proposed protocol improves on others present in the literature by combining the random and periodic electing method in the same round, and the random method starts first at the beginning of each round/cycle. Moreover, both random and periodic electing methods are preceded by checking the remaining power to skip the dead nodes and continue in the same way periodically with the rest of the nodes in the round. Additionally, the proposed protocol is distinguished by deleting dead nodes from the network topology list during the re-clustering process to address the black holes and routing delay problems. Finally, the proposed algorithm’s mathematical modeling and analysis are introduced. The experimental results reveal the proposed protocol outperforms the LEACH protocol by approximately 32% and the FBCFP protocol by 8%, in terms of power consumption and network lifetime. In terms of Mean Package Delay, LEDCHE-WSN improves the LEACH protocol by 42% and the FBCFP protocol by 15%, and regarding Loss Ratio, it improves the LEACH protocol by approximately 46% and FBCFP protocol by 25%.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Qin, Hang, und Yi Liu. „A Secure Lightweight Mutual Authentication for RFID Systems“. Applied Mechanics and Materials 644-650 (September 2014): 4496–500. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.4496.

Der volle Inhalt der Quelle

Annotation:

Radio Frequency Identification (RFID) technology is an automated identification technology which is widely used to identify and track all kind of objects. It is well suitable for many fields and is expected to replace barcodes in the near future. However, it is a challenging task to design an authentication protocol because of the limited resource of low-cost RFID tags. Recently, a lightweight RFID authentication protocol presented by Kulseng et al uses Physically Unclonable Functions (PUFs) and Linear Feedback Shift Registers (LFSRs) which are well known lightweight operations. The number of gates which the protocol require can be significantly decreased. Unfortunately, their protocol faces several serious security issues. In this paper, based PUFs and LFSRs, we suggest a secure mutual authentication for low-cost RFID Systems. Security analysis shows that our protocol owns security and privacy.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Zhu, Feng, Peng Li, He Xu und Ruchuan Wang. „A Lightweight RFID Mutual Authentication Protocol with PUF“. Sensors 19, Nr. 13 (04.07.2019): 2957. http://dx.doi.org/10.3390/s19132957.

Der volle Inhalt der Quelle

Annotation:

Radio frequency identification is one of the key techniques for Internet of Things, which has been widely adopted in many applications for identification. However, there exist various security and privacy issues in radio frequency identification (RFID) systems. Particularly, one of the most serious threats is to clone tags for the goal of counterfeiting goods, which causes great loss and danger to customers. To solve these issues, lots of authentication protocols are proposed based on physical unclonable functions that can ensure an anti-counterfeiting feature. However, most of the existing schemes require secret parameters to be stored in tags, which are vulnerable to physical attacks that can further lead to the breach of forward secrecy. Furthermore, as far as we know, none of the existing schemes are able to solve the security and privacy problems with good scalability. Since many existing schemes rely on exhaustive searches of the backend server to validate a tag and they are not scalable for applications with a large scale database. Hence, in this paper, we propose a lightweight RFID mutual authentication protocol with physically unclonable functions (PUFs). The performance analysis shows that our proposed scheme can ensure security and privacy efficiently in a scalable way.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

He Jialiang, Ouyang Dantong, Bai Tian und Zhang Liming. „A Lightweight RFID Authentication Protocol for Mobile Reader“. International Journal of Digital Content Technology and its Applications 6, Nr. 6 (30.04.2012): 80–88. http://dx.doi.org/10.4156/jdcta.vol6.issue6.10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Lee, Jae-Kang, Se-Jin Oh, Tae-Jin Yun, Kyung-Ho Chung und Kwang-Seon Ahn. „An Ultra-Lightweight RFID Authentication Protocol Using Index“. Journal of Korean Institute of Communications and Information Sciences 37, Nr. 1C (31.01.2012): 24–33. http://dx.doi.org/10.7840/kics.2012.37c.1.24.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

ZHANG, Shun, und Hai-jin CHEN. „Lightweight security authentication protocol for radio frequency identification“. Journal of Computer Applications 32, Nr. 7 (26.08.2013): 2010–14. http://dx.doi.org/10.3724/sp.j.1087.2012.02010.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Zhong, Xiao Jun, und Lu Yao. „A Lightweight Message Encrypt Protocol for Electronic Commerce“. Applied Mechanics and Materials 432 (September 2013): 545–48. http://dx.doi.org/10.4028/www.scientific.net/amm.432.545.

Der volle Inhalt der Quelle

Annotation:

In this paper, we propose a publicly verifiable batch encryption scheme. It allows a trusted entity to verify that two or more cipher texts hind the same message without revealing it. The message can also be verified by running a single PVE scheme with the same public value for each cipher text. However, it requires more computation than our scheme. According to our analysis, our scheme can reduce the overhead of computations by 66%. Furthermore, our scheme can be applied to voting and network testing to prove the fairness.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Raikar, Meenaxi M., Meena S M und Mohammed Moin Mulla. „Software Defined Internet of Things using lightweight protocol“. Procedia Computer Science 171 (2020): 1409–18. http://dx.doi.org/10.1016/j.procs.2020.04.151.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!