Gongxuan Zhang

Followers

Following

Public Views

Interests

Uploads

Papers by Gongxuan Zhang

Migration Validity of WS-BPEL Instances Revisited

2013 IEEE 16th International Conference on Computational Science and Engineering, 2013

ABSTRACT WS-BPEL processes ought to be adaptable even at run-time so as to adapt to the changing ... more ABSTRACT WS-BPEL processes ought to be adaptable even at run-time so as to adapt to the changing environments and requirements. It is cost-ineffective and time-consuming to restart a running WS-BPEL instance from scratch after the WS-BPEL process is changed. Instead, a WS-BPEL instance had better be transferred to the updated process. Current approaches to validity checking of instance migration are too conservative and thus few instance migrations are considered to be valid. To address this problem, we propose a novel criterion for valid migration which is based on the dynamic dependence graph for the trace of a WS-BPEL instance. Compared with existing approaches, our approach is significantly less conservative, that is, it allows more instances to migrate to the updated process. We illustrate the applicability and effectiveness of our approach by dynamically updating the WS-BPEL process of a travel agency.

QoE and Reliability-Aware Task Scheduling for Multi-user Mobile-Edge Computing

Lecture Notes in Computer Science, 2022

A Multiserver Configuration and Request Distribution Framework for Profit Maximization in a Three-Tier Cloud Service Architecture

Journal of Circuits, Systems and Computers

The rapid development of cloud computing has generated numerous cloud service providers. In a thr... more The rapid development of cloud computing has generated numerous cloud service providers. In a three-tier cloud service architecture, maximizing the cloud service profit is not only a goal pursued by cloud service providers but also a potent force that drives the continuous development of cloud computing technology. The traditional methods of maximizing cloud service profits are either limited to cloud resource management or service request distribution. Few work contributes to maximizing the profit of cloud service providers while considering both resource management and request distribution. Besides, the heterogeneity of servers is also an important concern when configuring the multiserver system. Therefore, this paper proposes a multiserver configuration and request distribution framework oriented to a three-tier cloud service architecture for maximizing the profit of cloud service providers. Compared with the benchmark method, extensive numerical simulation experiments show that ...

IPOR: An efficient IDA-based proof of retrievability scheme for cloud storage systems

2017 IEEE International Conference on Communications (ICC), 2017

With the arrival of big data era, cloud storage has become more ubiquitous. A growing number of c... more With the arrival of big data era, cloud storage has become more ubiquitous. A growing number of consumers remote their data into cloud, as cloud can provide them with ample storage space and powerful computational capacity. However, storing data in cloud means that data is out of their control. How to verify the integrity of stored data and retrieve the corrupted data has become an urgent security problem. In this paper, we propose a new efficient proof of retrievability scheme, named as IPOR, for cloud storage systems. The IPOR not only can verify the integrity of remote data, but also can retrieve the original data of corrupted blocks from the healthy servers with probability 100%. Moreover, IPOR obviously decreases the complexity of data integrity tags and it requires performing a few multiplication and addition operations to retrieve the corrupted data. Therefore, our scheme is much more efficient than the state-of-the-art schemes. In addition, the security analysis indicates that our scheme is provably secure.

A Distributed Load Balancing Clustering Algorithm for Wireless Sensor Networks

Wireless Personal Communications, 2021

In wireless sensor networks, energy consumption is one of the main constraints that limit the eff... more In wireless sensor networks, energy consumption is one of the main constraints that limit the effects of their applicabilities. Clustering provides a practical solution to improve energy efficiency. However, the loads of each cluster head are not balance. Thus, the energy cannot be consumed evenly in each cluster head. To overcome this problem, we propose a distributed load balancing clustering algorithm (DLBCA). Without relying on central nodes, the sensor nodes can separately determine their roles (cluster heads or cluster members) and the clustering structure. The determination of cluster heads is based on the residual energy of sensor nodes and the distance to other nodes. DLBCA defines three matrixes (DD, Flag and FlagDis), which are related to the clustering. Through the matrixes, DLBCA can assign balanced and appropriate member nodes for the CHs. Our experimental results show that the DLBCA has better load balancing, longer life cycle and higher energy efficiency compared with existing algorithms.

