Current Issue

25 June 2018, Volume 39 Issue 6

Previous Issue    Next Issue

Papers

Multi-authority attribute-based access control system in mHealth with traceability

Qi LI,Hongbo ZHU,Jinbo XIONG,Ruo MO

2018, 39(6):  1-10.  doi:10.11959/j.issn.1000-436x.2018100

Asbtract ( 481 )   HTML ( 12)   PDF (1347KB) ( 1282 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Mobile healthcare (mHealth) is an emerging technology which facilitates the share of personal health records (PHR),however,it also brings the risk of the security and privacy of PHR.Attribute-based encryption (ABE) is regarded as a new cryptology to enhance fine-grained access control over encrypted data.However,existing attribute-based mHealth systems either lack of efficient traceable approach,or support only single authority.A traceable multi-authority attribute-based access control mHealth scheme was proposed,which was constructed over composite order groups and supports any monotonic access structures described by linear secret sharing scheme (LSSS).The adaptive security was proved under subgroup decisional assumptions.The traceability was proved under k-strong Diffie-Hellman (k-SDH) assumption.The performance analysis indicates that the proposed scheme is efficient and available.

Scheduling algorithm for stochastic job stream cipher service based on load balancing

Li LI,Guozhen SHI,Kui GENG,Xiuze DONG,Fenghua LI

2018, 39(6):  11-19.  doi:10.11959/j.issn.1000-436x.2018105

Asbtract ( 424 )   HTML ( 7)   PDF (961KB) ( 1239 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Business stream parallel processing system face the situation of the diversity of cipher service requests,the cross of serial mode and parallel mode,the intercross of different business data flow,and the demand of high speed and high reliability in security field.In order to improve the parallel processing efficiency of multi-cryptographic algorithm,load balancing was used as scheduling objective.Based on hierarchical hardware scheduling method (HHS-ACDID),considering the processing node’s storage capacity and processing speed,a load balancing scheduling algorithm was approved to support non related tasks and related tasks at the same time,which achieves the high speed cipher processing throughput.Simulation results show that the algorithm can complete dynamic scheduling of data stream system and get better load balancing effect.Compared with HHS-ACDID,the efficiency of the algorithm is improved by about 12%.

Carrier frequency estimation method of time-frequency overlapped signals based on cyclic correntropy spectrum

Tianshuang QIU,Xing CHEN,Jitong MA,Jingchun LI,Rong LI

2018, 39(6):  20-26.  doi:10.11959/j.issn.1000-436x.2018091

Asbtract ( 452 )   HTML ( 9)   PDF (1052KB) ( 861 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

According to the performance degradation problem of the carrier frequency estimation method of time-frequency overlapped BPSK signals in Alpha-stable distribution noise,a novel carrier frequency estimation algorithm of the time-frequency overlapped BPSK signals based on the cyclic correntropy spectrum was proposed.The relationship between cyclic frequency and carrier frequency on the zero frequency section of the cyclic correntropy spectrum was deduced,which could be utilized for carrier frequency estimation.The proposed method can suppress the impulse noise and has better estimation performance than that of the contrastive methods.Simulation results are presented to demonstrate the effectiveness and robustness of the proposed method.

Android collusion attack detection model

Hongyu YANG,Zaiming WANG

2018, 39(6):  27-36.  doi:10.11959/j.issn.1000-436x.2018095

Asbtract ( 529 )   HTML ( 12)   PDF (1123KB) ( 925 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In order to solve the problem of poor efficiency and low accuracy of Android collusion detection,an Android collusion attack model based on component communication was proposed.Firstly,the feature vector set was extracted from the known applications and the feature vector set was generated.Secondly,the security policy rule set was generated through training and classifying the privilege feature set.Then,the component communication finite state machine according to the component and communication mode feature vector set was generated,and security policy rule set was optimized.Finally,a new state machine was generated by extracting the unknown application’s feature vector set,and the optimized security policy rule set was matched to detect privilege collusion attacks.The experimental results show that the proposed model has better detective efficiency and higher accuracy.

Survey on trust evaluation mechanism in sensor-cloud

Tian WANG,Guangxue ZHANG,Shaobin CAI,Weijia JIA,Guojun WANG

2018, 39(6):  37-51.  doi:10.11959/j.issn.1000-436x.2018098

Asbtract ( 1011 )   HTML ( 9)   PDF (911KB) ( 1064 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Sensor-cloud has gradually developed into a research hotspot.A good trust evaluation mechanism can better address some security issues in this new structure,such as internal attacks.A good trust evaluation mechanism can also ensure the security and efficient transmission of information in this structure.After an extensive research on sensor-cloud and trust evaluation mechanisms,it was found that trust evaluation mechanisms in sensor-cloud can be divided into two categories,among entities and in entity.After comparing the advantages and shortcomings of existing trust evaluation mechanisms,a new fog-based trust evaluation mechanism was designed and future research directions of trust evaluation mechanisms were discussed in sensor-cloud.

Trusted auditing method of virtual machine based on improved expectation decision method

Junfeng TIAN,Yongchao ZHANG

2018, 39(6):  52-63.  doi:10.11959/j.issn.1000-436x.2018110

Asbtract ( 872 )   HTML ( 4)   PDF (902KB) ( 753 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Whether the cloud computing environment is credible is the key factor in the promotion and effective use of cloud computing.For this reason,the expected value decision method in risk decision-making was improved.The usage scenarios was redefined,the cost and benefit of audit scheme was digitized,and a virtual machine trusted auditing strategy based on improved expectation decision method was proposed.Several levels of security protection for the user virtual machine was provided,and the optimal audit scheme was selected autonomously according to the security protection level chosen by the user for the virtual machine.The virtual machine introspection (VMI) technology was used to obtain the virtual machine information that needs to be audited.The designed encryption mechanism was used to protect the security of users selected security protection level,so as to ensure the security of user virtual machine selection audit strategy.Finally,the simulation results show that the scheme has good performance and validity.

Multi-user detection scheme for SCMA systems based on iteration removal

Cuitao ZHU,Ning WEI,Hanxin WANG,Zhongjie LI

2018, 39(6):  64-72.  doi:10.11959/j.issn.1000-436x.2018093

Asbtract ( 414 )   HTML ( 15)   PDF (788KB) ( 992 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

A multi-user detection scheme based on iteration removal (RM-MPA) was proposed to solve the problem of high complexity of decoding algorithm for sparse code multiple access (SCMA) systems.Firstly,a simple and novel method to compare the decoding advantages between users was proposed.Then n users in front of them with higher decoding advantages directly decoded and removed after each iteration,the users removed no longer participate in the subsequent iteration,so the complexity of subsequent iterations decreased gradually.Moreover,two iteration removed strategies based on decoding advantages of users and orthogonal user grouped were proposed respectively.Simulation results show that the RM-MPA with removed strategies based on orthogonal user grouped,which can reduce the decoding complexity with well decoding performance,and the decoding delay is also decreased.

New entity authentication and access control scheme in satellite communication network

Liehuang ZHU,Long WANG,Jiasheng LI,Chuan ZHANG,Weihua YUAN

2018, 39(6):  73-80.  doi:10.11959/j.issn.1000-436x.2018103

Asbtract ( 434 )   HTML ( 21)   PDF (3508KB) ( 1316 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

With the increasing global demand for satellite communications,the problem of entity authentication and access control of the satellite communication network needs to be solved urgently.To solve this problem,a new multiple center-based entity authentication and cross-domain access control scheme was proposed.The scheme divided the multiple centers into two layers for entity authentication,and maped the authorization of the multiple domains to achieve access control.Simulation experiments show that the proposed scheme support the entity authentication for 100 million users.Furthermore,it also allows 1 million users to access in parallel.

Program state optimal method based on variable symbolic relation analysis

Xi GUO,Pan WANG

2018, 39(6):  81-88.  doi:10.11959/j.issn.1000-436x.2018094

Asbtract ( 300 )   HTML ( 4)   PDF (817KB) ( 909 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Program analysis is the prime method to program property analysis,which is widely used in the domain of parameter dependent relation,path coverage and test case generation,and a lot of progress has been made.Current program analysis is based on the method of symbolic execution,but symbolic execution is usually tackled with the problems of logic expression generation of path condition and low efficiency of constrain solver,which will affect the results of program analysis.Aiming at enhancing the path analysis efficiency,the path conditions of different paths were collected,the common symbolic expression was extracted and the efficiency of symbolic analysis was enhanced,then the logic expression set was generated,the dependent relation algorithm was used to enhance the efficiency of symbolic analysis.Experimental results demonstrate that the proposed method has the advantages of accurate time complexity and better analysis efficiency compare to traditional program analysis method.

Research on the programming language for proxy re-encryption

Mang SU,Yan YU,Bin WU,Anmin FU

2018, 39(6):  89-97.  doi:10.11959/j.issn.1000-436x.2018106

Asbtract ( 338 )   HTML ( 10)   PDF (879KB) ( 1445 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The programming language for proxy re-encryption(PLPRE) based on domain specific language(DSL) was proposed,which was similar to the matical description and was adopt to describe the proxy re-encryption directly.The algorithm designer could describe the algorithm conveniently and quickly by PLPRE,and obtain the programming code for computer.Firstly,the grammar of PLPRE was presented,including the definitions of the keyword and programming logic,then the ACC-PRE algorithm was described by PLPRE as an example.Secondly,the PLPRE parser was realized by ANTLR.Finally,the comparisons between the PLPRE and the related work were made.By using the PLPRE,user does not need to pay attentions to data structure or memory allocation.It is suitable for the cryptography experts who is not familiar with the programming.Thus,PLPRE will decrease the deviation between the design and implement for PRE.

Orchestration mechanism for VNF hardware acceleration resources in SDN/NFV architecture

Tong DUAN,Julong LAN,Yuxiang HU,Hongwei FAN

2018, 39(6):  98-108.  doi:10.11959/j.issn.1000-436x.2018108

Asbtract ( 517 )   HTML ( 9)   PDF (1032KB) ( 1111 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The hardware acceleration mechanism for VNF (virtual network function) is recently a hot research topic in SDN/NFV architecture because of the low processing performance of VNF.Once hardware acceleration resources have been plugged into the network,how to optimally mange and orchestrate these resources under service requirements remains a question to be solved.Firstly,a unified management architecture based on separated control for hardware acceleration resources was proposed.Then,traditional network topology together with hardware acceleration resources were modeled into a unified network model and then the hardware acceleration resource orchestration problem was transferred into a multi-objective linear programming problem.Finally,a hardware-accelerator-card-prior’ heuristic algorithm was designed.Experimental results show that compared with existing methods,the proposed orchestration mechanism can efficiently manage hardware acceleration resources and reduce the processing latency by 30%.

Graph compression algorithm based on a two-level index structure

Gaochao LI,Ben LI,Yuhai LU,Mengya LIU,Yanbing LIU

2018, 39(6):  109-115.  doi:10.11959/j.issn.1000-436x.2018104

Asbtract ( 418 )   HTML ( 7)   PDF (983KB) ( 765 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The demand for the analysis and application of graph data in various fields is increasing day by day.The management of large-scale graph data with complicated structure and high degree of coupling faces two challenges:one is querying speed too slow,the other is space consumption too large.Facing the problems of long query time and large space occupation in graph data management,a two-level index compression algorithm named GComIdx for graph data was proposed.GComIdx algorithm used the ordered Key-Value structure to store the associated nodes and edges as closely as possible,and constructed two-level index and hash node index for efficient attribute query and neighbor query.Furthermore,GComIdx algorithm used a graph data compressed technology to compress the graph data before it directly stored in hard disk,which could effectively reduce the storing space consumption.The experimental results show that GComIdx algorithm can effectively reduce the initialization time of the graph data calculation and the disk space occupancy of the graph data storing,meanwhile,the query time is less than common graph databases and other Key-Value storage solutions.

Timing evolution and prediction of Internet transmission behavior

He TIAN,Hai ZHAO,Jinfa WANG,Chuan LIN

2018, 39(6):  116-126.  doi:10.11959/j.issn.1000-436x.2018096

Asbtract ( 494 )   HTML ( 22)   PDF (2215KB) ( 896 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The transmission behavior of Internet plays an importance role in the research on the relationship between network topology structure and dynamic behavior.Selecting effective path samples in four monitoring points which from different regions authorized by CAIDA_Ark project and statistics network traveling time and traveling diameter,their correlation is very weak,network traveling time is presented on multi-peak and heavy tail distribution.Using nonlinear time sequences analysis method to identify the Chaos characteristics of network traveling time evolution sequences.The results show that their timing evolution has Chaos characteristics.Based on this,the Logistic equation was lead to establish network transmission behavior prediction model,and particle swarm optimization (PSO) was used to optimize model parameters.The model by the network traveling time sequences of four monitoring points was experimented,evaluated it from accuracy and availability,the results show that the model can predict network transmission behavior accurately in the short term.It can be used as a tool for predicting the network behaviors’ evolution in a period of time.

Partial-norm-constrained sparse recovery algorithm and its application on single carrier underwater-acoustic-data telemetry

Feiyun WU,Kunde YANG,Feng TONG

2018, 39(6):  127-132.  doi:10.11959/j.issn.1000-436x.2018099

Asbtract ( 378 )   HTML ( 4)   PDF (1618KB) ( 776 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

To solve the problem of single carrier underwater-acoustic-data telemetry,compressive sensing (CS) provides competitive performance of compression and recovery with low energy consumption.The primary objective of CS is to minimize the l₀norm,which is an NP hard problem.Hence,the common methods were transferred to minimize l₁norm.However,l₁norm minimization provided a limited accuracy.A partial-norm-constraint (PNC) based sparse signal recovery method was derived,which adopted PNC as a zero attraction in a Lagrange method,to distribute the soft threshold for the non-zero taps.The proposed method is used for at-sea data telemetry.Combining with DCT,the proposed method improves the recovery accuracy.

New extension method of trusted certificate chain in virtual platform environment

Liang TAN,Neng QI,Lingbi HU

2018, 39(6):  133-145.  doi:10.11959/j.issn.1000-436x.2018090

Asbtract ( 424 )   HTML ( 11)   PDF (1068KB) ( 765 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

When using trusted computing technology to build a trusted virtual platform environment,it is a hot problem that how to reasonably extend the underlying physical TPM certificate chain to the virtual machine environment.At present,the certificate trust expansion schemes are not perfect,either there is a violation of the TCG specifications,or TPM and vTPM certificate results inconsistent,either the presence of key redundancy,or privacy CA performance burden,some project cannot even extend the certificate trust.Based on this,a new extension method of trusted certificate chain was proposed.Firstly,a new class of certificate called VMEK (virtual machine extension key) was added in TPM,and the management mechanism of certificate VMEK was constructed,the main feature of which was that its key was not transferable and could be used to sign and encrypt the data inside and outside of TPM.Secondly,it used certificate VMEK to sign vTPM’s vEK to build the trust relationship between the underlying TPM and virtual machine,and realized extension of trusted certificate chain in virtual machine.Finally,in Xen,VMEK certificate and its management mechanism,and certificate trust extension based on VMEK were realized.The experiment results show that the proposed scheme can effectively realize the remote attestation function of virtual platform.

New low-earth orbit satellites authentication and group key agreement protocol

Zijian ZHANG,Qi ZHOU,Chuan ZHANG,Xiaoyao TONG,Chunlei LI,Long WANG

2018, 39(6):  146-154.  doi:10.11959/j.issn.1000-436x.2018102

Asbtract ( 560 )   HTML ( 32)   PDF (1101KB) ( 1311 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Due to the function of communication and continuous monitoring,the low-earth orbit satellites are widely used in the aerospace field.However,there is no special authentication protocol in the existing satellite communication system.In order to solve this problem,a lightweight authentication protocol which considering the switch of communication path in the authentication process was designed for the low-earth orbit satellites,and the proposed protocol was verified by simulation and compared with the 3GPP AKA protocol.The simulation results show that the protocol has a 20% higher efficiency than 3GPP AKA protocol,and the spend of group key agreement protocol is about 300 ms.

Comprehensive Reviews

Survey on SDN-based network testbeds

Tao HUANG,Jiang LIU,Chen ZHANG,Liang WEI,Yunjie LIU

2018, 39(6):  155-168.  doi:10.11959/j.issn.1000-436x.2018092

Asbtract ( 690 )   HTML ( 25)   PDF (1048KB) ( 1516 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

The network testbed based on software defined networking (referred as SDN testbed) has attracted extensive attention in the academic and industrial circles in recent years,and there have been many valuable cases of system/platform construction.Therefore,an overview of the SDN testbed was intended to conduct in the global scope.Firstly,the advantages of the SDN testbed and the basic design principles of the large-scale SDN testbed was explored comparing with the traditional network testbed.Secondly,in-depth analysis of existing SDN testbed projects was provided from the aspects of the project objectives and progress,the key technologies,network deployment,and featured applications.Finally,the challenges faced in this field were described in terms of network slicing,light and wireless convergence,security,and reliability.Future research directions are also suggested.

Survey of video behavior recognition

Huilan LUO,Chanjuan WANG,Fei LU

2018, 39(6):  169-180.  doi:10.11959/j.issn.1000-436x.2018107

Asbtract ( 980 )   HTML ( 78)   PDF (959KB) ( 5298 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Behavior recognition is developing rapidly,and a number of behavior recognition algorithms based on deep network automatic learning features have been proposed.The deep learning method requires a large number of data to train,and requires higher computer storage and computing power.After a brief review of the current popular behavior recognition method based on deep network,it focused on the traditional behavior recognition methods.Traditional behavior recognition methods usually followed the processes of video feature extraction,modeling of features and classification.Following the basic process,the recognition process was overviewed according to the following steps,feature sampling,feature descriptors,feature processing,descriptor aggregation and vector coding.At the same time,the benchmark data set commonly used for evaluating the algorithm performance was also summarized.

Correspondences

Space-time coding scheme for the paired weak user in MIMO-NOMA systems

Mingyan GONG,Zhen YANG

2018, 39(6):  181-189.  doi:10.11959/j.issn.1000-436x.2018109

Asbtract ( 382 )   HTML ( 10)   PDF (1418KB) ( 981 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

In view of the paired weak user’s poor outage performance in multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems,Alamouti code was adopted to encode for the weak user in order to improve its outage performance by means of diversity,and the closed-form expression of the strong user’s ergodic capacity as well as the boundary-form expressions of the weak user’s ergodic capacity and outage probability was derived in the proposed model.Moreover,a power allocation algorithm for optimizing the system’s throughput was proposed.Finally,the numerical results show the accuracy of the derived expressions,the efficacy of the proposed algorithm,and that the weak user’s outage performance in the proposed coding scheme is far superior to that in the current coding scheme only adopting vertical Bell lab layered space-time (V-BLAST) code.

Kernelized correlation tracking based on point trajectories

Yunqiu LYU,Kai LIU,Fei CHENG

2018, 39(6):  190-198.  doi:10.11959/j.issn.1000-436x.2018097

Asbtract ( 391 )   HTML ( 9)   PDF (4245KB) ( 831 )   Knowledge map   

Figures and Tables | References | Related Articles | Metrics

Visual tracking is one of the most important directions in computer vision.However,many state-of-the-art algorithms cannot track the interested object reliably due to occlusion during tracking process,which leads to deficiency of object information.In order to solve occlusion problem,a kernelized correlation tracking method based on point trajectories was proposed.Through analyzing long-term motion cues of the local information,point trajectories were labeled by spectral clustering.These labeled points were used to differentiate the foreground and background objects and thus detect whether the target was occluded or drifts.If drifting and occlusion occur,re-detection was used to detect the re-entering of the target.Experimental results show that the proposed algorithm can handle occlusion and drifting problems effectively.