Chapter
Chapter 2 - A Privacy-Preserving and Efficient Information Sharing Scheme for VANET Secure Communication
2.3 System Model and Preliminaries
2.3.3 Security Requirements
2.4 The Proposed PETS Scheme
2.4.3 Vehicle–RSU Key Agreement
2.4.4 Traffic Information Collection and Aggregation
2.4.5 Traffic Jam Message Propagation
2.6 Performance Evaluation
2.6.1 Traffic Information Sending/Collection Overhead
2.6.2 Traffic Information Propagation/Verification Overhead
PART II - Vulnerabilities, Detection and Monitoring
Chapter 3 - DIAMoND: Distributed Intrusion/Anomaly Monitoring for Nonparametric Detection
3.3.1 Architecture Overview
3.3.4 Communication Protocol
3.3.5 Neighborhood Strategies
3.4.1 Software Implementation
3.4.2 Physical Topologies
3.4.3 Legitimate and Malicious Traffic
3.5.2 Impact of Physical Topologies
3.5.3 Influence of Neighborhood Strategies
3.5.4 Minimal and Marginal Deployment Gain
Chapter 4 - Detection of Service Level Agreement (SLA) Violations in Memory Management in Virtual Machines
4.2.1 Information Leakage among Virtual Machines
4.2.2 Service Level Agreement Enforcement
4.3 The Proposed Approaches
4.3.1 Memory Overcommitment in Virtualization Environments
4.3.2 Memory Deduplication in VM Hypervisors
4.3.4 Basic Ideas of the Proposed Approaches
4.3.5 Details of Implementation
4.3.5.1 Choice of memory pages
4.3.5.2 Measurement of access time
4.3.5.3 Verification of memory access order
4.3.6 Detection Procedures of the SLA Violations
4.4.1 Experimental Environment Setup
4.4.2 Experiments and Results
4.4.3 Impacts on System Performance
4.5.1 Reducing False Alarms
4.5.2 Impacts of Extra Memory Demand
4.5.3 Building A Unified Detection Algorithm
Chapter 5 - Analysis of Mobile Threats and Security Vulnerabilities for Mobile Platforms and Devices
5.2 Analysis of Mobile Platforms
5.2.1 Dominating Mobile Platforms
5.2.1.1 iPhone Operating System (iOS)
5.2.1.2 Android operating system (Android)
5.2.1.3 BlackBerry operating system
5.2.2 Security Models for Mobile Platforms
5.2.2.1 iOS security model
5.2.2.2 Android security model
5.2.2.3 BlackBerry security model
5.2.3 Existing Security Vulnerabilities in Mobile Platforms
5.2.3.1 Potential vulnerabilities
5.2.3.2 Mobile device malware
5.3 Threat Model for Mobile Platforms
5.3.1 Goals and Motives for an Attacker
5.3.1.1 Cybercriminals: outsourcing sensitive data
5.3.1.2 Cybercriminals: cyber heist
5.3.1.3 Cybercriminals: corporate espionage and sabotage
5.3.2 Attack Vectors or Modern Exploitation Techniquesfor Mobile Devices
5.3.2.1 Susceptibility on the mobile through hardware
5.3.2.2 Attacking through theWeb
5.3.2.3 Mobile intrusion and deception through social engineering
5.3.2.4 Attacking through the mobile network
5.3.2.5 Cyber Arson through common mobile applications
5.3.2.6 Attacking via Bluetooth connection
5.3.3 Types of Malwares in Mobile Devices
5.3.3.1 Trojan-related malware
5.3.3.2 Worms targeting mobile devices
5.3.3.3 Viruses on the mobile
5.3.3.4 Ransomware: a mobile kidnapping
5.4 Defense Mechanisms for Securing Mobile Platforms
5.4.1 Keychain Authentication and Encryption
5.4.2 Binary Protection and Hardening
5.4.3 Third-Party OS Products
5.4.4 Obfuscators and Optimizers
5.4.5 Compiler and Linker Defense Mechanisms
5.4.6 Certificate-based Mobile Authentication
5.4.7 Token-based Mobile Authentication
5.6 Threats Analysis and Future Trends
PART III - Cryptographic Algorithms
Chapter 6 - Quasigroup-Based Encryption for Low-Powered Devices
6.2 Background—Low Energy Cryptosystems
6.3 Overview of Quasigroup Encryption
6.4 The Preliminary Block Cipher Design
6.5 Overview of Software Implementation
6.6 Overview of Three FPGA Implementations
6.6.1 The Quasigroup Implementation
6.6.2 Comparison Design—Parallel AES
6.6.3 Hybrid Front-End/AES Design
6.8 Toward a Single-Chip Implementation
6.9 Algorithm Results for B = 2 to 8
6.10 Generating Quasigroups Fast
6.11 Our Quasigroup Block Cipher Algorithm
6.12 Cryptanalysis and Improvements in the Block Cipher
6.13 Overview of a General Linear Cryptanalytical Attack
6.15 Pilingup Attempts for N = 16, 32, and 64
6.16 Analysis of the Attack on the Quasigroup
6.17 The Issue of a Total Linear Bias of 1/2
6.19 Possible Changes that Could Be Made in the Design of This Attack Model
6.20 Which Quasigroup Order Is Best?
Chapter 7 - Measuring Interpretation and Evaluationof Client-side Encryption Tools in Cloud Computing
7.2 Cloud Service Providers (CSPs)
7.3 Deployment Model of Cloud Service Provider
7.5 Deriving the Attributes of Existing Tools
7.6 Comparison of the Studied Tools
7.7 Characteristics of the Studied Tools
7.8 Security of Encryption and Key Generation Mechanisms of the Studied Tools
7.9 Performance Measurement and Analysis
7.9.1.1 Application tools
7.9.1.2 Cloud service provider
7.9.1.3 Testing environment
7.10 Results and Discussion
7.11 Conclusion and Future Work
Chapter 8 - Kolmogorov–Smirnov Test-based Side-channel Distinguishers: Constructions, Analysis, and Implementations
8.2.1 Kolmogorov–Smirnov Test
8.3 Systematic Construction of KS Test-based Side-channel Distinguishers
8.3.1 Construction Strategies of KSA and PKS
8.3.2 Nine Variants of KS Test-based Distinguishers
8.4 An Experiment Analysis of All Twelve KS Test-based Side-channel Distinguishers
8.5 Implementation Methods of MPC-KSA [13]
8.5.1 Analysis of the Naive Method
8.5.3 Optimized Method II
8.6 Implementation Results
Chapter 9 - Multi-antenna Transmission Technique with Constellation Shaping for Secrecy at Physical Layer
9.2 Transmitter Structure
9.3 Transmitter Configuration Possibilities and Security
9.4 Receivers and the Impact of Information Directivity
9.4.2 Transmitter Configuration Effects in MI and Secrecy
PART VI - Reliable System Design
Chapter 10 -Active Sub-Areas-Based Multi-Copy Routing in VDTNs
10.3 Identification of Each Vehicle’s Active Sub-areas
10.4.1 Vehicle Mobility Pattern
10.4.2 Relationship between Contact and Location
10.5 Active Area-based Routing Method
10.5.1 Traffic-Considered Shortest Path Spreading
10.5.1.1 Road traffic measurement
10.5.1.2 Building traffic-considered shortest path tree
10.5.2 Contact-based Scanning in Each Active Sub-area
10.5.2.1 Maintaining scanning history table
10.5.2.2 Routing algorithm in a sub-area
10.5.3 Distributed Active Sub-area Updates
10.5.3.1 Building the active sub-area information table
10.5.3.2 Maintaining the active sub-area information table
10.6 Performance Evaluation
10.6.1 Performance with Different Number of Copies
10.6.2 Performance with Different Memory Sizes
10.6.3 Performance of Distributed AAR (DAAR)
Chapter 11 - RobustGeo: A Disruption-Tolerant Geo-Routing Protocol
11.2.1 Location-based Routing Algorithms
11.2.2 Delay-Tolerant Networks
11.3.2 Disruption Tolerance
11.3.2.1 Perimeter forwarding with packet replication
11.3.2.2 Single-hop broadcasting to explore multiple paths
11.7 Conclusion and Future Work
Chapter 12 - Social Similarity-based Multicast Framework in Opportunistic Mobile Social Networks
12.3.1 Definition of Static Social Features
12.3.2 Definitions of Dynamic Social Features
12.3.2.1 Dynamic social features
12.3.2.2 Enhanced dynamic social features
12.3.3 Calculation of Social Similarity
12.4 Multicast Routing Protocols
12.4.1 Social Similarity-based Multicast Framework
12.5.1 Property of Dynamic Social Feature Definition (12.2)
12.5.2 The Number of Forwardings
12.5.3 The Number of Copies
12.6.1 Algorithms Compared
12.6.2 Evaluation Metrics
12.6.4 Simulation Results
Chapter 13 - Ensuring QoS for IEEE 802.11 Real-Time Communications Using an AIFSN Prediction Scheme
13.2 QoS in IEEE 802.11 Networks
13.2.2 Dynamic Adaptation in IEEE 802.11e
13.3.1 J48 Decision Tree Classifier
13.4.1 Proposal Description
13.4.2 Design of the Predictive Models
13.5 Performance Evaluation
Security, Privacy and Reliability in Computer Communications and Networks
( River Publishers Series in Communications )
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
