DOCSLIB.ORG

A Systematic Security Approach in Wireless Mesh Networks Xia Wang Iowa State University

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Systematic Security Approach in Wireless Mesh Networks Xia Wang Iowa State University Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2009 A Systematic Security Approach in Wireless Mesh Networks Xia Wang Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Computer Sciences Commons Recommended Citation Wang, Xia, "A Systematic Security Approach in Wireless Mesh Networks" (2009). Graduate Theses and Dissertations. 10729. https://lib.dr.iastate.edu/etd/10729 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. A systematic security approach in wireless mesh networks by Xia Wang A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Computer Science Program of Study Committee: Johnny S. Wong, Major Professor Ying Cai Wensheng Zhang Yong Guan Thomas E. Daniels Iowa State University Ames, Iowa 2009 Copyright °c Xia Wang, 2009. All rights reserved. ii DEDICATION To my parents and my husband - Without whose love and support I would not have been able to complete this work iii TABLE OF CONTENTS LIST OF TABLES . viii LIST OF FIGURES . ix ACKNOWLEDGEMENTS . xi ABSTRACT . xii CHAPTER 1. OVERVIEW . 1 1.1 Introduction . 1 1.2 Wireless Mesh Network . 3 1.2.1 Network Architecture . 3 1.2.2 Characteristics . 4 1.2.3 Applications . 5 1.2.4 Testbeds and Implementations . 6 1.3 Taxonomy of Wireless Attacks in Wireless Mesh Networks . 8 1.4 Challenges and Issues in Wireless Mesh Networks . 11 1.5 Contribution of the Thesis . 12 1.6 Organization of the Thesis . 13 CHAPTER 2. REVIEW OF LITERATURE . 14 2.1 Group Key Management in Wireless Mesh Networks . 14 2.1.1 Introduction . 14 2.1.2 Classification of Group Key Management . 16 2.1.3 Centralized Group Key Management . 16 iv 2.1.4 Decentralized Group Key Management . 18 2.1.5 Distributed Group Key Management . 19 2.2 Intrusion Detection in Wireless Mesh Networks . 20 2.2.1 Introduction . 20 2.2.2 Single-layer Based Intrusion Detection Methods . 22 2.2.3 Cross-layer Based Intrusion Detection Schemes . 23 2.3 Intrusion Response in Multi-hop Wireless Networks . 24 2.3.1 Introduction . 24 2.3.2 Existing Solutions for Intrusion Response . 24 2.4 Summary . 26 CHAPTER 3. A HETEROGENEITY-AWARE FRAMEWORK OF GROUP KEY MANAGEMENT IN WIRELESS MESH NETWORKS . 27 3.1 Introduction . 27 3.2 System Model . 30 3.2.1 Trust Model . 30 3.2.2 Attack Model . 30 3.3 A Heterogeneity-Aware Group Key Management Framework . 32 3.3.1 A Multicast Session in WMN . 33 3.3.2 Initialization of Subgroup Leaders . 34 3.3.3 Join/Leave of a Group Member . 36 3.3.4 Revocation of a Subgroup Leader . 36 3.4 A Heterogeneity-Aware Group Key (HAGK) Management Scheme . 37 3.4.1 Group Initialization . 37 3.4.2 Threshold-based Key Agreement Protocol . 41 3.4.3 Hierarchical Key Tree . 42 3.4.4 Mobility Management . 42 v 3.4.5 Reactive Initialization . 45 3.5 Discussion . 45 3.5.1 Security Analysis . 45 3.5.2 Communication Overhead . 46 3.5.3 Other Issues . 47 3.6 Performance Evaluation . 48 3.6.1 Analysis of Storage Overhead . 48 3.6.2 Simulation . 48 3.7 Summary . 53 CHAPTER 4. CROSS-LAYER DESIGN OF INTRUSION DETECTION IN WIRE- LESS MESH NETWORKS . 58 4.1 Motivation . 58 4.2 Quality Based Routing Metrics . 61 4.3 Cross Layer Detection Model . 63 4.4 Anomaly Detection . 64 4.4.1 Threats in Wireless Mesh Networks . 64 4.4.2 Feature Selection . 65 4.4.3 Classifier . 66 4.5 Experimental Study . 67 4.5.1 Wireless Mesh Network Testbed . 67 4.5.2 Implementation of System Prototype . 68 4.5.3 Performance Evaluation . 69 4.5.4 Attack Scenarios in WMNs . 70 4.5.5 Experimental Results . 71 4.6 Summary . 86 CHAPTER 5. A GENERIC MODEL FOR INTRUSION RESPONSE . 87 vi 5.1 Introduction . 87 5.2 Response Selection Overview . 89 5.3 Generic Response Model . 90 5.3.1 System Elements . 91 5.3.2 Dependency Graph . 92 5.3.3 Cost Propagation Function . 95 5.3.4 Cost Evaluation . 96 5.4 Damage Assessment . 98 5.5 Response Cost Evaluation . 100 5.5.1 Operation Cost . 100 5.5.2 Response System Impact . 100 5.5.3 Response Success . 101 5.6 Response Selection . 101 5.7 Scenarios . 102 5.7.1 Wireless Mesh Network System . 103 5.7.2 Web Service System . 103 5.8 Experimental Results . 104 5.8.1 Dependency Graph . 104 5.8.2 Implementation of Intrusion Response System . 106 5.8.3 Implementation of Responses . 108 5.8.4 Performance Evaluation . 109 5.9 Discussion . 112 5.9.1 Alternative Cost Evaluation . 112 5.9.2 Graph Extension . 113 5.10 Summary . 113 CHAPTER 6. CONCLUSION AND FUTURE WORK . 114 vii 6.1 Conclusion . 114 6.2 Future Work . 115 BIBLIOGRAPHY . 117 viii LIST OF TABLES Table 3.1 List of simulation parameters of cross-layer based IDS . 50 Table 4.1 Threats in wireless mesh networks . 62 Table 4.2 Feature selection for cross-layer based intrusion detection . 62 Table 4.3 Performance of cross-layer based IDS (n=4) . 71 Table 4.4 Performance of network layer based IDS (n=4) . 71 Table 4.5 Performance of cross-layer based IDS (n=10) . 72 Table 4.6 Performance of network layer based IDS (n=10) . 72 Table 5.1 Attacks and intrusion responses . 104 Table 5.2 Performance of response selection system . 111 ix LIST OF FIGURES Figure 1.1 Network architecture of a wireless mesh network . 4 Figure 3.1 WMN multicast session . 35 Figure 3.2 Mobility management of group key management in WMNs . 44 Figure 3.3 Comparison of storage overhead . 49 Figure 3.4 Average rekeying delay . 51 Figure 3.5 Rekeying delay over interval . 54 Figure 3.6 Communication cost . ..
Load more

