This page has only limited features, please log in for full access.

Unclaimed
Wenfeng Shen
School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 07 June 2018 in Future Internet
Reads 0
Downloads 0

Provable Data Possession (PDP) protocol makes it possible for cloud users to check whether the cloud servers possess their original data without downloading all the data. However, most of the existing PDP schemes are based on either public key infrastructure (PKI) or identity-based cryptography, which will suffer from issues of expensive certificate management or key escrow. In this paper, we propose a new construction of certificateless provable group shared data possession (CL-PGSDP) protocol by making use of certificateless cryptography, which will eliminate the above issues. Meanwhile, by taking advantage of zero-knowledge protocol and randomization method, the proposed CL-PGSDP protocol leaks no information of the stored data and the group user’s identity to the verifiers during the verifying process, which is of the property of comprehensive privacy preservation. In addition, our protocol also supports efficient user revocation from the group. Security analysis and experimental evaluation indicate that our CL-PGSDP protocol provides strong security with desirable efficiency.

ACS Style

HongBin Yang; Shuxiong Jiang; Wenfeng Shen; Zhou Lei. Certificateless Provable Group Shared Data Possession with Comprehensive Privacy Preservation for Cloud Storage. Future Internet 2018, 10, 49 .

AMA Style

HongBin Yang, Shuxiong Jiang, Wenfeng Shen, Zhou Lei. Certificateless Provable Group Shared Data Possession with Comprehensive Privacy Preservation for Cloud Storage. Future Internet. 2018; 10 (6):49.

Chicago/Turabian Style

HongBin Yang; Shuxiong Jiang; Wenfeng Shen; Zhou Lei. 2018. "Certificateless Provable Group Shared Data Possession with Comprehensive Privacy Preservation for Cloud Storage." Future Internet 10, no. 6: 49.

Journal article
Published: 10 April 2018 in Future Internet
Reads 0
Downloads 0

With the rapid development of video surveillance technology, especially the popularity of cloud-based video surveillance applications, video data begins to grow explosively. However, in the cloud-based video surveillance system, replicas occupy an amount of storage space. Also, the slow response to video playback constrains the performance of the system. In this paper, considering the characteristics of video data comprehensively, we propose a dynamic redundant replicas mechanism based on security levels that can dynamically adjust the number of replicas. Based on the location correlation between cameras, this paper also proposes a data cache strategy to improve the response speed of data reading. Experiments illustrate that: (1) our dynamic redundant replicas mechanism can save storage space while ensuring data security; (2) the cache mechanism can predict the playback behaviors of the users in advance and improve the response speed of data reading according to the location and time correlation of the front-end cameras; and (3) in terms of cloud-based video surveillance, our proposed approaches significantly outperform existing methods.

ACS Style

Rongheng Li; Jian Zhang; Wenfeng Shen. Replicas Strategy and Cache Optimization of Video Surveillance Systems Based on Cloud Storage. Future Internet 2018, 10, 34 .

AMA Style

Rongheng Li, Jian Zhang, Wenfeng Shen. Replicas Strategy and Cache Optimization of Video Surveillance Systems Based on Cloud Storage. Future Internet. 2018; 10 (4):34.

Chicago/Turabian Style

Rongheng Li; Jian Zhang; Wenfeng Shen. 2018. "Replicas Strategy and Cache Optimization of Video Surveillance Systems Based on Cloud Storage." Future Internet 10, no. 4: 34.

Journal article
Published: 18 July 2017 in Future Internet
Reads 0
Downloads 0

Live migration of virtual machines is an important approach for dynamic resource scheduling in cloud environment. The hybrid-copy algorithm is an excellent algorithm that combines the pre-copy algorithm with the post-copy algorithm to remedy the defects of the pre-copy algorithm and the post-copy algorithm. Currently, the hybrid-copy algorithm only copies all memory pages once in advance. In a write-intensive workload, copy memory pages once may be enough. However, more iterative copy rounds can significantly reduce the page faults in a read-intensive workload. In this paper, we propose a new parameter to decide the appropriate time to stop the iterative copy phase based on real-time situation. We use a Markov model to forecast the memory access pattern. Based on the predicted results and the analysis of the actual situation, the memory page transfer order would be adjusted to reduce the invalid transfers. The novel hybrid-copy algorithm is implemented on the Xen platform. The experimental results demonstrate that our mechanism has good performance both on read-intensive workloads and write-intensive workloads.

ACS Style

Zhou Lei; Exiong Sun; Shengbo Chen; Jiang Wu; Wenfeng Shen. A Novel Hybrid-Copy Algorithm for Live Migration of Virtual Machine. Future Internet 2017, 9, 37 .

AMA Style