Certificateless public verification scheme with privacy-preserving and message recovery for dynamic group

Proceedings of the Australasian Computer Science Week Multiconference, 2017

Public auditing is a topic issue as it makes a third party auditor replace user to verify the dat... more Public auditing is a topic issue as it makes a third party auditor replace user to verify the data integrity. Hence, it handles users' problems such as cannot be on-line all times and with constrained computing resources. However, this technology may reveal user's information to the verifier. Therefore, privacy-preserving should be considered in public auditing. What's more, the existing public auditing schemes are mainly based on signatures what need to transfer signature and message together. This kind of public verification scheme is not suitable in small bandwidth situation. Especially, due to unstable network, it will be difficult to upload large files and cloud server cannot ensure that the message he gets is correct. Message recovery signature is adaptable in this circumstance as it only transfers signature and the message can be recovered from the corresponding valid signature. Moreover, certificate-based schemes have certificate management problem and ID-based schemes have key escrow problem. To solve above problems, in this paper, we proposed a certificateless privacy-preserving public verification scheme which also supports message recovery and dynamic group. What's more, our scheme eliminates problems of certificates management and key escrow. Furthermore, we show that our scheme is secure and efficient in performance analysis.

Nframe: A privacy-preserving with non-frameability handover authentication protocol based on (t, n) secret sharing for LTE/LTE-A networks

Wireless Networks, 2016

Seamless handover between the evolved universal terrestrial radio access network and other access... more Seamless handover between the evolved universal terrestrial radio access network and other access networks is highly desirable to mobile equipments in the long term evolution (LTE) or LTE-Advanced (LTE-A) networks, but ensuring security and efficiency of this process is challenging. In this paper, we propose a novel privacy-preserving with non-frameability handover authentication protocol based on (t, n) secret sharing to fit in with all of the mobility scenarios in the LTE/LTE-A networks, which is called Nframe. To the best of our knowledge, Nframe is the first to support protecting users’ privacy with non-frameability in the handover process. Moreover, Nframe uses pairing-free identity based cryptographic method to secure handover process and to achieve high efficiency. The formal verification by the AVISPA tool shows that Nframe is secure against various malicious attacks and the simulation result indicates that it outperforms the existing schemes in terms of computation and communication cost.

Simulation of Customers-flow Model Based-on Elevators Group Control Technique

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06), 2006

Taking use of intelligent group control technique, a customers-flow model and its based-on elevat... more

An Apparatus Realizing Switch of Computing Device Status

First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06), 2006

... Ling Wang, Tong Shao, Shumei Wang, and Gongxuan Zhang Department of Computer Science, Nanjing... more

Snore related signals processing in a private cloud computing system

Interdisciplinary sciences, computational life sciences, 2014

Snore related signals (SRS) have been demonstrated to carry important information about the obstr... more Snore related signals (SRS) have been demonstrated to carry important information about the obstruction site and degree in the upper airway of Obstructive Sleep Apnea-Hypopnea Syndrome (OSAHS) patients in recent years. To make this acoustic signal analysis method more accurate and robust, big SRS data processing is inevitable. As an emerging concept and technology, cloud computing has motivated numerous researchers and engineers to exploit applications both in academic and industry field, which could have an ability to implement a huge blue print in biomedical engineering. Considering the security and transferring requirement of biomedical data, we designed a system based on private cloud computing to process SRS. Then we set the comparable experiments of processing a 5-hour audio recording of an OSAHS patient by a personal computer, a server and a private cloud computing system to demonstrate the efficiency of the infrastructure we proposed.

Cyclic quantum state sharing with a nine-qubit entangled state