Recommended publications
  • Models and Algorithms for Physical Cryptanalysis
    MODELS AND ALGORITHMS FOR PHYSICAL CRYPTANALYSIS Dissertation zur Erlangung des Grades eines Doktor-Ingenieurs der Fakult¨at fur¨ Elektrotechnik und Informationstechnik an der Ruhr-Universit¨at Bochum von Kerstin Lemke-Rust Bochum, Januar 2007 ii Thesis Advisor: Prof. Dr.-Ing. Christof Paar, Ruhr University Bochum, Germany External Referee: Prof. Dr. David Naccache, Ecole´ Normale Sup´erieure, Paris, France Author contact information: [email protected] iii Abstract This thesis is dedicated to models and algorithms for the use in physical cryptanalysis which is a new evolving discipline in implementation se- curity of information systems. It is based on physically observable and manipulable properties of a cryptographic implementation. Physical observables, such as the power consumption or electromag- netic emanation of a cryptographic device are so-called `side channels'. They contain exploitable information about internal states of an imple- mentation at runtime. Physical effects can also be used for the injec- tion of faults. Fault injection is successful if it recovers internal states by examining the effects of an erroneous state propagating through the computation. This thesis provides a unified framework for side channel and fault cryptanalysis. Its objective is to improve the understanding of physi- cally enabled cryptanalysis and to provide new models and algorithms. A major motivation for this work is that methodical improvements for physical cryptanalysis can also help in developing efficient countermea- sures for securing cryptographic implementations. This work examines differential side channel analysis of boolean and arithmetic operations which are typical primitives in cryptographic algo- rithms. Different characteristics of these operations can support a side channel analysis, even of unknown ciphers.
    [Show full text]
  • Non-Interactive Key Establishment in Wireless Mesh Networks
    Chapter 1 Non-Interactive Key Establishment in Wireless Mesh Networks Zhenjiang Li†, J.J. Garcia-Luna-Aceves †∗ zhjli,jj @soe.ucsc.edu { } †Computer Engineering, University of California, Santa Cruz 1156 high street, Santa Cruz, CA 95064, USA Phone:1-831-4595436, Fax: 1-831-4594829 ∗Palo Alto Research Center (PARC) 3333 Coyote Hill Road, Palo Alto, CA 94304, USA Symmetric cryptographic primitives are preferable in designing security protocols for wireless mesh networks (WMNs) because they are computationally affordable for resource- constrained mobile devices forming a WMN. Most proposed key-establishment schemes for symmetric cryptosystem assume services from a centralized authority (either on-line or off- line), or involve the interaction between communicating parties. However, requiring access 1 c Springer, 2005. This is a revision of the work published in the proceedings of AdhocNow’05, LNCS 3738, pp. 164-177, Cancun," Mexico, Oct. 2005. 2This work was supported in part by the Baskin Chair of Computer Engineering at UCSC, the National Science Foundation under Grant CNS-0435522, the U.S. Army Research Office under grant No. W911NF-05-1-0246. Any opinions, findings, and conclusions are those of the authors and do not necessarily reflect the views of the funding agencies. 1 2CHAPTER 1. NON-INTERACTIVE KEY ESTABLISHMENT IN WIRELESS MESH NETWORKS to a centralized authority, or ensuring that correct routing be established before the key agreement is done, is difficult to attain in wireless networks. We present a new non-interactive key agreement and progression (NIKAP) scheme for wireless networks, which does not require an on-line centralized authority, can establish and update pairwise shared keys between any two nodes in a non-interactive manner, is configurable to operate synchronously (S-NIKAP) or asynchronously (A-NIKAP), and has the ability to provide differentiated security services w.r.t.
    [Show full text]
  • Mesh Segmentation Guided by Seed Points
    Bulletin of the JSME Vol.9, No.4, 2015 Journal of Advanced Mechanical Design, Systems, and Manufacturing Mesh segmentation guided by seed points Xue JIAO*, Huixin ZHANG* and Tieru WU* *Institute of Mathematics, Jilin University Changchun, Jilin130012, China E-mail: [email protected] Received 3 January 2015 Abstract Segmenting 3D models into meaningful parts is a fundamental problem in computer graphics. In this paper, we present an algorithm which is guided by the mesh vertices for segmenting a mesh into meaningful sub-meshes. First, a candidate set of feature points is selected to highlight the most significant features of the model. After that, a diversity measure is calculated by using Hausdorff distance. The collection of seed points we defined is a subset of the candidate set. The collection of seed points consists of two parts, namely, the basic point and lucky points. By maximizing the diversity measure between the seed set and candidate set, an appropriate seed point is selected. Based on the collection of seed points, the segmentation process can be guided by these seeds. Because humans generally perceive desirable segmentations at concave regions, and the geodesic distance and curvature are well-known noise sensitive. Considering the above factors, in order to partition the target into meaningful parts, we define a distance function between each pair of mesh vertices. This function is formed by arc length, angular distance and curvature-related correction term. We have tested the method developed in this paper with 3D meshes from the Princeton segmentation benchmark. Moreover, our segmentation method also has been compared with other methods.
    [Show full text]
  • Innovation in Shared Virtual Spaces for Mental Health Therapy
    Innovation in Shared Virtual Spaces for Mental Health Therapy Jake Backer Advisor: Professor Soussan Djamasbi Worcester Polytechnic Institute May 23, 2021 This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on the web without editorial or peer review. 1 Contents 1 Abstract 3 2 Introduction 4 3 Background 5 3.1 Mental Health . .5 3.2 Telehealth . .5 3.3 Augmented Reality (AR) . .6 3.4 AR Therapy . .7 3.5 Avatars . .7 4 Designing the Application 8 4.1 Infrastructure . .8 4.1.1 Networking . .9 4.1.2 Movement . 11 4.1.3 Audio Communication . 12 4.1.4 Immersive Experience . 14 4.1.5 Telemetry . 15 5 User Studies 17 5.1 Results . 17 5.2 Discussion and Future User Studies . 19 6 Contribution and Future Work 21 References 24 2 1 Abstract Rates of mental health disorders among adolescents and younger adults are on the rise with the lack of widespread access remaining a critical issue. It has been shown that teletherapy, defined as therapy delivered remotely with the use of a phone or computer system, may be a viable option to replace in-person therapy in situations where in-person therapy is not possible. Sponsored by the User Experience and Decision Making (UXDM) lab at WPI, this IQP is part of a larger project to address the need for mental health therapy in situations where patients do not have access to traditional in-person care.
    [Show full text]
  • Differential and Linear Attacks on the Full WIDEA-N Block Ciphers (Under
    Differential and Linear Attacks on the full WIDEA-n block ciphers (under weak keys) Jorge Nakahara Jr Universit´eLibre de Bruxelles (ULB), Dept. of Computer Science, Belgium [email protected] Abstract. We report on differential and linear analysis of the full 8.5- round WIDEA-n ciphers for n 2 f4; 8g, under weak-key assumptions. The novelty in our attacks include the use of differential and linear rela- tion patterns that allow to bypass the diffusion provided by MDS codes altogether. Therefore, we can attack only a single IDEA instance out of n copies, effectively using a narrow trail for the propagation of differ- ences and masks across WIDEA-n. In fact, the higher the value of n, the better the attacks become. Our analyses apply both to particular MDS matrices, such as the one used in AES, as well as general MDS matrices. Our attacks exploit fixed points of MDS matrices. We also observed a curious interaction between certain differential/linear patterns and the coefficients of MDS matrices for non-trivial fixed points. This interac- tion may serve as an instructive design criterion for block cipher designs such as WIDEA-n. The authors of WIDEA-n suggested a compression function construction using WIDEA-8 in Davies-Meyer mode. In this setting, the weaknesses identified in this paper can lead to free-start col- lisions and even actual collisions depending on the output transformation of the hash function. Keywords: wide-block cipher, cryptanalysis, WIDEA-n, free-start collisions. 1 Introduction In [6], Junod and Macchetti presented a Wide-block version of IDEA cipher [7] called WIDEA-n, combining n instances of the 8.5-round IDEA cipher joined by an n×n matrix derived from a Maximum Distance Separable (MDS) code.
    [Show full text]
  • E Dge the Outer
    November 2011 The Outer Edge Page 1 | The Outer E November 2011 Vol. 25, No. 4 d Whole No. 295 ISSN 1055-4399 g e The Friendly Computer Club Helping Make Computers Friendly. On the Web at www.cipcug.org COMMAND.COM Attendance at the By Jim Brown, President October general meeting: 65 members and guests. ello. everybody. To Contact CIPCUG As I write this, I am still out of the local area and will be so The Outer Edge......................805-485-7121 until the end of November. I did not have these plans when I General Information………...805-289-3960 agreed to take this administrative position, but it is what it is. H Fortunately, our computer club is blessed to have a strong board of direc- Mailing Address...P.O. Box 51354, Oxnard, CA 93031-1354 tors, the members of which are very dedicated to the success On the Web: cipcug.org of this organization. I will be rejoining them in December. On Facebook: Facebook.com/groups/cipcug Meanwhile, I again thank you, the membership, for your ef- forts in inviting guests to our monthly meetings. This expo- sure to the timely computer information offered has beneficial ‘Secret Guide’ should results to everyone concerned. Art Lewis has ordered “The Secret Guide To Computers,” be at next meeting Brown along with some extra copies, so several will be available to Copies of “Secret Guide to Computers & those who did not sign up for them. This is a very useful Tricky Living” were scheduled to be shipped book. In fact, “EVERYTHING YOU WANT TO KNOW ABOUT COM- Oct.
    [Show full text]
  • Ipsec VPN Solutions Using Next Generation Encryption
    IPSec VPN Solutions Using Next Generation Encryption Deployment Guide Version 1.5 Authored by: Ben Rosenblum – CCIE #21084 (R&S, SP) IPSec VPN Solutions Using Deployment Guide Next Generation Encryption THE SPECIFICATIONS AND INFORMATION REGARDING THE PRODUCTS IN THIS MANUAL ARE SUBJECT TO CHANGE WITHOUT NOTICE. ALL STATEMENTS, INFORMATION, AND RECOMMENDATIONS IN THIS MANUAL ARE BELIEVED TO BE ACCURATE BUT ARE PRESENTED WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED. USERS MUST TAKE FULL RESPONSIBILITY FOR THEIR APPLICATION OF ANY PRODUCTS. THE SOFTWARE LICENSE AND LIMITED WARRANTY FOR THE ACCOMPANYING PRODUCT ARE SET FORTH IN THE INFORMATION PACKET THAT SHIPPED WITH THE PRODUCT AND ARE INCORPORATED HEREIN BY THIS REFERENCE. IF YOU ARE UNABLE TO LOCATE THE SOFTWARE LICENSE OR LIMITED WARRANTY, CONTACT YOUR CISCO REPRESENTATIVE FOR A COPY. The following information is for FCC compliance of Class A devices: This equipment has been tested and found to comply with the limits for a Class A digital device, pursuant to part 15 of the FCC rules. These limits are designed to provide reasonable protection against harmful interference when the equipment is operated in a commercial environment. This equipment generates, uses, and can radiate radio-frequency energy and, if not installed and used in accordance with the instruction manual, may cause harmful interference to radio communications. Operation of this equipment in a residential area is likely to cause harmful interference, in which case users will be required to correct the interference at their own expense. The following information is for FCC compliance of Class B devices: The equipment described in this manual generates and may radiate radio- frequency energy.
    [Show full text]
  • The Celeblain of Celeborn and Galadriel
    Volume 9 Number 2 Article 5 6-15-1982 The Celeblain of Celeborn and Galadriel Janice Johnson Southern Illinois University Follow this and additional works at: https://dc.swosu.edu/mythlore Part of the Children's and Young Adult Literature Commons Recommended Citation Johnson, Janice (1982) "The Celeblain of Celeborn and Galadriel," Mythlore: A Journal of J.R.R. Tolkien, C.S. Lewis, Charles Williams, and Mythopoeic Literature: Vol. 9 : No. 2 , Article 5. Available at: https://dc.swosu.edu/mythlore/vol9/iss2/5 This Article is brought to you for free and open access by the Mythopoeic Society at SWOSU Digital Commons. It has been accepted for inclusion in Mythlore: A Journal of J.R.R. Tolkien, C.S. Lewis, Charles Williams, and Mythopoeic Literature by an authorized editor of SWOSU Digital Commons. An ADA compliant document is available upon request. For more information, please contact [email protected]. To join the Mythopoeic Society go to: http://www.mythsoc.org/join.htm Mythcon 51: A VIRTUAL “HALFLING” MYTHCON July 31 - August 1, 2021 (Saturday and Sunday) http://www.mythsoc.org/mythcon/mythcon-51.htm Mythcon 52: The Mythic, the Fantastic, and the Alien Albuquerque, New Mexico; July 29 - August 1, 2022 http://www.mythsoc.org/mythcon/mythcon-52.htm Abstract Reviews the history of Galadriel and Celeborn as revealed in unpublished materials as well as The Lord of the Rings, The Silmarillion, Tolkien’s Letters, and Unfinished alesT , and examines variations and inconsistencies. Additional Keywords Tolkien, J.R.R.—Characters—Celeborn; Tolkien, J.R.R.—Characters—Galadriel; Patrick Wynne This article is available in Mythlore: A Journal of J.R.R.
    [Show full text]
  • Introducing Microsoft Mesh () “You Can Actually Feel Like You're in the Same
    The Future of Communication in the Metaverse () Meet Grace, a humanoid robot designed for healthcare () The Metaverse is a Dystopian Nightmare. Let’s Build a Better Reality. () Introducing Microsoft Mesh () “You can actually feel like you’re in the same place”: Microsoft Mesh powers shared experiences in mixed reality () Elon Musk says his start-up Neuralink has wired up a monkey to play video games using its mind () Mojo Vision - Mojo Lens 2021 () Awakening Health Presentation () WeRobot2020: Involving Seniors in Developing Privacy Best Practices () Robot friends: Why people talk to chatbots in times of trouble () U.S. company offers at-home hologram machines () What Is a Smart City? How AI Is Going Uptown Around the Globe () MOFLIN | An AI Pet Robot with Emotional Capabilities () Design, Use, and Effects of Sex Dolls and Sex Robots: Scoping Review () PORTL hologram promotional video () Together mode in Microsoft Teams () Facebook teases a vision of remote work using augmented and virtual reality () Google Meet for Companies and Organizations () Elon Musk: Neuralink Will Do Human Brain Implant in “Less Than a Year” () Joe Rogan Experience #1470 - Elon Musk disccussing Neuralink (clip) () Connected Living Announces Global Partnership With Temi, a Companion Device and Telehealth Delivery Robot, in Response to COVID-19 () Page 1 of 20 Soul Machines () Elon Musk's Plan To Merge Humans With A.I. () Smartphone-Assisted, Privacy-Preserving COVID-19 Contact Tracing () Microsoft thinks Coronavirus will forever change the way we work and live () Sprayable user interfaces () Social Distancing for Seniors: Tech to Help the Elderly Through Isolation () The Coronavirus Is Making Us See That It's Hard to Make Remote Work Actually Work () Sora App Brings Learning To Mobile Platforms () Cyborgs: Melding Man and Machine () How A True Crime Podcast Is Building Community For Those With Mental Illness () Meet AI XPRIZE Semifinalist Element Inc.
    [Show full text]
  • CXCR4-SERINE339 Regulates Cellular Adhesion, Retention and Mobilization, and Is a Marker for Poor Prognosis in Acute Myeloid Leukemia
    Leukemia (2014) 28, 566–576 & 2014 Macmillan Publishers Limited All rights reserved 0887-6924/14 www.nature.com/leu ORIGINAL ARTICLE CXCR4-SERINE339 regulates cellular adhesion, retention and mobilization, and is a marker for poor prognosis in acute myeloid leukemia L Brault1, A Rovo´ 2, S Decker3, C Dierks3, A Tzankov4,5 and J Schwaller1,5 The CXCR4 receptor is a major regulator of hematopoietic cell migration. Overexpression of CXCR4 has been associated with poor prognosis in acute myelogenous leukemia (AML). We have previously shown that ligand-mediated phosphorylation of the Serine339 (CXCR4-S339) residue of the intracellular domain by PIM1 is implicated in surface re-expression of this receptor. Here, we report that phosphorylation of CXCR4-S339 in bone marrow (BM) biopsies correlated with poor prognosis in a cohort of AML patients. To functionally address the impact of CXCR4-S339 phosphorylation, we generated cell lines-expressing CXCR4 mutants that mimic constitutive phosphorylation (S339E) or abrogate phosphorylation (S339A). Whereas the expression of CXCR4 significantly increased, both CXCR4-S339E and the CXCR4-S339A mutants significantly reduced the BM homing and engraftment of Kasumi-1 AML cells in immunodeficient mice. In contrast, only expression of the CXCR4-S339E mutant increased the BM retention of the cells and resistance to cytarabine treatment, and impaired detachment capacity and AMD3100-induced mobilization of engrafted leukemic cells. These observations suggest that the poor prognosis in AML patients displaying CXCR4-S339 phosphorylation can be the consequence of an increased retention to the BM associated with an enhanced chemoresistance of leukemic cells. Therefore, CXCR4-S339 phosphorylation could serve as a novel prognostic marker in human AML.
    [Show full text]
  • A Lightweight Iot Security Protocol Mohamed Hammi, Erwan Livolant, Patrick Bellot, Ahmed Serhrouchni, Pascale Minet
    A Lightweight IoT Security Protocol Mohamed Hammi, Erwan Livolant, Patrick Bellot, Ahmed Serhrouchni, Pascale Minet To cite this version: Mohamed Hammi, Erwan Livolant, Patrick Bellot, Ahmed Serhrouchni, Pascale Minet. A Lightweight IoT Security Protocol. 1st Cyber Security in Networking Conference (CSNet2017), Oct 2017, Rio de Janeiro, Brazil. hal-01640510 HAL Id: hal-01640510 https://hal.archives-ouvertes.fr/hal-01640510 Submitted on 20 Nov 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. A Lightweight IoT Security Protocol Mohamed Tahar Hammi∗, Erwan Livolanty, Patrick Bellot∗, Ahmed Serhrouchni∗, Pascale Minetz ∗ LTCI, Télécom ParisTech, Université Paris-Saclay, 75013, Paris, France ∗{hammi,bellot,serhrouchni}@telecom-paristech.fr yAFNeT, Boost-Conseil, 75008 Paris, France [email protected] zInria-Paris, EVA team, 2 rue Simone Iff, 75589 Paris Cedex 12, France [email protected] Abstract—The IoT is a technology that enables the inter- in October 2015. Hackers managed to get many customers connection of smart physical and virtual objects and provides records, that contain important informations like logins and advanced services. Objects or things are generally constrained passwords, secret codes, confidential and personal data, etc. devices which are limited by their energy, computing and storage capacity.
    [Show full text]
  • RAGHAV a New Low Power S-P Network Encryption Design for Resource Constrained Environment
    RAGHAV A new low power S-P network encryption design for resource constrained environment Gaurav Bansod Associate Professor [email protected] Pune Institute of Computer Technology(PICT), Pune India Abstract— This paper proposes a new ultra lightweight cipher considered to be the workhorse in the cryptographic RAGHAV. RAGHAV is a Substitution-Permutation (SP) environment. The most ignored metric in design of a network, which operates on 64 bit plaintext and supports a lightweight cipher is power dissipation which is a very crucial 128/80 bit key scheduling. It needs only 994.25 GEs by using in the environments like IoT and Wireless Sensor Networks 0.13µm ASIC technology for a 128 bit key scheduling. It also (WSN). In Wireless Sensor Network, most of the nodes are needs less memory i.e. 2204 bytes of FLASH memory , which is less as compared to all existing S-P network lightweight ciphers. battery powered and there is a need to protect these nodes This paper presents a complete security analysis of RAGHAV, against external attacks. The versatile cipher like AES, Triple which includes basic attacks like linear cryptanalysis and DES fails in such kind of environment as they need huge differential cryptanalysis. This paper also covers advanced attack memory space as well as they dissipated more power. There is like zero correlation attack, Biclique attack, Algebraic attack, urgent need to secure these nodes without incurring more Avalanche effect, key collision attack and key schedule attack. In power to make the technologies like IoT feasible. This paper this cipher,use of block permutation helps the design to improve presents a cipher RAGHAV which has less GE’s, needs less the throughput.
    [Show full text]