Zhou Lei, Exiong Sun, Shengbo Chen, Jiang Wu, Wenfeng Shen. A Novel Hybrid-Copy Algorithm for Live Migration of Virtual Machine. Future Internet. 2017; 9 (3):37.

Chicago/Turabian Style

Zhou Lei; Exiong Sun; Shengbo Chen; Jiang Wu; Wenfeng Shen. 2017. "A Novel Hybrid-Copy Algorithm for Live Migration of Virtual Machine." Future Internet 9, no. 3: 37.

Journal article
Published: 02 June 2017 in Future Internet
Reads 0
Downloads 0

With the rapid development of Internet, the traditional computing environment is making a big migration to the cloud-computing environment. However, cloud computing introduces a set of new security problems. Aiming at the virtual machine (VM) escape attack, we study the traditional attack model and attack scenarios in the cloud-computing environment. In addition, we propose an access control model that can prevent virtual machine escape (PVME) by adapting the BLP (Bell-La Padula) model (an access control model developed by D. Bell and J. LaPadula). Finally, the PVME model has been implemented on full virtualization architecture. The experimental results show that the PVME module can effectively prevent virtual machine escape while only incurring 4% to 8% time overhead.

ACS Style

Jiang Wu; Zhou Lei; Shengbo Chen; Wenfeng Shen. An Access Control Model for Preventing Virtual Machine Escape Attack. Future Internet 2017, 9, 20 .

AMA Style

Jiang Wu, Zhou Lei, Shengbo Chen, Wenfeng Shen. An Access Control Model for Preventing Virtual Machine Escape Attack. Future Internet. 2017; 9 (2):20.

Chicago/Turabian Style

Jiang Wu; Zhou Lei; Shengbo Chen; Wenfeng Shen. 2017. "An Access Control Model for Preventing Virtual Machine Escape Attack." Future Internet 9, no. 2: 20.

Information technology
Published: 15 October 2011 in Journal of Shanghai University (English Edition)
Reads 0
Downloads 0

As a parallel programming model, Map-Reduce is used for distributed computing of massive data. Map-Reduce model encapsulates the details of parallel implementation, fault-tolerant processing, local computing and load balancing, etc., provides a simple but powerful interface. In case of having no clear idea about distributed and parallel programming, this interface can be utilized to save development time. This paper introduces the method of using Hadoop, the open-source Map-Reduce software platform, to combine PCs to carry out scalable parallel computing. Our experiment using 12 PCs to compute N-body problem based on Map-Reduce model shows that we can get a 9.8x speedup ratio. This work indicates that the Map-Reduce can be applied in scalable parallel computing.

ACS Style

Thanh-Cuong Nguyen; Wen-Feng Shen; Ya-Hui Chai; Wei-Min Xu. Research and implementation of scalable parallel computing based on Map-Reduce. Journal of Shanghai University (English Edition) 2011, 15, 426 -429.

AMA Style

Thanh-Cuong Nguyen, Wen-Feng Shen, Ya-Hui Chai, Wei-Min Xu. Research and implementation of scalable parallel computing based on Map-Reduce. Journal of Shanghai University (English Edition). 2011; 15 (5):426-429.

Chicago/Turabian Style

Thanh-Cuong Nguyen; Wen-Feng Shen; Ya-Hui Chai; Wei-Min Xu. 2011. "Research and implementation of scalable parallel computing based on Map-Reduce." Journal of Shanghai University (English Edition) 15, no. 5: 426-429.

Journal article
Published: 01 July 2011 in Advanced Materials Research
Reads 0
Downloads 0

FMM is an efficient algorithm in computing N-body problem. This paper firstly subdivides the FMM into 10 procedures. Based on the analysis the computing type of each procedure, we choose key procedures accelerated on FPGA, GPU and Cell BE. And then we present the speedup ratio of each accelerated procedure through experiments. Finally we analyze the computing characteristic of FMM on the computing architecture on accelerator FPGA and GPU on the side of P, M and C.

ACS Style

Ya Hui Chai; Wen Feng Shen; Wei Min Xu; Yan Heng Zheng. Computing Acceleration of FMM Algorithm on the Basis of FPGA and GPU. Advanced Materials Research 2011, 291-294, 3272 -3277.

AMA Style

Ya Hui Chai, Wen Feng Shen, Wei Min Xu, Yan Heng Zheng. Computing Acceleration of FMM Algorithm on the Basis of FPGA and GPU. Advanced Materials Research. 2011; 291-294 ():3272-3277.

Chicago/Turabian Style

Ya Hui Chai; Wen Feng Shen; Wei Min Xu; Yan Heng Zheng. 2011. "Computing Acceleration of FMM Algorithm on the Basis of FPGA and GPU." Advanced Materials Research 291-294, no. : 3272-3277.