National Engineering Laboratory for Disaster Backup and Recovery

Beijing, China

National Engineering Laboratory for Disaster Backup and Recovery

Beijing, China
SEARCH FILTERS
Time filter
Source Type

Zhu H.,Beijing University of Posts and Telecommunications | Zhu H.,National Engineering Laboratory for Disaster Backup and Recovery | Liu W.,Beijing University of Posts and Telecommunications | Liu W.,National Engineering Laboratory for Disaster Backup and Recovery | And 3 more authors.
Proceedings of 2016 4th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2016 | Year: 2016

In this paper, we build a set of high-performance sequence retrieve system of string encryption and data cipher text, which aimed to the safe problems of string storage and cipher text retrieval performance issues after encryption in Cloud Storage business. First, In encryption, we put forward a kind of encryption strategy based on IDEA. Second, as for cipher text retrieval, we put forward a modified bucket partitioning strategy, Finally, we look forward a modified character set index generation strategy based on BloomFilter which combined with the generation strategy of relationship between positions of characters feature index based on pairs coding function map. Through experiments, this kind of dual retrieval strategy has improvement in performance than former retrieval strategies. © 2016 IEEE.


Yang C.,Beijing University of Posts and Telecommunications | Qiu P.,Beijing University of Posts and Telecommunications | Zheng S.,National Engineering Laboratory for Disaster Backup and Recovery | Wang L.,National Engineering Laboratory for Disaster Backup and Recovery
Proceedings - 2015 International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2015 | Year: 2015

Lattice-based proxy signature is a kind of signature that can resist the known quantum attack and a special digital signature which has the proxy functionality. So far, as far as I know, all lattice-based proxy signatures that use the "hash-And-sign" method of GPV08 signature are low efficient due to the time-consuming preimage sampleable algorithm. Based on the rejection sampling technique of Lyu12 signature, we proposed an efficient lattice-based proxy signature scheme without trapdoor, and the formal security proof of existentially unforgeable is given in random oracle model. In addition, the length of keys and signature in our scheme are shorter than all existing lattice-based proxy signature schemes, and the computations are also small. © 2015 IEEE.


Yang Y.,Beijing University of Posts and Telecommunications | Yang Y.,National Engineering Laboratory for Disaster Backup and Recovery | Lei M.,Beijing University of Posts and Telecommunications | Lei M.,National Engineering Laboratory for Disaster Backup and Recovery | And 3 more authors.
Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology | Year: 2012

In order to improve the imperceptibility of traditional watermarking scheme, a novel audio zero-watermarking scheme based on discrete cosine transform and discrete wavelet transform(DCT-DWT) is proposed. The audio is split into equal frames. Approximate components are extracted using the DWT for each frame. Mean values of the approximate components are obtained using the DCT. Watermark is embedded according to the relationship between two adjacent mean values. Simulation and experimental results show that the algorithm has strong robustness against common audio signal processing attacks such as MP3 compression, re-quantization, re-sampling, low-pass filter and noise reduction and high efficiency.


Liu W.,Communication University of China | Luo S.-S.,Beijing University of Posts and Telecommunications | Luo S.-S.,National Engineering Laboratory for Disaster Backup and Recovery | Wang Y.-B.,Communication University of China
Tien Tzu Hsueh Pao/Acta Electronica Sinica | Year: 2010

Secure two-party vector dominance statistic problem is a problem generalized from the millionaires' problem, which can be used by two party to get the number of ai > bi without leaking further information. A secure two-party vector dominance statistic protocol in semi-honest model is presented based on the additive homomorphic encryption. The correctness, security and complexity of the protocol are analyzed. A secure components sum of two vectors ranking protocol is proposed based on the dominance statistic protocol and the ranking protocol is also applied in the secure minimum spanning trees algorithm.


Maohua S.,Beijing University of Posts and Telecommunications | Shoushan L.,National Engineering Laboratory for Disaster Backup and Recovery | Lei P.,Beijing University of Posts and Telecommunications | Zhe J.,Beijing University of Posts and Telecommunications | Yang X.,Beijing Safe Code Technology Co Ltd.
International Journal of Advancements in Computing Technology | Year: 2012

With the rapid growth of the internet and the progress of the society, people need to share more and more information with others. How to ensure the authorized persons to get the information is a big problem now. Secret sharing is a widely used tool to solve this problem. In this paper, the related work and the framework of secret sharing is demonstrated. We also develop the relationship between secret sharing and secure multi-party computation, and introduce how to build the privacy-preserving secret sharing scheme. At the same time, future works of secret sharing are proposed in the end.


Sun J.,Tsinghua University | Sun J.,National Engineering Laboratory for Disaster Backup and Recovery | Yu H.,Tsinghua University | Yu H.,National Engineering Laboratory for Disaster Backup and Recovery | And 2 more authors.
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | Year: 2013

