CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: cryptographic protocol</title> <meta name="description" content="Search results for: cryptographic protocol"> <meta name="keywords" content="cryptographic protocol"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="cryptographic protocol" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="cryptographic protocol"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 1184</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: cryptographic protocol</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1184</span> Cryptographic Protocol for Secure Cloud Storage</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Luvisa%20Kusuma">Luvisa Kusuma</a>, <a href="https://publications.waset.org/abstracts/search?q=Panji%20Yudha%20Prakasa"> Panji Yudha Prakasa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud storage, as a subservice of infrastructure as a service (IaaS) in Cloud Computing, is the model of nerworked storage where data can be stored in server. In this paper, we propose a secure cloud storage system consisting of two main components; client as a user who uses the cloud storage service and server who provides the cloud storage service. In this system, we propose the protocol schemes to guarantee against security attacks in the data transmission. The protocols are login protocol, upload data protocol, download protocol, and push data protocol, which implement hybrid cryptographic mechanism based on data encryption before it is sent to the cloud, so cloud storage provider does not know the user's data and cannot analysis user’s data, because there is no correspondence between data and user. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20storage" title="cloud storage">cloud storage</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol" title=" cryptographic protocol"> cryptographic protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a> </p> <a href="https://publications.waset.org/abstracts/3779/cryptographic-protocol-for-secure-cloud-storage" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3779.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">357</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1183</span> HPPDFIM-HD: Transaction Distortion and Connected Perturbation Approach for Hierarchical Privacy Preserving Distributed Frequent Itemset Mining over Horizontally-Partitioned Dataset</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fuad%20Ali%20Mohammed%20Al-Yarimi">Fuad Ali Mohammed Al-Yarimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Many algorithms have been proposed to provide privacy preserving in data mining. These protocols are based on two main approaches named as: the perturbation approach and the Cryptographic approach. The first one is based on perturbation of the valuable information while the second one uses cryptographic techniques. The perturbation approach is much more efficient with reduced accuracy while the cryptographic approach can provide solutions with perfect accuracy. However, the cryptographic approach is a much slower method and requires considerable computation and communication overhead. In this paper, a new scalable protocol is proposed which combines the advantages of the perturbation and distortion along with cryptographic approach to perform privacy preserving in distributed frequent itemset mining on horizontally distributed data. Both the privacy and performance characteristics of the proposed protocol are studied empirically. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anonymity%20data" title="anonymity data">anonymity data</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20frequent%20itemset%20mining" title=" distributed frequent itemset mining"> distributed frequent itemset mining</a>, <a href="https://publications.waset.org/abstracts/search?q=gaussian%20perturbation" title=" gaussian perturbation"> gaussian perturbation</a>, <a href="https://publications.waset.org/abstracts/search?q=perturbation%20approach" title=" perturbation approach"> perturbation approach</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy%20preserving%20data%20mining" title=" privacy preserving data mining"> privacy preserving data mining</a> </p> <a href="https://publications.waset.org/abstracts/20805/hppdfim-hd-transaction-distortion-and-connected-perturbation-approach-for-hierarchical-privacy-preserving-distributed-frequent-itemset-mining-over-horizontally-partitioned-dataset" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20805.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">505</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1182</span> Management and Agreement Protocol in Computer Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdulameer%20K.%20Hussain">Abdulameer K. Hussain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When dealing with a cryptographic system we note that there are many activities performed by parties of this cryptographic system and the most prominent of these activities is the process of agreement between the parties involved in the cryptographic system on how to deal and perform the cryptographic system tasks to be more secure, more confident and reliable. The most common agreement among parties is a key agreement and other types of agreements. Despite the fact that there is an attempt from some quarters to find other effective agreement methods but these methods are limited to the traditional agreements. This paper presents different parameters to perform more effectively the task of the agreement, including the key alternative, the agreement on the encryption method used and the agreement to prevent the denial of the services. To manage and achieve these goals, this method proposes the existence of an control and monitoring entity to manage these agreements by collecting different statistical information of the opinions of the authorized parties in the cryptographic system. These statistics help this entity to take the proper decision about the agreement factors. This entity is called Agreement Manager (AM). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=agreement%20parameters" title="agreement parameters">agreement parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20agreement" title=" key agreement"> key agreement</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20exchange" title=" key exchange"> key exchange</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20management" title=" security management"> security management</a> </p> <a href="https://publications.waset.org/abstracts/22759/management-and-agreement-protocol-in-computer-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22759.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">421</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1181</span> FPGA Implementation of the BB84 Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jaouadi%20Ikram">Jaouadi Ikram</a>, <a href="https://publications.waset.org/abstracts/search?q=Machhout%20Mohsen"> Machhout Mohsen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development of a quantum key distribution (QKD) system on a field-programmable gate array (FPGA) platform is the subject of this paper. A quantum cryptographic protocol is designed based on the properties of quantum information and the characteristics of FPGAs. The proposed protocol performs key extraction, reconciliation, error correction, and privacy amplification tasks to generate a perfectly secret final key. We modeled the presence of the spy in our system with a strategy to reveal some of the exchanged information without being noticed. Using an FPGA card with a 100 MHz clock frequency, we have demonstrated the evolution of the error rate as well as the amounts of mutual information (between the two interlocutors and that of the spy) passing from one step to another in the key generation process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=QKD" title="QKD">QKD</a>, <a href="https://publications.waset.org/abstracts/search?q=BB84" title=" BB84"> BB84</a>, <a href="https://publications.waset.org/abstracts/search?q=protocol" title=" protocol"> protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=key" title=" key"> key</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a>, <a href="https://publications.waset.org/abstracts/search?q=communication" title=" communication"> communication</a> </p> <a href="https://publications.waset.org/abstracts/98812/fpga-implementation-of-the-bb84-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/98812.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">183</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1180</span> Non-Interactive XOR Quantum Oblivious Transfer: Optimal Protocols and Their Experimental Implementations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lara%20Stroh">Lara Stroh</a>, <a href="https://publications.waset.org/abstracts/search?q=Nikola%20Horov%C3%A1"> Nikola Horová</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20St%C3%A1rek"> Robert Stárek</a>, <a href="https://publications.waset.org/abstracts/search?q=Ittoop%20V.%20Puthoor"> Ittoop V. Puthoor</a>, <a href="https://publications.waset.org/abstracts/search?q=Michal%20Mi%C4%8Duda"> Michal Mičuda</a>, <a href="https://publications.waset.org/abstracts/search?q=Miloslav%20Du%C5%A1ek"> Miloslav Dušek</a>, <a href="https://publications.waset.org/abstracts/search?q=Erika%20Andersson"> Erika Andersson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Oblivious transfer (OT) is an important cryptographic primitive. Any multi-party computation can be realised with OT as a building block. XOR oblivious transfer (XOT) is a variant where the sender Alice has two bits, and a receiver, Bob, obtains either the first bit, the second bit, or their XOR. Bob should not learn anything more than this, and Alice should not learn what Bob has learned. Perfect quantum OT with information-theoretic security is known to be impossible. We determine the smallest possible cheating probabilities for unrestricted dishonest parties in non-interactive quantum XOT protocols using symmetric pure states and present an optimal protocol which outperforms classical protocols. We also "reverse" this protocol so that Bob becomes the sender of a quantum state and Alice the receiver who measures it while still implementing oblivious transfer from Alice to Bob. Cheating probabilities for both parties stay the same as for the unreversed protocol. We optically implemented both the unreversed and the reversed protocols and cheating strategies, noting that the reversed protocol is easier to implement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=oblivious%20transfer" title="oblivious transfer">oblivious transfer</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20protocol" title=" quantum protocol"> quantum protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=XOR" title=" XOR"> XOR</a> </p> <a href="https://publications.waset.org/abstracts/168274/non-interactive-xor-quantum-oblivious-transfer-optimal-protocols-and-their-experimental-implementations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168274.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">126</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1179</span> Quantum Cryptography: Classical Cryptography Algorithms’ Vulnerability State as Quantum Computing Advances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tydra%20Preyear">Tydra Preyear</a>, <a href="https://publications.waset.org/abstracts/search?q=Victor%20Clincy"> Victor Clincy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum computing presents many computational advantages over classical computing methods due to the utilization of quantum mechanics. The capability of this computing infrastructure poses threats to standard cryptographic systems such as RSA and AES, which are designed for classical computing environments. This paper discusses the impact that quantum computing has on cryptography, while focusing on the evolution from classical cryptographic concepts to quantum and post-quantum cryptographic concepts. Standard Cryptography is essential for securing data by utilizing encryption and decryption methods, and these methods face vulnerability problems due to the advancement of quantum computing. In order to counter these vulnerabilities, the methods that are proposed are quantum cryptography and post-quantum cryptography. Quantum cryptography uses principles such as the uncertainty principle and photon polarization in order to provide secure data transmission. In addition, the concept of Quantum key distribution is introduced to ensure more secure communication channels by distributing cryptographic keys. There is the emergence of post-quantum cryptography which is used for improving cryptographic algorithms in order to be more secure from attacks by classical and quantum computers. Throughout this exploration, the paper mentions the critical role of the advancement of cryptographic methods to keep data integrity and privacy safe from quantum computing concepts. Future research directions that would be discussed would be more effective cryptographic methods through the advancement of technology. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20computing" title="quantum computing">quantum computing</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20cryptography" title=" quantum cryptography"> quantum cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20integrity%20and%20privacy" title=" data integrity and privacy"> data integrity and privacy</a> </p> <a href="https://publications.waset.org/abstracts/189381/quantum-cryptography-classical-cryptography-algorithms-vulnerability-state-as-quantum-computing-advances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189381.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">26</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1178</span> Classifying and Analysis 8-Bit to 8-Bit S-Boxes Characteristic Using S-Box Evaluation Characteristic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Luqman">Muhammad Luqman</a>, <a href="https://publications.waset.org/abstracts/search?q=Yusuf%20Kurniawan"> Yusuf Kurniawan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> S-Boxes is one of the linear parts of the cryptographic algorithm. The existence of S-Box in the cryptographic algorithm is needed to maintain non-linearity of the algorithm. Nowadays, modern cryptographic algorithms use an S-Box as a part of algorithm process. Despite the fact that several cryptographic algorithms today reuse theoretically secure and carefully constructed S-Boxes, there is an evaluation characteristic that can measure security properties of S-Boxes and hence the corresponding primitives. Analysis of an S-Box usually is done using manual mathematics calculation. Several S-Boxes are presented as a Truth Table without any mathematical background algorithm. Then, it’s rather difficult to determine the strength of Truth Table S-Box without a mathematical algorithm. A comprehensive analysis should be applied to the Truth Table S-Box to determine the characteristic. Several important characteristics should be owned by the S-Boxes, they are Nonlinearity, Balancedness, Algebraic degree, LAT, DAT, differential delta uniformity, correlation immunity and global avalanche criterion. Then, a comprehensive tool will be present to automatically calculate the characteristics of S-Boxes and determine the strength of S-Box. Comprehensive analysis is done on a deterministic process to produce a sequence of S-Boxes characteristic and give advice for a better S-Box construction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20properties" title="cryptographic properties">cryptographic properties</a>, <a href="https://publications.waset.org/abstracts/search?q=Truth%20Table%20S-Boxes" title=" Truth Table S-Boxes"> Truth Table S-Boxes</a>, <a href="https://publications.waset.org/abstracts/search?q=S-Boxes%20characteristic" title=" S-Boxes characteristic"> S-Boxes characteristic</a>, <a href="https://publications.waset.org/abstracts/search?q=deterministic%20process" title=" deterministic process"> deterministic process</a> </p> <a href="https://publications.waset.org/abstracts/65017/classifying-and-analysis-8-bit-to-8-bit-s-boxes-characteristic-using-s-box-evaluation-characteristic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65017.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">363</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1177</span> Integrating the Modbus SCADA Communication Protocol with Elliptic Curve Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Despoina%20Chochtoula">Despoina Chochtoula</a>, <a href="https://publications.waset.org/abstracts/search?q=Aristidis%20Ilias"> Aristidis Ilias</a>, <a href="https://publications.waset.org/abstracts/search?q=Yannis%20Stamatiou"> Yannis Stamatiou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modbus is a protocol that enables the communication among devices which are connected to the same network. This protocol is, often, deployed in connecting sensor and monitoring units to central supervisory servers in Supervisory Control and Data Acquisition, or SCADA, systems. These systems monitor critical infrastructures, such as factories, power generation stations, nuclear power reactors etc. in order to detect malfunctions and ignite alerts and corrective actions. However, due to their criticality, SCADA systems are vulnerable to attacks that range from simple eavesdropping on operation parameters, exchanged messages, and valuable infrastructure information to malicious modification of vital infrastructure data towards infliction of damage. Thus, the SCADA research community has been active over strengthening SCADA systems with suitable data protection mechanisms based, to a large extend, on cryptographic methods for data encryption, device authentication, and message integrity protection. However, due to the limited computation power of many SCADA sensor and embedded devices, the usual public key cryptographic methods are not appropriate due to their high computational requirements. As an alternative, Elliptic Curve Cryptography has been proposed, which requires smaller key sizes and, thus, less demanding cryptographic operations. Until now, however, no such implementation has been proposed in the SCADA literature, to the best of our knowledge. In order to fill this gap, our methodology was focused on integrating Modbus, a frequently used SCADA communication protocol, with Elliptic Curve based cryptography and develop a server/client application to demonstrate the proof of concept. For the implementation we deployed two C language libraries, which were suitably modify in order to be successfully integrated: libmodbus (https://github.com/stephane/libmodbus) and ecc-lib https://www.ceid.upatras.gr/webpages/faculty/zaro/software/ecc-lib/). The first library provides a C implementation of the Modbus/TCP protocol while the second one offers the functionality to develop cryptographic protocols based on Elliptic Curve Cryptography. These two libraries were combined, after suitable modifications and enhancements, in order to give a modified version of the Modbus/TCP protocol focusing on the security of the data exchanged among the devices and the supervisory servers. The mechanisms we implemented include key generation, key exchange/sharing, message authentication, data integrity check, and encryption/decryption of data. The key generation and key exchange protocols were implemented with the use of Elliptic Curve Cryptography primitives. The keys established by each device are saved in their local memory and are retained during the whole communication session and are used in encrypting and decrypting exchanged messages as well as certifying entities and the integrity of the messages. Finally, the modified library was compiled for the Android environment in order to run the server application as an Android app. The client program runs on a regular computer. The communication between these two entities is an example of the successful establishment of an Elliptic Curve Cryptography based, secure Modbus wireless communication session between a portable device acting as a supervisor station and a monitoring computer. Our first performance measurements are, also, very promising and demonstrate the feasibility of embedding Elliptic Curve Cryptography into SCADA systems, filling in a gap in the relevant scientific literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title="elliptic curve cryptography">elliptic curve cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=ICT%20security" title=" ICT security"> ICT security</a>, <a href="https://publications.waset.org/abstracts/search?q=modbus%20protocol" title=" modbus protocol"> modbus protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=SCADA" title=" SCADA"> SCADA</a>, <a href="https://publications.waset.org/abstracts/search?q=TCP%2FIP%20protocol" title=" TCP/IP protocol"> TCP/IP protocol</a> </p> <a href="https://publications.waset.org/abstracts/72732/integrating-the-modbus-scada-communication-protocol-with-elliptic-curve-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72732.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">271</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1176</span> The Effect of a Computer-Assisted Glycemic Surveillance Protocol on Nursing Workload</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=%C3%96zlem%20Canbolat">Özlem Canbolat</a>, <a href="https://publications.waset.org/abstracts/search?q=Sevgisun%20Kapucu"> Sevgisun Kapucu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this study was to determine the effect of a computer-assisted glycemic surveillance protocol on nursing workload in intensive care unit. The study is completed in an Education and Research Hospital in Ankara with the attendance of volunteered 19 nurse who had been worked in reanimation unit. Nurses used the written protocol and computer-assisted glycemic surveillance protocol for glycemic follow-up approach of the intensive care patients. Nurses used the written protocol first in the glycemic follow-up of the patient, then used the computer-assisted protocol. (Nurses used the written protocol first, then the computer-assisted protocol in the glycemic follow-up of the patient). Less time was spent in glycemic control with computerized protocol than written protocol and this difference is statistically significant (p < 0.001). It was determined that the computerized protocol application was completed in about 10 seconds (25% shorter) than the written protocol implementation. The computer-assisted glycemic surveillance protocol was found to be more easy and appropriate by nurses and the satisfaction level of the users was higher than with written protocol. While 79% of the nurses find it confusing to implement the written protocol, 79% were satisfied with the use of computerized protocol. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer-assisted%20protocol" title="computer-assisted protocol">computer-assisted protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=glycemic%20control" title=" glycemic control"> glycemic control</a>, <a href="https://publications.waset.org/abstracts/search?q=insulin%20infusion%20protocol" title=" insulin infusion protocol"> insulin infusion protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=intensive%20care" title=" intensive care"> intensive care</a>, <a href="https://publications.waset.org/abstracts/search?q=nursing%20workload" title=" nursing workload"> nursing workload</a> </p> <a href="https://publications.waset.org/abstracts/81279/the-effect-of-a-computer-assisted-glycemic-surveillance-protocol-on-nursing-workload" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81279.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">221</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1175</span> Cryptographic Resource Allocation Algorithm Based on Deep Reinforcement Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xu%20Jie">Xu Jie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a key network security method, cryptographic services must fully cope with problems such as the wide variety of cryptographic algorithms, high concurrency requirements, random job crossovers, and instantaneous surges in workloads. Its complexity and dynamics also make it difficult for traditional static security policies to cope with the ever-changing situation. Cyber Threats and Environment. Traditional resource scheduling algorithms are inadequate when facing complex decision-making problems in dynamic environments. A network cryptographic resource allocation algorithm based on reinforcement learning is proposed, aiming to optimize task energy consumption, migration cost, and fitness of differentiated services (including user, data, and task security) by modeling the multi-job collaborative cryptographic service scheduling problem as a multi-objective optimized job flow scheduling problem and using a multi-agent reinforcement learning method, efficient scheduling and optimal configuration of cryptographic service resources are achieved. By introducing reinforcement learning, resource allocation strategies can be adjusted in real-time in a dynamic environment, improving resource utilization and achieving load balancing. Experimental results show that this algorithm has significant advantages in path planning length, system delay and network load balancing and effectively solves the problem of complex resource scheduling in cryptographic services. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cloud%20computing" title="cloud computing">cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography%20on-demand%20service" title=" cryptography on-demand service"> cryptography on-demand service</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforcement%20learning" title=" reinforcement learning"> reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=workflow%20scheduling" title=" workflow scheduling"> workflow scheduling</a> </p> <a href="https://publications.waset.org/abstracts/193329/cryptographic-resource-allocation-algorithm-based-on-deep-reinforcement-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193329.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">15</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1174</span> On the Analysis of Pseudorandom Partial Quotient Sequences Generated from Continued Fractions</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20Padma">T. Padma</a>, <a href="https://publications.waset.org/abstracts/search?q=Jayashree%20S.%20Pillai"> Jayashree S. Pillai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Random entities are an essential component in any cryptographic application. The suitability of a number theory based novel pseudorandom sequence called Pseudorandom Partial Quotient Sequence (PPQS) generated from the continued fraction expansion of irrational numbers, in cryptographic applications, is analyzed in this paper. An approach to build the algorithm around a hard mathematical problem has been considered. The PQ sequence is tested for randomness and its suitability as a cryptographic key by performing randomness analysis, key sensitivity and key space analysis, precision analysis and evaluating the correlation properties is established. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudorandom%20sequences" title="pseudorandom sequences">pseudorandom sequences</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20sensitivity" title=" key sensitivity"> key sensitivity</a>, <a href="https://publications.waset.org/abstracts/search?q=correlation" title=" correlation"> correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20analysis" title=" security analysis"> security analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=randomness%20analysis" title=" randomness analysis"> randomness analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitivity%20analysis" title=" sensitivity analysis"> sensitivity analysis</a> </p> <a href="https://publications.waset.org/abstracts/26665/on-the-analysis-of-pseudorandom-partial-quotient-sequences-generated-from-continued-fractions" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26665.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">591</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1173</span> A Hill Cipher Based on the Kish-Sethuraman Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kondwani%20Magamba">Kondwani Magamba</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the idealized Kish-Sethuraman (KS) protocol,messages are sent between Alice and Bob each using a secret personal key. This protocol is said to be perfectly secure because both Bob and Alice keep their keys undisclosed so that at all times the message is encrypted by at least one key, thus no information is leaked or shared. In this paper, we propose a realization of the KS protocol through the use of the Hill Cipher. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kish-Sethuraman%20Protocol" title="Kish-Sethuraman Protocol">Kish-Sethuraman Protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=Hill%20Cipher" title=" Hill Cipher"> Hill Cipher</a>, <a href="https://publications.waset.org/abstracts/search?q=MDS%20Matrices" title=" MDS Matrices"> MDS Matrices</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a> </p> <a href="https://publications.waset.org/abstracts/15505/a-hill-cipher-based-on-the-kish-sethuraman-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15505.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">357</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1172</span> Exploring the Applications of Modular Forms in Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Berhane%20Tewelday%20Weldhiwot">Berhane Tewelday Weldhiwot</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research investigates the pivotal role of modular forms in modern cryptographic systems, particularly focusing on their applications in secure communications and data integrity. Modular forms, which are complex analytic functions with rich arithmetic properties, have gained prominence due to their connections to number theory and algebraic geometry. This study begins by outlining the fundamental concepts of modular forms and their historical development, followed by a detailed examination of their applications in cryptographic protocols such as elliptic curve cryptography and zero-knowledge proofs. By employing techniques from analytic number theory, the research delves into how modular forms can enhance the efficiency and security of cryptographic algorithms. The findings suggest that leveraging modular forms not only improves computational performance but also fortifies security measures against emerging threats in digital communication. This work aims to contribute to the ongoing discourse on integrating advanced mathematical theories into practical applications, ultimately fostering innovation in cryptographic methodologies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modular%20forms" title="modular forms">modular forms</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curves" title=" elliptic curves"> elliptic curves</a>, <a href="https://publications.waset.org/abstracts/search?q=applications" title=" applications"> applications</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20theory" title=" mathematical theory"> mathematical theory</a> </p> <a href="https://publications.waset.org/abstracts/192634/exploring-the-applications-of-modular-forms-in-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192634.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">16</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1171</span> The Complexity of Testing Cryptographic Devices on Input Faults</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alisher%20Ikramov">Alisher Ikramov</a>, <a href="https://publications.waset.org/abstracts/search?q=Gayrat%20Juraev"> Gayrat Juraev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The production of logic devices faces the occurrence of faults during manufacturing. This work analyses the complexity of testing a special type of logic device on inverse, adhesion, and constant input faults. The focus of this work is on devices that implement cryptographic functions. The complexity values for the general case faults and for some frequently occurring subsets were determined and proved in this work. For a special case, when the length of the text block is equal to the length of the key block, the complexity of testing is proven to be asymptotically half the complexity of testing all logic devices on the same types of input faults. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=complexity" title="complexity">complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20devices" title=" cryptographic devices"> cryptographic devices</a>, <a href="https://publications.waset.org/abstracts/search?q=input%20faults" title=" input faults"> input faults</a>, <a href="https://publications.waset.org/abstracts/search?q=testing" title=" testing"> testing</a> </p> <a href="https://publications.waset.org/abstracts/138485/the-complexity-of-testing-cryptographic-devices-on-input-faults" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138485.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">226</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1170</span> Evaluation of Collect Tree Protocol for Structural Health Monitoring System Using Wireless Sensor Networks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amira%20Zrelli">Amira Zrelli</a>, <a href="https://publications.waset.org/abstracts/search?q=Tahar%20Ezzedine"> Tahar Ezzedine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Routing protocol may enhance the lifetime of sensor network, it has a highly importance, especially in wireless sensor network (WSN). Therefore, routing protocol has a big effect in these networks, thus the choice of routing protocol must be studied before setting up our network. In this work, we implement the routing protocol collect tree protocol (CTP) which is one of the hierarchic protocols used in structural health monitoring (SHM). Therefore, to evaluate the performance of this protocol, we choice to work with Contiki system and Cooja simulator. By throughput and RSSI evaluation of each node, we will deduce about the utility of CTP in structural monitoring system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CTP" title="CTP">CTP</a>, <a href="https://publications.waset.org/abstracts/search?q=WSN" title=" WSN"> WSN</a>, <a href="https://publications.waset.org/abstracts/search?q=SHM" title=" SHM"> SHM</a>, <a href="https://publications.waset.org/abstracts/search?q=routing%20protocol" title=" routing protocol"> routing protocol</a> </p> <a href="https://publications.waset.org/abstracts/72336/evaluation-of-collect-tree-protocol-for-structural-health-monitoring-system-using-wireless-sensor-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72336.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">296</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1169</span> Introduction to Multi-Agent Deep Deterministic Policy Gradient</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xu%20Jie">Xu Jie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a key network security method, cryptographic services must fully cope with problems such as the wide variety of cryptographic algorithms, high concurrency requirements, random job crossovers, and instantaneous surges in workloads. Its complexity and dynamics also make it difficult for traditional static security policies to cope with the ever-changing situation. Cyber Threats and Environment. Traditional resource scheduling algorithms are inadequate when facing complex decisionmaking problems in dynamic environments. A network cryptographic resource allocation algorithm based on reinforcement learning is proposed, aiming to optimize task energy consumption, migration cost, and fitness of differentiated services (including user, data, and task security). By modeling the multi-job collaborative cryptographic service scheduling problem as a multiobjective optimized job flow scheduling problem, and using a multi-agent reinforcement learning method, efficient scheduling and optimal configuration of cryptographic service resources are achieved. By introducing reinforcement learning, resource allocation strategies can be adjusted in real time in a dynamic environment, improving resource utilization and achieving load balancing. Experimental results show that this algorithm has significant advantages in path planning length, system delay and network load balancing, and effectively solves the problem of complex resource scheduling in cryptographic services. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20reinforcement%20learning" title="multi-agent reinforcement learning">multi-agent reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=non-stationary%20dynamics" title=" non-stationary dynamics"> non-stationary dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-agent%20systems" title=" multi-agent systems"> multi-agent systems</a>, <a href="https://publications.waset.org/abstracts/search?q=cooperative%20and%20competitive%20agents" title=" cooperative and competitive agents"> cooperative and competitive agents</a> </p> <a href="https://publications.waset.org/abstracts/191046/introduction-to-multi-agent-deep-deterministic-policy-gradient" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191046.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">24</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1168</span> Red Green Blue Image Encryption Based on Paillier Cryptographic System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mamadou%20I.%20Wade">Mamadou I. Wade</a>, <a href="https://publications.waset.org/abstracts/search?q=Henry%20C.%20Ogworonjo"> Henry C. Ogworonjo</a>, <a href="https://publications.waset.org/abstracts/search?q=Madiha%20Gul"> Madiha Gul</a>, <a href="https://publications.waset.org/abstracts/search?q=Mandoye%20Ndoye"> Mandoye Ndoye</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Chouikha"> Mohamed Chouikha</a>, <a href="https://publications.waset.org/abstracts/search?q=Wayne%20Patterson"> Wayne Patterson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a novel application of the Paillier cryptographic system to the encryption of RGB (Red Green Blue) images. In this method, an RGB image is first separated into its constituent channel images, and the Paillier encryption function is applied to each of the channels pixel intensity values. Next, the encrypted image is combined and compressed if necessary before being transmitted through an unsecured communication channel. The transmitted image is subsequently recovered by a decryption process. We performed a series of security and performance analyses to the recovered images in order to verify their robustness to security attack. The results show that the proposed image encryption scheme produces highly secured encrypted images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20encryption" title="image encryption">image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Paillier%20cryptographic%20system" title=" Paillier cryptographic system"> Paillier cryptographic system</a>, <a href="https://publications.waset.org/abstracts/search?q=RBG%20image%20encryption" title=" RBG image encryption"> RBG image encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=Paillier" title=" Paillier"> Paillier</a> </p> <a href="https://publications.waset.org/abstracts/79232/red-green-blue-image-encryption-based-on-paillier-cryptographic-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79232.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">238</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1167</span> Achieving Better Security by Using Nonlinear Cellular Automata as a Cryptographic Primitive</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Swapan%20Maiti">Swapan Maiti</a>, <a href="https://publications.waset.org/abstracts/search?q=Dipanwita%20Roy%20Chowdhury"> Dipanwita Roy Chowdhury</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nonlinear functions are essential in different cryptoprimitives as they play an important role on the security of the cipher designs. Rule 30 was identified as a powerful nonlinear function for cryptographic applications. However, an attack (MS attack) was mounted against Rule 30 Cellular Automata (CA). Nonlinear rules as well as maximum period CA increase randomness property. In this work, nonlinear rules of maximum period nonlinear hybrid CA (M-NHCA) are studied and it is shown to be a better crypto-primitive than Rule 30 CA. It has also been analysed that the M-NHCA with single nonlinearity injection proposed in the literature is vulnerable against MS attack, whereas M-NHCA with multiple nonlinearity injections provide maximum length cycle as well as better cryptographic primitives and they are also secure against MS attack. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cellular%20automata" title="cellular automata">cellular automata</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20period%20nonlinear%20CA" title=" maximum period nonlinear CA"> maximum period nonlinear CA</a>, <a href="https://publications.waset.org/abstracts/search?q=Meier%20and%20Staffelbach%20attack" title=" Meier and Staffelbach attack"> Meier and Staffelbach attack</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20functions" title=" nonlinear functions"> nonlinear functions</a> </p> <a href="https://publications.waset.org/abstracts/72864/achieving-better-security-by-using-nonlinear-cellular-automata-as-a-cryptographic-primitive" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72864.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">314</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1166</span> Secure Optical Communication System Using Quantum Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ehab%20AbdulRazzaq%20Hussein">Ehab AbdulRazzaq Hussein</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum cryptography (QC) is an emerging technology for secure key distribution with single-photon transmissions. In contrast to classical cryptographic schemes, the security of QC schemes is guaranteed by the fundamental laws of nature. Their security stems from the impossibility to distinguish non-orthogonal quantum states with certainty. A potential eavesdropper introduces errors in the transmissions, which can later be discovered by the legitimate participants of the communication. In this paper, the modeling approach is proposed for QC protocol BB84 using polarization coding. The single-photon system is assumed to be used in the designed models. Thus, Eve cannot use beam-splitting strategy to eavesdrop on the quantum channel transmission. The only eavesdropping strategy possible to Eve is the intercept/resend strategy. After quantum transmission of the QC protocol, the quantum bit error rate (QBER) is estimated and compared with a threshold value. If it is above this value the procedure must be stopped and performed later again. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=security" title="security">security</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20distribution" title=" key distribution"> key distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptography" title=" cryptography"> cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20protocols" title=" quantum protocols"> quantum protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=Quantum%20Cryptography%20%28QC%29" title=" Quantum Cryptography (QC)"> Quantum Cryptography (QC)</a>, <a href="https://publications.waset.org/abstracts/search?q=Quantum%20Key%20Distribution%20%28QKD%29." title=" Quantum Key Distribution (QKD)."> Quantum Key Distribution (QKD).</a> </p> <a href="https://publications.waset.org/abstracts/2413/secure-optical-communication-system-using-quantum-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2413.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">406</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1165</span> Software Quality Assurance in Network Security using Cryptographic Techniques</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sidra%20Shabbir">Sidra Shabbir</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayesha%20Manzoor"> Ayesha Manzoor</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehreen%20Sirshar"> Mehreen Sirshar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of the network communication has imposed serious threats to the security of assets over the network. Network security is getting more prone to active and passive attacks which may result in serious consequences to data integrity, confidentiality and availability. Various cryptographic techniques have been proposed in the past few years to combat with the concerned problem by ensuring quality but in order to have a fully secured network; a framework of new cryptosystem was needed. This paper discusses certain cryptographic techniques which have shown far better improvement in the network security with enhanced quality assurance. The scope of this research paper is to cover the security pitfalls in the current systems and their possible solutions based on the new cryptosystems. The development of new cryptosystem framework has paved a new way to the widespread network communications with enhanced quality in network security. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptography" title="cryptography">cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=decryption" title=" decryption"> decryption</a>, <a href="https://publications.waset.org/abstracts/search?q=integrity" title=" integrity"> integrity</a>, <a href="https://publications.waset.org/abstracts/search?q=confidentiality" title=" confidentiality"> confidentiality</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20algorithms" title=" security algorithms"> security algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=elliptic%20curve%20cryptography" title=" elliptic curve cryptography"> elliptic curve cryptography</a> </p> <a href="https://publications.waset.org/abstracts/26324/software-quality-assurance-in-network-security-using-cryptographic-techniques" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/26324.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">733</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1164</span> NFC Communications with Mutual Authentication Based on Limited-Use Session Keys </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chalee%20Thammarat">Chalee Thammarat</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile phones are equipped with increased short-range communication functionality called Near Field Communication (or NFC for short). NFC needs no pairing between devices but suitable for little amounts of data in a very restricted area. A number of researchers presented authentication techniques for NFC communications, however, they still lack necessary authentication, particularly mutual authentication and security qualifications. This paper suggests a new authentication protocol for NFC communication that gives mutual authentication between devices. The mutual authentication is a one of property, of security that protects replay and man-in-the-middle (MitM) attack. The proposed protocols deploy a limited-use offline session key generation and use of distribution technique to increase security and make our protocol lightweight. There are four sub-protocols: NFCAuthv1 is suitable for identification and access control and NFCAuthv2 is suitable for the NFC-enhanced phone by a POS terminal for digital and physical goods and services. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocols" title="cryptographic protocols">cryptographic protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=NFC" title=" NFC"> NFC</a>, <a href="https://publications.waset.org/abstracts/search?q=near%20field%20communications" title=" near field communications"> near field communications</a>, <a href="https://publications.waset.org/abstracts/search?q=security%20protocols" title=" security protocols"> security protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=mutual%20authentication" title=" mutual authentication"> mutual authentication</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20security" title=" network security"> network security</a> </p> <a href="https://publications.waset.org/abstracts/33236/nfc-communications-with-mutual-authentication-based-on-limited-use-session-keys" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33236.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">430</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1163</span> New Practical and Non-Malleable Elgamal Encryption for E-Voting Protoco</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Karima%20Djebaili">Karima Djebaili</a>, <a href="https://publications.waset.org/abstracts/search?q=Lamine%20Melkemi"> Lamine Melkemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Elgamal encryption is a fundamental public-key encryption in cryptography, which is based on the difficulty of discrete logarithm problem and the Diffie-Hellman problem. Supposing the Diffie–Hellman problem is computationally infeasible then Elgamal is secure under a chosen plaintext attack, where security indicates it is difficult for the attacker, given the ciphertext, to restore the whole of the plaintext. However, although it is secure against chosen plaintext attack, Elgamal is absolutely malleable i.e. is not secure against an adaptive chosen ciphertext attack, where the attacker can recover the plaintext. We present a extension on Elgamal encryption which result in non-malleability against adaptive chosen plaintext attack using concatenation and a cryptographic hash function, our evidence utilizes the device of plaintext aware. The algorithm proposed can be used in cryptography voting protocol given its level security. Our protocol protects the confidentiality of voters because each voter encrypts their choice before casting their vote, offers public verifiability using a signing algorithm, the final result is correctly computed using homomorphic property, and works even in the presence of an adversary due to the propriety of non-malleability. Moreover, the protocol prevents some parties colluding to fix the vote results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elgamal%20encryption" title="Elgamal encryption">Elgamal encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=non-malleability" title=" non-malleability"> non-malleability</a>, <a href="https://publications.waset.org/abstracts/search?q=plaintext%20aware" title=" plaintext aware"> plaintext aware</a>, <a href="https://publications.waset.org/abstracts/search?q=e-voting" title=" e-voting"> e-voting</a> </p> <a href="https://publications.waset.org/abstracts/21307/new-practical-and-non-malleable-elgamal-encryption-for-e-voting-protoco" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21307.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">451</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1162</span> Modeling and Analyzing the WAP Class 2 Wireless Transaction Protocol Using Event-B </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajaa%20Filali">Rajaa Filali</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Bouhdadi"> Mohamed Bouhdadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an incremental formal development of the Wireless Transaction Protocol (WTP) in Event-B. WTP is part of the Wireless Application Protocol (WAP) architectures and provides a reliable request-response service. To model and verify the protocol, we use the formal technique Event-B which provides an accessible and rigorous development method. This interaction between modelling and proving reduces the complexity and helps to eliminate misunderstandings, inconsistencies, and specification gaps. As result, verification of WTP allows us to find some deficiencies in the current specification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=event-B" title="event-B">event-B</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20transaction%20protocol" title=" wireless transaction protocol"> wireless transaction protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=proof%20obligation" title=" proof obligation"> proof obligation</a>, <a href="https://publications.waset.org/abstracts/search?q=refinement" title=" refinement"> refinement</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodin" title=" Rodin"> Rodin</a>, <a href="https://publications.waset.org/abstracts/search?q=ProB" title=" ProB"> ProB</a> </p> <a href="https://publications.waset.org/abstracts/73221/modeling-and-analyzing-the-wap-class-2-wireless-transaction-protocol-using-event-b" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73221.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">317</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1161</span> The Study of ZigBee Protocol Application in Wireless Networks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ardavan%20Zamanpour">Ardavan Zamanpour</a>, <a href="https://publications.waset.org/abstracts/search?q=Somaieh%20Yassari"> Somaieh Yassari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> ZigBee protocol network was developed in industries and MIT laboratory in 1997. ZigBee is a wireless networking technology by alliance ZigBee which is designed to low board and low data rate applications. It is a Protocol which connects between electrical devises with very low energy and cost. The first version of IEEE 802.15.4 which was formed ZigBee was based on 2.4GHZ MHZ 912MHZ 868 frequency band. The name of system is often reminded random directions that bees (BEES) traversing during pollination of products. Such as alloy of the ways in which information packets are traversed within the mesh network. This paper aims to study the performance and effectiveness of this protocol in wireless networks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ZigBee" title="ZigBee">ZigBee</a>, <a href="https://publications.waset.org/abstracts/search?q=protocol" title=" protocol"> protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless" title=" wireless"> wireless</a>, <a href="https://publications.waset.org/abstracts/search?q=networks" title=" networks"> networks</a> </p> <a href="https://publications.waset.org/abstracts/33901/the-study-of-zigbee-protocol-application-in-wireless-networks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33901.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1160</span> Design and Implementation of a Hardened Cryptographic Coprocessor with 128-bit RISC-V Core</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yashas%20Bedre%20Raghavendra">Yashas Bedre Raghavendra</a>, <a href="https://publications.waset.org/abstracts/search?q=Pim%20Vullers"> Pim Vullers</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents the design and implementation of an abstract cryptographic coprocessor, leveraging AMBA(Advanced Microcontroller Bus Architecture) protocols - APB (Advanced Peripheral Bus) and AHB (Advanced High-performance Bus), to enable seamless integration with the main CPU(Central processing unit) and enhance the coprocessor’s algorithm flexibility. The primary objective is to create a versatile coprocessor that can execute various cryptographic algorithms, including ECC(Elliptic-curve cryptography), RSA(Rivest–Shamir–Adleman), and AES (Advanced Encryption Standard) while providing a robust and secure solution for modern secure embedded systems. To achieve this goal, the coprocessor is equipped with a tightly coupled memory (TCM) for rapid data access during cryptographic operations. The TCM is placed within the coprocessor, ensuring quick retrieval of critical data and optimizing overall performance. Additionally, the program memory is positioned outside the coprocessor, allowing for easy updates and reconfiguration, which enhances adaptability to future algorithm implementations. Direct links are employed instead of DMA(Direct memory access) for data transfer, ensuring faster communication and reducing complexity. The AMBA-based communication architecture facilitates seamless interaction between the coprocessor and the main CPU, streamlining data flow and ensuring efficient utilization of system resources. The abstract nature of the coprocessor allows for easy integration of new cryptographic algorithms in the future. As the security landscape continues to evolve, the coprocessor can adapt and incorporate emerging algorithms, making it a future-proof solution for cryptographic processing. Furthermore, this study explores the addition of custom instructions into RISC-V ISE (Instruction Set Extension) to enhance cryptographic operations. By incorporating custom instructions specifically tailored for cryptographic algorithms, the coprocessor achieves higher efficiency and reduced cycles per instruction (CPI) compared to traditional instruction sets. The adoption of RISC-V 128-bit architecture significantly reduces the total number of instructions required for complex cryptographic tasks, leading to faster execution times and improved overall performance. Comparisons are made with 32-bit and 64-bit architectures, highlighting the advantages of the 128-bit architecture in terms of reduced instruction count and CPI. In conclusion, the abstract cryptographic coprocessor presented in this study offers significant advantages in terms of algorithm flexibility, security, and integration with the main CPU. By leveraging AMBA protocols and employing direct links for data transfer, the coprocessor achieves high-performance cryptographic operations without compromising system efficiency. With its TCM and external program memory, the coprocessor is capable of securely executing a wide range of cryptographic algorithms. This versatility and adaptability, coupled with the benefits of custom instructions and the 128-bit architecture, make it an invaluable asset for secure embedded systems, meeting the demands of modern cryptographic applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=abstract%20cryptographic%20coprocessor" title="abstract cryptographic coprocessor">abstract cryptographic coprocessor</a>, <a href="https://publications.waset.org/abstracts/search?q=AMBA%20protocols" title=" AMBA protocols"> AMBA protocols</a>, <a href="https://publications.waset.org/abstracts/search?q=ECC" title=" ECC"> ECC</a>, <a href="https://publications.waset.org/abstracts/search?q=RSA" title=" RSA"> RSA</a>, <a href="https://publications.waset.org/abstracts/search?q=AES" title=" AES"> AES</a>, <a href="https://publications.waset.org/abstracts/search?q=tightly%20coupled%20memory" title=" tightly coupled memory"> tightly coupled memory</a>, <a href="https://publications.waset.org/abstracts/search?q=secure%20embedded%20systems" title=" secure embedded systems"> secure embedded systems</a>, <a href="https://publications.waset.org/abstracts/search?q=RISC-V%20ISE" title=" RISC-V ISE"> RISC-V ISE</a>, <a href="https://publications.waset.org/abstracts/search?q=custom%20instructions" title=" custom instructions"> custom instructions</a>, <a href="https://publications.waset.org/abstracts/search?q=instruction%20count" title=" instruction count"> instruction count</a>, <a href="https://publications.waset.org/abstracts/search?q=cycles%20per%20instruction" title=" cycles per instruction"> cycles per instruction</a> </p> <a href="https://publications.waset.org/abstracts/170834/design-and-implementation-of-a-hardened-cryptographic-coprocessor-with-128-bit-risc-v-core" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/170834.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">70</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1159</span> Data Security in Cloud Storage</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amir%20Rashid">Amir Rashid</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Today is the world of innovation and Cloud Computing is becoming a day to day technology with every passing day offering remarkable services and features on the go with rapid elasticity. This platform took business computing into an innovative dimension where clients interact and operate through service provider web portals. Initially, the trust relationship between client and service provider remained a big question but with the invention of several cryptographic paradigms, it is becoming common in everyday business. This research work proposes a solution for building a cloud storage service with respect to Data Security addressing public cloud infrastructure where the trust relationship matters a lot between client and service provider. For the great satisfaction of client regarding high-end Data Security, this research paper propose a layer of cryptographic primitives combining several architectures in order to achieve the goal. A survey has been conducted to determine the benefits for such an architecture would provide to both clients/service providers and recent developments in cryptography specifically by cloud storage. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20security%20in%20cloud%20computing" title="data security in cloud computing">data security in cloud computing</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud%20storage%20architecture" title=" cloud storage architecture"> cloud storage architecture</a>, <a href="https://publications.waset.org/abstracts/search?q=cryptographic%20developments" title=" cryptographic developments"> cryptographic developments</a>, <a href="https://publications.waset.org/abstracts/search?q=token%20key" title=" token key"> token key</a> </p> <a href="https://publications.waset.org/abstracts/86108/data-security-in-cloud-storage" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86108.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">294</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1158</span> An Incremental Refinement Approach to a Development of Dynamic Host Configuration Protocol (DHCP) Using Event-B</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rajaa%20Filali">Rajaa Filali</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Bouhdadi"> Mohamed Bouhdadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an incremental development of the Dynamic Host Configuration Protocol (DHCP) in Event-B. DHCP is widely used communication protocol, which provides a standard mechanism to obtain configuration parameters. The specification is performed in a stepwise manner and verified through a series of refinements. The Event-B formal method uses the Rodin platform to modeling and verifying some properties of the protocol such as safety, liveness and deadlock freedom. To model and verify the protocol, we use the formal technique Event-B which provides an accessible and rigorous development method. This interaction between modelling and proving reduces the complexity and helps to eliminate misunderstandings, inconsistencies, and specification gaps. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DHCP%20protocol" title="DHCP protocol">DHCP protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=Event-B" title=" Event-B"> Event-B</a>, <a href="https://publications.waset.org/abstracts/search?q=refinement" title=" refinement"> refinement</a>, <a href="https://publications.waset.org/abstracts/search?q=proof%20obligation" title=" proof obligation"> proof obligation</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodin" title=" Rodin"> Rodin</a> </p> <a href="https://publications.waset.org/abstracts/75956/an-incremental-refinement-approach-to-a-development-of-dynamic-host-configuration-protocol-dhcp-using-event-b" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75956.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">228</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1157</span> Implementation of the Interlock Protocol to Enhance Security in Unmanned Aerial Vehicles</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vikram%20Prabhu">Vikram Prabhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Shikh%20Bahaei"> Mohammad Shikh Bahaei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper depicts the implementation of a new infallible technique to protect an Unmanned Aerial Vehicle from cyber-attacks. An Unmanned Aerial Vehicle (UAV) could be vulnerable to cyber-attacks because of jammers or eavesdroppers over the network which pose as a threat to the security of the UAV. In the field of network security, there are quite a few protocols which can be used to establish a secure connection between UAVs and their Operators. In this paper, we discuss how the Interlock Protocol could be implemented to foil the Man-in-the-Middle Attack. In this case, Wireshark has been used as the sniffer (man-in-the-middle). This paper also shows a comparison between the Interlock Protocol and the TCP Protocols using cryptcat and netcat and at the same time highlights why the Interlock Protocol is the most efficient security protocol to prevent eavesdropping over the communication channel. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=interlock%20protocol" title="interlock protocol">interlock protocol</a>, <a href="https://publications.waset.org/abstracts/search?q=Diffie-Hellman%20algorithm" title=" Diffie-Hellman algorithm"> Diffie-Hellman algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=unmanned%20aerial%20vehicles" title=" unmanned aerial vehicles"> unmanned aerial vehicles</a>, <a href="https://publications.waset.org/abstracts/search?q=control%20station" title=" control station"> control station</a>, <a href="https://publications.waset.org/abstracts/search?q=man-in-the-middle%20attack" title=" man-in-the-middle attack"> man-in-the-middle attack</a>, <a href="https://publications.waset.org/abstracts/search?q=Wireshark" title=" Wireshark "> Wireshark </a> </p> <a href="https://publications.waset.org/abstracts/78890/implementation-of-the-interlock-protocol-to-enhance-security-in-unmanned-aerial-vehicles" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78890.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">301</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1156</span> Security Analysis of SIMSec Protocol</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kerem%20Ok">Kerem Ok</a>, <a href="https://publications.waset.org/abstracts/search?q=Cem%20Cevikbas"> Cem Cevikbas</a>, <a href="https://publications.waset.org/abstracts/search?q=Vedat%20Coskun"> Vedat Coskun</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Alsadi"> Mohammed Alsadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Busra%20Ozdenizci"> Busra Ozdenizci</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Un-keyed SIM cards do not contain the required security infrastructure to provide end-to-end encryption with Service Providers. Hence, new, emerging, or smart services those require end-to-end encryption between SIM card and a Service Provider is impossible. SIMSec key exchange protocol creates symmetric keys between SIM card and Service Provider. After a successful protocol execution, SIM card and Service Provider creates the symmetric keys and can perform end-to-end data encryption when required. In this paper, our aim is to analyze the SIMSec protocol’s security. According to the results, SIM card and Service Provider can generate keys securely using SIMSec protocol. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=End-to-end%20encryption" title="End-to-end encryption">End-to-end encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=key%20exchange" title=" key exchange"> key exchange</a>, <a href="https://publications.waset.org/abstracts/search?q=SIM%20card" title=" SIM card"> SIM card</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20card" title=" smart card"> smart card</a> </p> <a href="https://publications.waset.org/abstracts/46503/security-analysis-of-simsec-protocol" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">284</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1155</span> A Biometric Template Security Approach to Fingerprints Based on Polynomial Transformations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramon%20Santana">Ramon Santana</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The use of biometric identifiers in the field of information security, access control to resources, authentication in ATMs and banking among others, are of great concern because of the safety of biometric data. In the general architecture of a biometric system have been detected eight vulnerabilities, six of them allow obtaining minutiae template in plain text. The main consequence of obtaining minutia templates is the loss of biometric identifier for life. To mitigate these vulnerabilities several models to protect minutiae templates have been proposed. Several vulnerabilities in the cryptographic security of these models allow to obtain biometric data in plain text. In order to increase the cryptographic security and ease of reversibility, a minutiae templates protection model is proposed. The model aims to make the cryptographic protection and facilitate the reversibility of data using two levels of security. The first level of security is the data transformation level. In this level generates invariant data to rotation and translation, further transformation is irreversible. The second level of security is the evaluation level, where the encryption key is generated and data is evaluated using a defined evaluation function. The model is aimed at mitigating known vulnerabilities of the proposed models, basing its security on the impossibility of the polynomial reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fingerprint" title="fingerprint">fingerprint</a>, <a href="https://publications.waset.org/abstracts/search?q=template%20protection" title=" template protection"> template protection</a>, <a href="https://publications.waset.org/abstracts/search?q=bio-cryptography" title=" bio-cryptography"> bio-cryptography</a>, <a href="https://publications.waset.org/abstracts/search?q=minutiae%20protection" title=" minutiae protection"> minutiae protection</a> </p> <a href="https://publications.waset.org/abstracts/95139/a-biometric-template-security-approach-to-fingerprints-based-on-polynomial-transformations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95139.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">170</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=39">39</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=40">40</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=cryptographic%20protocol&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>