Showing items 1 - 5 of 5

Your selections:

A distributed and anonymous data collection framework based on multilevel edge computing architecture

- Usman, Muhammad, Jan, Mian, Jolfaei, Alireza, Xu, Min, He, Xiangjian, Chen, Jinjun

  • Authors: Usman, Muhammad , Jan, Mian , Jolfaei, Alireza , Xu, Min , He, Xiangjian , Chen, Jinjun
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Transactions on Industrial Informatics Vol. 16, no. 9 (2020), p. 6114-6123
  • Full Text: false
  • Reviewed:
  • Description: Industrial Internet of Things applications demand trustworthiness in terms of quality of service (QoS), security, and privacy, to support the smooth transmission of data. To address these challenges, in this article, we propose a distributed and anonymous data collection (DaaC) framework based on a multilevel edge computing architecture. This framework distributes captured data among multiple level-one edge devices (LOEDs) to improve the QoS and minimize packet drop and end-to-end delay. Mobile sinks are used to collect data from LOEDs and upload to cloud servers. Before data collection, the mobile sinks are registered with a level-two edge-device to protect the underlying network. The privacy of mobile sinks is preserved through group-based signed data collection requests. Experimental results show that our proposed framework improves QoS through distributed data transmission. It also helps in protecting the underlying network through a registration scheme and preserves the privacy of mobile sinks through group-based data collection requests. © 2005-2012 IEEE.

RaSEC : an intelligent framework for reliable and secure multilevel edge computing in industrial environments

- Usman, Muhammad, Jolfaei, Alireza, Jan, Mian

  • Authors: Usman, Muhammad , Jolfaei, Alireza , Jan, Mian
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Transactions on Industry Applications Vol. 56, no. 4 (2020), p. 4543-4551
  • Full Text:
  • Reviewed:
  • Description: Industrial applications generate big data with redundant information that is transmitted over heterogeneous networks. The transmission of big data with redundant information not only increases the overall end-to-end delay but also increases the computational load on servers which affects the performance of industrial applications. To address these challenges, we propose an intelligent framework named Reliable and Secure multi-level Edge Computing (RaSEC), which operates in three phases. In the first phase, level-one edge devices apply a lightweight aggregation technique on the generated data. This technique not only reduces the size of the generated data but also helps in preserving the privacy of data sources. In the second phase, a multistep process is used to register level-two edge devices (LTEDs) with high-level edge devices (HLEDs). Due to the registration process, only legitimate LTEDs can forward data to the HLEDs, and as a result, the computational load on HLEDs decreases. In the third phase, the HLEDs use a convolutional neural network to detect the presence of moving objects in the data forwarded by LTEDs. If a movement is detected, the data is uploaded to the cloud servers for further analysis; otherwise, the data is discarded to minimize the use of computational resources on cloud computing platforms. The proposed framework reduces the response time by forwarding useful information to the cloud servers and can be utilized by various industrial applications. Our theoretical and experimental results confirm the resiliency of our framework with respect to security and privacy threats. © 1972-2012 IEEE.

A low-complexity equalizer for video broadcasting in cyber-physical social systems through handheld mobile devices

- Solyman, Ahmad, Attar, Hani, Khosravi, Mohammad, Menon, Varun, Jolfaei, Alireza, Balasubramanian, Venki, Selvaraj, Buvana, Tavallali, Pooya

  • Authors: Solyman, Ahmad , Attar, Hani , Khosravi, Mohammad , Menon, Varun , Jolfaei, Alireza , Balasubramanian, Venki , Selvaraj, Buvana , Tavallali, Pooya
  • Date: 2020
  • Type: Text , Journal article
  • Relation: IEEE Access Vol. 8, no. (2020), p. 67591-67602
  • Full Text:
  • Reviewed:
  • Description: In Digital Video Broadcasting-Handheld (DVB-H) devices for cyber-physical social systems, the Discrete Fractional Fourier Transform-Orthogonal Chirp Division Multiplexing (DFrFT-OCDM) has been suggested to enhance the performance over Orthogonal Frequency Division Multiplexing (OFDM) systems under time and frequency-selective fading channels. In this case, the need for equalizers like the Minimum Mean Square Error (MMSE) and Zero-Forcing (ZF) arises, though it is excessively complex due to the need for a matrix inversion, especially for DVB-H extensive symbol lengths. In this work, a low complexity equalizer, Least-Squares Minimal Residual (LSMR) algorithm, is used to solve the matrix inversion iteratively. The paper proposes the LSMR algorithm for linear and nonlinear equalizers with the simulation results, which indicate that the proposed equalizer has significant performance and reduced complexity over the classical MMSE equalizer and other low complexity equalizers, in time and frequency-selective fading channels. © 2013 IEEE.