Distributed storage systems have been widely adopted in the cloud storages and enterprise storage infrastructure, because of their high scalability and cost effectiveness. In the storage systems, data de-duplication can save most of storage space for the devices, and can improve the efficiency of data transmission. The key of de-duplicating in the distributed storage systems is how to implement a high performance and scalability meta-data index that should not hurt the writing throughput. This paper proposes an index of meta-data sets of the similar files. The index uses a locality sensitive Hashing function to organize meta-data set, and accesses the disk only one time for the lookups for the chunks of a file. Consequently, the index improves the indexing performance with high scalability and a small memory footprint, which is suitable for the cloud and enterprise storages.


Yu H.,Tsinghua University | Yu H.,National Engineering Laboratory for Disaster Backup and Recovery | Zhang F.,Tsinghua University | Wu Y.,Tsinghua University
Future Generation Computer Systems | Year: 2014

Up to now, more and more people use Internet storage services as a new way of sharing. File sharing by a distributed storage system is quite different from a specific sharing application like BitTorrent. And as large file sharing becomes popular, the data transmission rate takes the place of the response delay to be the major factor influencing user experience. We present the design and implementation of a distributed storage system named as Granary in this paper, which provides reliable data storage and sharing service to cyber users. Granary uses a specific DHT(Distributed Hash Table) layer to store file meta-data and employs a raw data storage scheme to scatter large data. We introduce its adaptive DHT recovery algorithm in this paper which assures the availability and consistency of meta-data with small bandwidth consumption and improved throughout. The replication strategies which are used to accelerate file sharing with low bandwidth consumptions are further discussed. Experimental results show that these methods offer a reliable and efficient data storage and sharing speed with network bandwidth costs less than conventional policies. © 2013 Elsevier B.V. All rights reserved.


Xiao D.,National Engineering Laboratory for Disaster Backup and Recovery | Yang Y.,Beijing Jiaotong University | Yao W.,National Engineering Laboratory for Disaster Backup and Recovery | Wu C.,National Engineering Laboratory for Disaster Backup and Recovery | And 2 more authors.
Computers and Security | Year: 2012

Remote Data Checking (RDC) adds data possession or retrievability guarantee to cloud storage without downloading the whole data. The support for dynamic data updates is vital for the practical application of RDC. We define Multiple-File Remote Data Checking (MF-RDC), an RDC model suitable for the specific data update model of cloud storage. MF-RDC checks the intactness of a dynamic file group consisting of a growing number of static files. By checking a group of files aggregately, the overhead of the scheme can be significantly reduced. We propose constructions of two MF-RDC schemes: MF-PDP and MF-POR. An efficient and secure MF-PDP scheme that provides data possession guarantee is constructed from a single-file PDP scheme by combining homomorphic authenticators with virtual block indices. The scheme is amended to integrate with file encoding using adversarial error-correcting codes, producing the MF-POR scheme that provides data retrievability guarantee. We conduct rigorous security analysis of the schemes and perform experimental evaluation on our implementation. With an efficient implementation, the communication and computation overhead of the schemes is reduced from linear in the size of the data to near constant. The performance of the schemes is bounded by disk I/O rather than cryptographic computation. © 2011 Elsevier Ltd. All rights reserved.


Pang L.,Post University | Jia Z.,Post University | Luo S.,National Engineering Laboratory for Disaster Backup and Recovery | Wang B.,Post University | Xin Y.,Beijing Safe code Technology Co Ltd
International Journal of Advancements in Computing Technology | Year: 2011

With the development of all types of electronic auction, the study of designing secure electronic auction has become an important issue. This paper deals with (M+1)-st price auction. We present a secure protocol without auctioneer, taking advantage of the homomorphic lemma of threshold ElGamal encryption. The bidders can compute the result by themselves without leaking own messages. The correctness and security are also analyzed. In the phase of opening bid, the offline of the unsuccessful bidder may cause the price can't be calculated. This protocol can deal with the problem.


Liu L.,CAS Institute of Computing Technology | Xu L.,National Engineering Laboratory for Disaster Backup and Recovery | Yang D.,Petrochina
Applied Mathematics and Information Sciences | Year: 2011

We present a decentralized resource allocation approach, DRG (Decentralized Response-time Guarantee), that can provide response time guarantees for multiple concurrent workloads sharing a back-end storage system in a distributed manner without assuming any support from the storage itself. This new approach uses several run-time statistics of both workloads and system as indicators of busty and load condition at the backend storage and accepts a control equation periodically to adjust the number of I/O requests which could be issued per workloads to meet the performance goals. Using a real I/O trace, we demonstrate that our approach can simultaneously meet the response-time requirements imposed by an SLO without requiring extensive knowledge of the underlying storage system. © 2011 NSP.

Loading National Engineering Laboratory for Disaster Backup and Recovery collaborators
Loading National Engineering Laboratory for Disaster Backup and Recovery collaborators