APPregator: A Large-Scale Platform for Mobile Security Analysis

The Jordan decomposition of matrix is a typical scientific and engineering computational task, but such computation involves enormous computing resources for large matrices, which is burdensome for the resource-limited clients. Cloud computing enables computational resource-limited clients to economically outsource such problems to the cloud server. However, outsourcing Jordan decomposition of large-scale matrix to the cloud brings great security concerns and challenges since the matrices usually contain sensitive information. In this paper, we present a secure, verifiable, efficient, and privacy preserving algorithm for outsourcing Jordan decomposition of large-scale matrix. Security analysis shows that our algorithm is practically secure. Efficient verification algorithm is used to verify the results returned from the cloud.

Download Full-text

Secrecy Analysis of Cognitive Radio Networks over Generalized Fading Channels

Security and Communication Networks ◽

10.1155/2020/8842012 ◽

2020 ◽

Vol 2020 ◽

pp. 1-9

Author(s):

Jiangfeng Sun ◽

Zhisong Bie ◽

Hongxia Bie ◽

Pengfei He ◽

Machao Jin

Keyword(s):

Cognitive Radio ◽

Fading Channels ◽

Communication Networks ◽

Cognitive Radio Networks ◽

Large Scale ◽

Security Analysis ◽

Fast Response ◽

Radio Networks ◽

Theoretical Formula ◽

Large Bandwidth

At present, the fifth generation (5G) communication networks are in the time of large-scale deployment principally because its characteristics consists of large bandwidth, fast response, and high stability. As a partner of 5G, the Internet of Things (IoT) involves billions of devices around the world, which can make the wireless communication environment more intelligent and convenient. However, the problem that cannot be ignored is the physical layer security of 5G-IoT networks. Based on this, we perform a security analysis of cognitive radio networks (CRN) for IoT, where the CRN is the single-input multiple-output (SIMO) model experiencing κ-μ shadowed fading with multiple eavesdroppers. To analyze the confidentiality of the system under consideration, we analyze the security performance for the considered IoT systems with the help of the derived secure outage probability (SOP) and probability of strictly positive secrecy capacity (SPSC). As a verification of the theoretical formula, Monte Carlo simulation is also provided. The results of great interest are the factors that can produce better security performance in high SNRs region which consist of smaller M, smaller k, and larger N, and larger μ, smaller IP, and smaller Rth.

Download Full-text

Large Scale, Real-time Systems Security Analysis in Higher Education

10.18260/1-2--21634 ◽

2020 ◽

Author(s):

Frank Sheen ◽

Dale Rowe ◽

Richard Helps

Keyword(s):

Higher Education ◽

Real Time ◽

Large Scale ◽

Security Analysis ◽

Real Time Systems ◽

Systems Security ◽

Time Systems

Download Full-text

A Security Assessment Model for Electrical Power Grid SCADA System

International Journal of Innovative Technology and Exploring Engineering - Special Issue ◽

10.35940/ijitee.l1132.10812s219 ◽

2019 ◽

Vol 8 (12S2) ◽

pp. 763-773

Keyword(s):

Vulnerability Assessment ◽

Cyber Security ◽

Large Scale ◽

Critical Infrastructure ◽

Security Analysis ◽

Assessment Model ◽

Primary Concern ◽

Scada System ◽

Proposed Model ◽

The Impact

Due to the wide application of SCADA systems in national critical infrastructure, their cyber security issues and vulnerabilities have been a primary concern; whereas, the impact and consequences of cyber-attacks to these systems have the potential to result in catastrophic consequences in the physical domain. Therefore, estimating possible attack impacts and identifying system vulnerabilities are major concern in SCADA management and operations. However, it is quite difficult to plan, execute and review vulnerability analysis in critical infrastructure systems as well as in industrial control systems (such as SCADA system) due to its complexity, large-scale and heterogeneity. Consequently, a consistent domain-specific conceptual model is required to establish a generic framework for cyber security analysis to examine and investigate security threats on cyber-physical systems, the role of the entities within the system as well as system operations. The main contribution of this work is to present a multi-facets model to support cyber security analysis practices such as penetration testing, vulnerability assessment and risk analysis. The proposed model presents a common insight among different SCADA configurations, implementations and the employed protocols to handle its complexity, heterogeneous and scale. To demonstrate the usability as a proof of concept and applicability of the proposed model, the paper also presents an example illustrating how the proposed model can be employed to carry out security vulnerability assessment.

Download Full-text

V-LDAA: A New Lattice-Based Direct Anonymous Attestation Scheme for VANETs System

Security and Communication Networks ◽

10.1155/2021/4660875 ◽

2021 ◽

Vol 2021 ◽

pp. 1-13

Author(s):

Liquan Chen ◽

Tianyang Tu ◽

Kunliang Yu ◽

Mengnan Zhao ◽

Yingchao Wang

Keyword(s):

Elliptic Curve ◽

Privacy Protection ◽

Large Scale ◽

Quantum Computer ◽

Security Analysis ◽

Experimental Results ◽

Message Authentication ◽

Signature Scheme ◽

Direct Anonymous Attestation ◽

Authentication Schemes

Privacy protection and message authentication issues in VANETs have received great attention in academia. Many authentication schemes in VANETs have been proposed, but most of them are based on classical difficult problems such as factorization in RSA setting or Elliptic Curve setting and are therefore not quantum resistant. If a quantum computer becomes available in the next few decades, the security of these schemes will be at stake. This paper presents a vehicular lattice-based direct anonymous attestation (V-LDAA) scheme adopting an optimized signature scheme based on automorphism stability which achieves postquantum security. A distributed pseudonym update and vehicle revocation mechanism based on the lattice is introduced in this paper, which means vehicles can update their pseudonyms and revoke the identity certificate by themselves without the need for pseudonym resolutions or CRLs checking. Compared with the existing lattice-based attestation schemes in VANETs, computation costs during signing and verification operations in V-LDAA are no longer related to the number of users, which makes it suitable for large-scale VANETs. Security analysis shows that V-LDAA resists TPM theft attacks and provides users with user-controlled anonymity, user-controlled unlinkability, and unforgeability against quantum adversaries. Experimental results show that V-LDAA reduces the blind signature size by 18%. The speed of blind signing is increased by 30%, and blind verification operation is accelerated 3 times compared with the existing lattice-based direct anonymous attestation (LDAA) scheme.

Download Full-text