A 3D object encryption scheme which maintains dimensional and spatial stability

- Jolfaei, Alireza, Wu, Xinwen, Muthukkumarasamy, Vallipuram

  • Authors: Jolfaei, Alireza , Wu, Xinwen , Muthukkumarasamy, Vallipuram
  • Date: 2015
  • Type: Text , Journal article
  • Relation: IEEE Transactions on Information Forensics and Security Vol. 10, no. 2 (2015), p. 409-422
  • Full Text:
  • Reviewed:
  • Description: Due to widespread applications of 3D vision technology, the research into 3D object protection is primarily important. To maintain confidentiality, encryption of 3D objects is essential. However, the requirements and limitations imposed by 3D objects indicate the impropriety of conventional cryptosystems for 3D object encryption. This suggests the necessity of designing new ciphers. In addition, the study of prior works indicates that the majority of problems encountered with encrypting 3D objects are about point cloud protection, dimensional and spatial stability, and robustness against surface reconstruction attacks. To address these problems, this paper proposes a 3D object encryption scheme, based on a series of random permutations and rotations, which deform the geometry of the point cloud. Since the inverse of a permutation and a rotation matrix is its transpose, the decryption implementation is very efficient. Our statistical analyses show that within the cipher point cloud, points are randomly distributed. Furthermore, the proposed cipher leaks no information regarding the geometric structure of the plain point cloud, and is also highly sensitive to the changes of the plaintext and secret key. The theoretical and experimental analyses demonstrate the security, effectiveness, and robustness of the proposed cipher against surface reconstruction attacks.

On the security of permutation-only image encryption schemes

- Jolfaei, Alireza, Wu, Xinwen, Muthukkumarasamy, Vallipuram

  • Authors: Jolfaei, Alireza , Wu, Xinwen , Muthukkumarasamy, Vallipuram
  • Date: 2016
  • Type: Text , Journal article
  • Relation: IEEE Transactions on Information Forensics and Security Vol. 11, no. 2 (2016), p. 235-246
  • Full Text:
  • Reviewed:
  • Description: Permutation is a commonly used primitive in multimedia (image/video) encryption schemes, and many permutation-only algorithms have been proposed in recent years for the protection of multimedia data. In permutation-only image ciphers, the entries of the image matrix are scrambled using a permutation mapping matrix which is built by a pseudo-random number generator. The literature on the cryptanalysis of image ciphers indicates that the permutation-only image ciphers are insecure against ciphertext-only attacks and/or known/chosenplaintext attacks. However, the previous studies have not been able to ensure the correct retrieval of the complete plaintext elements. In this paper, we revisited the previous works on cryptanalysis of permutation-only image encryption schemes and made the cryptanalysis work on chosen-plaintext attacks complete and more efficient. We proved that in all permutationonly image ciphers, regardless of the cipher structure, the correct permutation mapping is recovered completely by a chosenplaintext attack. To the best of our knowledge, for the first time, this paper gives a chosen-plaintext attack that completely determines the correct plaintext elements using a deterministic method. When the plain-images are of size M × N and with L different color intensities, the number n of required chosen plain-images to break the permutation-only image encryption algorithm is n = logL(MN). The complexity of the proposed attack is O (n · M N) which indicates its feasibility in a polynomial amount of computation time. To validate the performance of the proposed chosen-plaintext attack, numerous experiments were performed on two recently proposed permutation-only image/video ciphers. Both theoretical and experimental results showed that the proposed attack outperforms the state-of-theart cryptanalytic methods.
  • 1