Laser Physics Letters

In this paper, we present a novel scheme for cyclic quantum state sharing (QSTS) by using a nine-... more In this paper, we present a novel scheme for cyclic quantum state sharing (QSTS) by using a nine-qubit entangled state as quantum channel. In this scheme, each of the three dealers has a different unknown quantum state, and every dealer wants two agents to share his/her quantum state. At the same time, three dealers perform Bell basis measurements on his/her own qubits, and the controllers make a single-qubit measurement on his/her own qubits, after that, the receivers can recover the original states by applying suitable unitary operations, respectively. It is shown that, only if all agents collaborate with each other, the cyclic QSTS can be completed with unit success probability.

LIAS: A Lightweight Incentive Authentication Scheme for Forensic Services in IoV

IEEE Transactions on Automation Science and Engineering

Multiserver System Configuration Scheme for Profit Maximization

2021 IEEE International Conference on Recent Advances in Systems Science and Engineering (RASSE), 2021

As a promising and valuable IT commercial model, Cloud computing has been paid considerable atten... more As a promising and valuable IT commercial model, Cloud computing has been paid considerable attention by academia and industry [1], which makes the configuration of storage, computing, and communication resources a common commodity for pay-as-you-go management. Thanks to the rapid development of virtualization techniques, an increasing number of users can expediently receive cloud services, which spawns a group of excellent cloud service providers (e.g., Ali Cloud [2], Google [3], and Amazon [4]). The increasing number and variety of cloud service providers also promote the sustainable development of cloud computing. The pursuit of profit maximization is a natural goal for service providers. To realize this goal, cloud service providers are supposed to fully understand the relationship between the economics of cloud services and the system resource management of the cloud platform (also called the multiserver system), especially in a geographically distributed multiserver system, and serve the intermittent cloud service requests.

Scalable and Updatable Attribute-based Privacy Protection Scheme for Big Data Publishing

GLOBECOM 2020 - 2020 IEEE Global Communications Conference, 2020

To ensure data security and privacy during big data publishing, it is challenging to design a sec... more To ensure data security and privacy during big data publishing, it is challenging to design a security and privacy protection scheme for the big data environment with a large scale of users. At the same time, due to the users’ dynamically joining and exiting, it is also very important to design a user’s dynamic update mechanism. To address such challenges, we design a novel scalable and updatable attribute-based privacy protection scheme (SUAPP) for big data publishing. The proposed scheme can realize users’ hierarchical management, which can reduce the overhead on key generation and management caused by the large scale of data users in the big data center (BDC). We set a user group for each attribute, then adapt the Chinese remaining theorem to dynamically assist the big data center to generate and update group keys for the attribute users group. Analyses and experiments show that while ensuring the privacy protection of big data publishing, our scheme also has low communication an...

A New Privacy Protection Approach Based on K-Anonymity for Location-Based Cloud Services

Journal of Circuits, Systems and Computers, 2021

With the rapid development of cloud computing and the popularization of mobile equipment, locatio... more With the rapid development of cloud computing and the popularization of mobile equipment, location-based cloud services (LBCS) are widely used, bringing great convenience to human industrial production and daily life. However, since LBCS is a location-based service, how to protect personal privacy when receiving the service is a matter of widespread concern for cloud users. To solve this problem, this paper introduces a new privacy protection method based on K-anonymity, which not only protects the cloud user’s query privacy as well as location privacy but also resolves the contradiction between privacy protection and service quality. From the simulation experimental results, we verify the effectiveness of our proposed method.

SeShare: Secure cloud data sharing based on blockchain and public auditing

Concurrency and Computation: Practice and Experience, 2017

In a data sharing group, each user can upload, modify, and access group files and a user is requi... more In a data sharing group, each user can upload, modify, and access group files and a user is required to generate a new signature for the modified file after modification. There is a situation that two or more users modify the same file at almost the same time, which should be avoided as it gives rise to a signature conflict. However, the existing schemes do not take it into consideration. In this paper, we proposed a new mechanism SeShare for data storing based on blockchain to realize signature uniqueness, which solves the problem of generating signatures for the same file meanwhile by different group users. Specifically, we record every signature of a file in a blockchain in chronological order, and only one user is allowed to add new signature at the end of the blockchain when modification conflicts occur. On the other hand, to provide a secure data sharing service, SeShare introduces an efficient public auditing scheme for file integrity verification when a group user leaves the group. We also prove the security of the proposed scheme and evaluate the performance at the end of this paper. Our experimental results demonstrate the efficiency of public auditing for user leaving.

Download

A Review of Recent Techniques in Mixed-Criticality Systems

Journal of Circuits, Systems and Computers, 2018

Unlike traditional embedded systems that almost have only one criticality level, many complex emb... more Unlike traditional embedded systems that almost have only one criticality level, many complex embedded systems nowadays are mixed-critical and are more and more widely used. There has been a lot of research on mixed-criticality (MC) systems. In this paper, we present a survey on the MC systems on these research. First, we discuss the exaltation of the schedulability of MC systems. As improving schedulability may lead to quality-of-service (QoS) reduction of MS systems. Therefore, we investigate the approaches to solve this problem. Improving QoS of MS systems may inevitably increase the energy consumption. Then, we introduce the researches that take the energy efficiency as a design requirement of MC systems. Few MC systems regard fault-tolerance as the design requirement, thus, we extensively investigate fault-tolerance of MC systems. In addition, we introduce some of the main applications for MC systems.

Download

A trust enhancement scheme for cluster-based wireless sensor networks

The Journal of Supercomputing, 2018

Security is crucial in wireless sensor networks (WSNs) since a growing variety of applications re... more Security is crucial in wireless sensor networks (WSNs) since a growing variety of applications require strict security. Cluster-based architecture has an enhancement in the system performance of WSNs. This article presents a trust enhancement scheme for cluster-based WSNs, where network time is divided into multiple rounds. Each round contains a setup phase and a steady-state phase. In the setup phase, clusters are formed and mutual trusted relationships between cluster nodes are established through two proposed authentication protocols called SET-μTESLA (Setup μTESLA) and SET-SCHNORR (Setup SCHNORR). SET-μTESLA uses the authenticated broadcast μTESLA scheme and reduces the iterations of hash function to improve the energy efficiency, while SET-SCHNORR applies a lightweight signature SCHNORR scheme. In the steady-state phase, collected environmental or physical data are transmitted through the proposed STEADY-μTESLA protocol (Steady-state μTESLA), which guarantees the data credibility. The analysis demonstrates that the security scheme does well in resisting such attacks as data confidentiality attacks, data integrity attacks and compromise node attacks. In addition, the results of calculations and simulations show that the proposed scheme performs better than the existing security protocols in terms of communication overhead and energy consumption.

Download

A privacy protection method for continuous query based on location services

Wuhan University Journal of Natural Sciences, 2013

To solve the problem that the traditional location-based services anonymity model is not applied ... more To solve the problem that the traditional location-based services anonymity model is not applied to the continuous query, quasi real-time cloak algorithm (QR-TCA) has been proposed, and the non-delay cloak model (N-DCM) has been established. After comprehensive analysis of location-based continuous query privacy protection models, a model that can solve the user service delay problem is proposed, which can provide the users with quasi-real time location-based services. The experiment measures the N-DCM model with multiple dimensions, such as service response time and service quality of standard datasets. The experiment results show that the method is suitable for continuous query location privacy protection and can effectively protect the user’s location privacy.

Synthesis of Petri net supervisors for FMS via redundant constraint elimination

Automatica, 2015

The Minimal number of Control Places Problem (MCPP), which is formulated to obtain optimal and st... more

Gongxuan Zhang

Uploads

Papers by Gongxuan Zhang

Log In