最新刊期
卷 48 ， 期 1 ， 2020
- 摘要：In the signature algorithm,once the private key of the signature is stolen, the adversary can forge the signature of the legal user arbitrarily, which will cause the rights of legal users to be infringed.In order to reduce the risk of signature private key leakage, a secure two-party SM2 digital signature algorithm is proposed in this paper. The private key of the signature is divided into two parts and each part of the private key is handed over to the different parties separately. The cryptographic techniques such as zero-knowledge proof, bit commitment and homomorphic encryption are used to ensure that only the legal users can generate the integrated SM2 signature.The integrated private key cannot be recovered individually. The security of the proposed scheme is proved under the universally composable security framework.Compared with the existing SM2 cooperative signature schemes, the proposed scheme has the advantages of fewer interactions and higher efficiency.关键词：digital signature;zero-knowledge proof;bit commitment;homomorphic encryption;provable security182|585|11更新时间：2025-07-08
- 摘要：Aiming at the problem of inaccurate estimation of out-of-step time and large computation in eigenvalue decomposition algorithm, the direct sequence spread spectrum (DS-SS) signal blind estimation problem of spread spectrum sequence is studied,and an algorithm based on improved propagator is proposed in this paper. The algorithm can estimate the spread spectrum sequence and the signal out-of-step time by using the signal subspace. Compared with the eigenvalue decomposition method, the estimation accuracy of the out-of-step time is improved and the amount of calculation is effectively reduced. Finally, the computational amount and performance of the algorithm are simulated and verified. The results show that the proposed algorithm is effective,the computational amount is far less than the eigenvalue decomposition algorithm, and the performance is better under the condition of low SNR.关键词：direct sequence spread spectrum (DS-SS);spread spectrum sequence;propagator method;eigenvalue;signal subspace113|360|3更新时间：2025-07-08
- 摘要：LEA cipher, a family of ARX lightweight block cipher, is widely used in resource-constrained environments. In this paper, we use the miss-in-the-middle technique to find 86 8-round zero-correlation distinguishers and 6 9-round zero-correlation distinguishers of LEA,and make use of the relationship between the zero-correlation distinguisher and the integral distinguisher to construct 5 8-round distinguishers and 1 9-round integral distinguishers. Based on 8-round integral distinguisher, integral attack on 10-round LEA-128 is implemented firstly by using the property of the key schedule and partial-sum technology, and the attack performs 2120 10-round LEA-128 encryptions.Besides, the integral attack against 11-round LEA-192 with computational complexity of 2185.02 11-round LEA-192 encryptions and the integral attack against 11-round LEA-256 with computational complexity of 2248 11-round LEA-256 encryptions are implemented.关键词：lightweight block cipher;LEA;zero-correlation distinguisher;integral attack98|234|1更新时间：2025-07-08
- 摘要：In the non-uniformly sampled systems, there are uncertainties and time-varying of the refresh time interval, which have caused great difficulties to design the system controller. To aim at these problems, the refresh time interval is regarded as the time delay variable, and the system dynamic changing processes in different time delays are characterized by the changing processes of different subsystems. The variety of different time delays is transformed into the switching between different sub-models. The non-uniformly sampled system is described as a class of discrete-time switched systems with finite subsystems. Under the condition of satisfying the average dwell time, the output feedback control method is used to guarantee the exponential stability of the closed loop non-uniformly sampled system. Finally, the effectiveness of the proposed method is demonstrated by the example of the non-uniformly sampled system.关键词：switched systems;non-uniform sampling;exponential stability;multi-sampling rates systems91|217|2更新时间：2025-07-08
- 摘要：Under traditional rule-based reasoning in smart environment, the inference engine deployed in gateway collects data from various sensors to match the rules, which undertakes whole reasoning work. In current research,we use Rete algorithm to construct an inference network by rules and then allocate the Rete inference nodes to smart nodes for collaborative reasoning based on fog computing, therefore, the allocation mechanism becomes crucial. In this paper, we utilize the regularity of rules triggered under the influence of activities to design an algorithm CoA (Clustering of Activity), which clusters activities and respectively constructs the inference networks,subsequently,we calculate the shortest path between smart nodes and substitute the results into AAoRN (Allocation Algorithm of Rete Inference Nodes), which is proposed to overcome hierarchical delay for optimally allocating each inference node. Theoretical analysis and experimental results show that the proposed mechanism efficiently utilizes the resources and has reduced the delay by about 55%.关键词：smart environment;rule-based reasoning;Rete algorithm;fog computing;activity pattern91|238|2更新时间：2025-07-08
- 摘要：In this paper, a new clustering algorithm with simultaneous feature selection is proposed, which is called iterative tighter nonparallel support vector clustering with simultaneous feature selection (IT-NHSVC-SFS). In learning with two nonparallel hyperplanes model,we use the iterative (alternating) optimization algorithm to achieve clustering, and at the same time introduce two types of regularizes,the Euclidean norm and the infinite norm, respectively. Euclidean norm clustering model is used to improve the generalization ability and the infinite norm actually fulfills implicit feature extraction for the two nonparallel hyperplanes in order to reduce data noises from irrelevant features, and the clustering precision of the model is guaranteed. We also introduce a set of bounding variables to avoid maximization operation of the infinite norm, converting the non-convex optimization problem into a quadratic convex optimization problem. Meanwhile, because the new model embodies the idea of "maximum margin", it has good generalization ability. IT-NHSVC-SFS chooses nonparallel hyperplanes SVM (NHSVM) as the basis of the algorithm model. Unlike TWSVM and its variant models, only a quadratic programming problem (QP problem) needs to be solved to get the two optimal hyperplane simultaneously. This property is helpful to design a synchronous feature selection process for two nonparallel hyperplanes. The new algorithm adds two sets of equality constraints in the constraint set of the original NHSVM model, which can avoid the inverse operation of two large matrices and reduce the computational complexity. In addition, in the IT-NHSVC-SFS model, the Laplacian loss function replaces the original hinge loss function in NHSVM to avoid premature convergence. Numerical experiments on a set of benchmark data sets show that IT-NHSVC-SFS algorithm performs better in terms of clustering accuracy than other existing clustering algorithms.关键词：clustering;feature selection;nonparallel hyperplane support vector machine;L-infinite norm94|233|0更新时间：2025-07-08
- 摘要：In the condition of the widespread nonlinear echo and the non-Gaussian noise environment,the performance of the adaptive algorithm in the traditional echo canceller is degraded, which leads to the decline of the echo cancellation effect. In this paper, aiming at this question, a collaborative functional link adaptive filtering echo cancellation method based on the minimum dispersion criterion is proposed.In this method, the weights of the linear and nonlinear functional expanded adaptive filters are updated by using a normalized minimum lp norm algorithm, and the output signals are cooperatively combined to eliminate the nonlinear echo. The simulation results show that the proposed method can achieve higher echo return loss enhancement in the presence of the α-stable distributed noise and the nonlinear echo.关键词：nonlinear echo;functional link;adaptive filtering;α-stable distribution noise70|167|6更新时间：2025-07-08
- 摘要：To realize high quality image classification with few labeled data, a graph-based semi-supervised PolSAR image classification method using deep neural networks is proposed in this paper. The PolSAR image is modeled as a graph,based on which we design an energy function which incorporates a semi-supervision term, a convolutional neural network (CNN) term and a pairwise smoothness term. CNN is responsible for extracting discriminative polarimetric features. The semi-supervision term enforces that class information of labeled pixels keep fixed during the classification. The pairwise smoothness term enforces class label smoothness. Started from an initialized class label map generated using superpixel segmentation of polarimetric PauliRGB image, the proposed method iteratively optimizes the energy function until the model converges. Experimental results conducted on two benchmark PolSAR images show that our approach effectively improves the classification accuracy with limited numbers of labeled pixels.关键词：polarimetric synthetic aperture radar (PolSAR) image classification;semi-supervised method;convolutional neural network (CNN);graph model131|359|3更新时间：2025-07-08
- 摘要：Remote sensing image detection and segmentation technology usually needs to extract image features and mine the deep features of images through deep learning algorithm. However, traditional imaging features (e.g., color, texture, spatial relationship) cannot fully reflect the semantic information of the images,while single/sequential algorithm cannot fully exploit the deep features and the contextual semantic information of the images. Aiming at the above challenges, in this paper, the spatial relation features are mapped into real dense vectors by word embedding, which are combined with color and texture features. Further, we propose a new parallel algorithm referred to as attention graph convolution networks and independently recurrent neural network (ATGIR) based on graph convolution network and independent recurrent neural network under attention mechanism for remote sensing image detection and segmentation. Our algorithm first assigns probabilistic weights to the combined features based on attention mechanism; then extracts deep features based on the features with high weights to generate labels with directions by using graph convolution network (GCNs) algorithms, extracts contextual semantic information of the images by using the independently recurrent neural network (IndRNN) algorithm; finally, our algorithm realizes image detection and segmentation by using Sigmoid.For remote sensing image detection and segmentation of populous euphratica forest as an instance, we prove that our feature extraction method and proposed ATGIR algorithm can effectively improve the detection and segmentation tasks.关键词：attention mechanism;GCNs;IndRNN;parallel algorithm;word embedding89|203|4更新时间：2025-07-08
- 摘要：Aiming at the problems of small target information loss caused by stride operation and large redundancy among multi-scale feature maps generated by serial structure in original additional feature extraction network (OAFEN) of SSD, a depthwise separable dilated convolution (DSDC) with small computation and large field of receptivity is proposed; then a parallel additional feature extraction network (PAFEN) with three independent subnetworks is designed by using five DSDCs. In upper subnetwork of PAFEN,two DSDCs are used to extract 19*19 and 3*3 feature maps. In intermediate subnetwork of PAFEN, one DSDC is used to extract 10*10 feature maps.In lower subnetwork of PAFEN, two DSDCs are used to extract 5*5 and 1*1 feature maps. The experimental results show that within the framework of SSD, PAFEN is superior to OAFEN in terms of mAP and detection time, and is suitable for ground small target detection tasks.关键词：Target Detection;SSD;depthwise separable convolution;dilated convolution;depthwise separable dilated convolution;parallel additional feature extraction network85|172|12更新时间：2025-07-08
- 摘要：Reversible steganography in encrypted domain is widely used in medical, cloud services, military, commercial and other fields. Aiming at the problems of encrypted domain information hiding algorithm, such as incomplete guarantee of reversibility, low embedding rate and incomplete separation, this paper proposed a separable and reversible steganography in encrypted domain. Firstly, the conditions and construction methods for the ergodic matrix of image encryption are given. The carrier image owner sets the key1 to construct the ergodic matrix and encrypts the plaintext image, the information embedder sets the key2, in order to achieve the goal of expectation interpolation, the number of embedding bits is determined according to the size of interpolation interval, and then the final interpolation is determined by the difference correction factor and secret information together, so that the final interpolation is close to the expectation interpolation to the maximum extent, ensuring the high quality of the encrypted image. There is no additional information, no data overflow and reversibility is guaranteed in the whole process, the two permissions do not interfere with each other, and the algorithm is completely reversible and separable, and the average embedding rate can reach 3 bit/pixel. The experimental results show that the algorithm is better than the other eight excellent algorithms in terms of embedding capacity, reversibility and separability.关键词：information security;reversible data hiding;encrypted domain;image interpolation;ergodic matrix54|147|6更新时间：2025-07-08
- 摘要：This paper presents algorithms for cryptographic algorithms mapping based on the coarse-grained reconfigurable cryptographic logic array. Due to a long mapping period and low performance for current algorithms mapping, we propose two methods to improve it. First, combine with the structural characteristics of the coarse-grained reconfigurable cryptographic logic array and cryptographic algorithms, an algorithm for data flow graph partitioning is proposed. By integrating the nodes into clusters to reduce the mapping complexity. Second, refer to the idea of machine learning, a smart ant colony optimization algorithm is proposed. By learning the training samples, the pheromone concentration matrix is continuously optimized and realizes the intelligentization of cryptographic algorithm mapping. The experimental results show that the proposed mapping method can reduce the compilation time by 37.9% and achieve the best performance. At the same time, the algorithm data flow graph is used as the mapping input, and the cryptographic algorithm map stream is automatically generated, which improves the cryptographic algorithm mapping more intuitive and convenient.关键词：coarse-grained;cryptographic;array;intelligent mapping;machine learning52|138|3更新时间：2025-07-08
- 摘要：With the expansion of graph scale, single-machine algorithms can hardly adapt to the sub-graph queries in large-scale data sets. As existing distributed algorithms are based on simple traversal without index, the join process is prone to memory overflow in the distributed algorithms and load imbalance occurs when the query graph distribution is abnormal. Therefore, a binary index tree based on spectral coding named SCBT-index is proposed. Firstly, for vertex spectrum coding in the data graph, a binary index tree is constructed according to the coding information. Then, the query graph is decomposed using the minimum query plan. Finally, three pruning strategies are used in the join process: Structure matching based on topological structure, serialized join and the distributed join optimization. The experimental results show the comprehensive performance of SCBT-index under the graph set is better than that of the popular algorithms. In addition, the query time under the single graph is 1/2 to 1/4 of that of the existing algorithms.关键词：spectral coding;Gini;subgraph query;subgraph index39|103|0更新时间：2025-07-08
- 摘要：In the long time tracking, object representation and occlusion handling are two important challenges. We propose a selective tracking and detection framework in which a new probabilistic object-enhanced feature is integrated. Firstly, we propose a foreground probability map to enhance the target and weaken the surrounding background. Secondly, we introduce the selective tracking and detection framework that has two sets of conditions to control the detector activation and final result selection. We have evaluated our methods on the popular benchmark OTB2013 dataset. The algorithm achieves an overall accuracy of 91.1% and a success rate of 67%, which demonstrates that our algorithm performs favorably compared with other state-of-the-art methods.关键词：foreground probability map;condition detection mechanism;tracking confidence;salient features72|301|8更新时间：2025-07-08
- 摘要：We research on cooperative information security transmitting using energy harvest amplify-and-forward relay in the wireless information and power transfer network with multiple eavesdroppers. Two low-complexity methods using zero-space beaforming technique are proposed. Using the prior location information of receiver or eavesdroppers, our methods project the target vector to the zero space of receiver or eavesdroppers. Computational complexity of the method is lower than that of classical method since space freedom of the target vector is reduced. Furthermore, second method induces the eavesdropper's mutual information of objective function to be zero, the original quasi-convex problem is transformed into a convex form. Thus, computational complexity of the method is apparently reduced compared with that of classical method. Result of experiment verify validity of our proposed methods.关键词：amplify-and-forward relay;secrecy communication;zero-space beamforming;wireless energy harvesting;power splitting47|170|2更新时间：2025-07-08
- 摘要：To accurately segment remote sensing image and automatically determine the number of classes,a Hierarchical Gaussian Mixture Model (HGMM) based remote sensing image segmentation algorithm with self-adaptive number of classes is proposed.In the proposed algorithm, HGMM is defined by the weighted sum of several Gaussian Mixture Models (GMM), which is used to model the asymmetric, heavy-tailed and multimodal distributions of image. Expectation Maximization (EM) is used to estimate the model parameters. Bayesian Information Criterion (BIC) is used to solve the optimal number of classes, where penalty term is defined by the weighted number of pixels. To test the feasibility and availability of the proposed algorithm, segmentation experiments are carried out on simulated and panchromatic remote sensing images. Segmentation results are analyzed qualitatively and quantitatively, which show that HGMM can accurately model the complicated statistical distributions. The proposed algorithm can obtain high accuracy and has good efficiency, as well as determine the optimal number of classes.关键词：high resolution remote sensing image segmentation;hierarchical Gaussian mixture model;Bayesian information criterion;self-adaptive number of classes;expectation maximization52|144|1更新时间：2025-07-08
- 摘要：Linear cryptanalysis is a powerful attack on block ciphers. To evaluate the security against linear cryptanalysis is one of the most important part for the security evaluation of block ciphers. In this paper, the concept of four-block CLEFIA-like transform cluster is put forward based on the background of practical application. Using the relation between linear approximations of two special block cipher structures, security evaluation against linear cryptanalysis for all block cipher structures of the cluster is given. Moreover, some open problems are given. We provide a novel idea for the security evaluation of block ciphers by using transform cluster to study block ciphers.关键词：block ciphers;four-block CLEFIA-like transform cluster;linear cryptanalysis;active round function52|136|5更新时间：2025-07-08
- 摘要：How to preserve users' privacy information and minimize the loss of information when publishing trajectory data has become an important topic in the research field of privacy preservation. In this paper, we propose a trajectory privacy-preserving method based on single point gain, which satisfies the privacy requirements of users. According to the single point gain values, we suppress location points or add dummy trajectories into the trajectory dataset to ensure that the maximum benefit can be achieved at each iteration, thus reducing the loss of information. Theoretical analysis and experimental results show that, in the case of high privacy tolerance or a large number of attackers, the proposed method effectively reduces the information loss rate while guaranteeing the intensity of privacy preserving.关键词：dummy trajectory;privacy preservation;single point gain;trajectory publication;trajectory suppression;problematic point pair99|136|2更新时间：2025-07-08
- 摘要：Many methods of differentailly private time series pattern mining have been proposed, while in those methods, the length of sequence pattern and Laplace noise directly constrain the utility of the mining results. To address the questions caused by the global query sensitivity and lower utility of the existing works, an efficient method,called PrivTSM (differentially Private Time Series Pattern Mining) is proposed, which is based on sequence lattice for mining time series pattern with differential privacy. This method relies on the longest path strategy to truncate the original database; based on the truncated database, this method uses the table join operation to construct a differentially private sequence lattice. Furthermore, this method uses the property of the sequence lattice structure itself to allocate privacy budget reasonably and boost the accuracy of the noisy counts. PrivTSM satisfies ε-differential privacy through theoretical analysis. The experimental results on real datasets show that the accuracy (TPR) and average relative error (ARE) of the PrivTSM are better than those of the N-gram and Prefix-Hybrid algorithms.关键词：differential privacy;time series;global sensitivity;data mining;data truncate;sequential lattice105|221|3更新时间：2025-07-08
- 摘要：In the cloud storage environment, the multiple copies are more popular. However, aiming at the problems of data dynamic operation and malicious cloud service provider attacks encountered in multi-copy data integrity audit, a multi-copy integrity audit scheme based on dynamic divide and conquer table (DDCT) is proposed. Firstly, the dynamic divide and conquer table is introduced to solve the problem of dynamic data operation, and the block number, version number and timestamp of the copy data are stored in the table. In order to resist the malicious cloud service provider attacks, a time-based replica data signature authentication algorithm is designed. Secondly, it proposes the concept of replica block including block header and block body. The block header stores the authenticated signature information which is based on timestamp, and the block body stores the encrypted data. Finally, the third-party auditing agency uses a replica timestamp-based signature authentication algorithm to audit the integrity of the multi-copy data. Through security analysis and experimental comparison, this solution protects data information from third-party auditors while effectively preventing malicious cloud service provider attacks.关键词：cloud storage;integrity;multiple copies;timestamp;data encryption;copy block;signature algorithm111|180|2更新时间：2025-07-08
- 摘要：The high-speed mobility of the nodes makes the network topology change frequently, and the transmission path can be easily interrupted, so the routing efficiency is lower in Vehicular ad hoc network (VANET). We present an adaptive routing method for high-speed-road scenario of the Internet of Vehicle in this paper. This method uses Greedy Opportunity Forwarding (GOF) algorithm to find the optimal forwarding node when the next hop forwarding node is selected and it takes into account the distance calculation of the destination node, the link state between the nodes and the effective node degree of the next hop. We propose a new method to calculate the probability of connectivity. The simulation results and tests of the actual high-speed-road scenario show that our RAR method has good performance in the stability of routing, which is compared with the relative algorithms.关键词：forwarding node;connectivity;internet of vehicle;self-adaptive;routing58|174|5更新时间：2025-07-08
- 摘要：Low-light images suffer from low visibility and poor visual quality. To improve the quality of low-light images, a method based on convolution analysis sparse representation and phase congruency was proposed. This method is based on the Retinex model and improves the problem of insufficient constraints.More concretely, we used the convolutional analysis sparse representation whose filters were hand-crafted and learned from the input to estimate the illumination image. Then, by using the monogenic phase congruency, the reflection image was calculated via the phase congruency residual minimization to enhance weak details. Through joint constraints and optimization, the resulting reflection image served as the final enhancement result.Experiments on a number of challenging low-light images are presented to reveal the efficacy of our method and show its superiority over several state-of-the-arts on both subjective and objective assessments.关键词：low-light image;Retinex model;convolutional analysis sparse representation;phase congruency59|207|4更新时间：2025-07-08
- 摘要：Faster-than-Nyquist (FTN) signaling,as a non-orthogonal signaling format,has been attracting a lot of attention recently. FTN signaling has a symbol rate that is higher than the Nyquist rate, which causes intersymbol interference inevitably. However, this signaling method has been proved to bring higher channel capacity. Therefore, FTN signaling has become a new bandwidth-efficient modulation method which offers a promising solution to the communication scenario with scarce bandwidth. Furthermore, faster-than-Nyquist signaling has also become a hot topic in the research of satellite communication and backhauling technique in 5G communication standard. This paper provides a summary of FTN signaling in terms of its concept and theory, capacity, implementation, detection, as well as performance and applications, respectively. Some discussions of current research difficulties are also given in the paper.关键词：faster-than-Nyquist signaling;channel capacity;detection method81|258|1更新时间：2025-07-08
- 摘要：In order to apply the polarization sensor to the real three-dimensional navigation, an integrated navigation control system was designed based on the bionic polarized light navigation sensor, micro inertial measurement unit (MIMU) and global positioning system (GPS), and was applied to the quadrotor navigation control. Firstly, the functional model and angle measurement principle of the polarization sensor was presented. Then,the extended Kalman filter (EKF) technology was used to design the information fusion algorithm of the polarization sensor, MIMU and GPS. The performance of the navigation system was validated by an outdoor flight experiment and was compared with the traditional MIMU/GPS/compass navigation system. The results show that the mean position accuracy of the navigation system based on polarized light is 50.4% higher than that of the traditional navigation system in the presence of magnetic interference. It is indicated that the polarized light navigation control system has good real-time performance, high precision, strong anti-electromagnetic interference capability and the error does not accumulate over time, which can meet the accuracy and reliability requirements when the mobile carrier implements autonomous navigation.关键词：polarization sensor;quadrotor;navigation;extended Kalman filter (EKF)59|159|6更新时间：2025-07-08
- 摘要：Secure multiparty computation is one focus in the international cryptographic community in recent years. The private computation of multisets is also of great practical significance. In order to privately compute on multisets,we first propose two new encoding schemes. Then based on Paillier probabilistic encryption algorithm, we design three simple and efficient secure two party protocols to compute the intersection, the union and the summation of two private multisets. We prove that they are secure in the semi-honest model. We also analyze the computational complexities and communication complexities of the protocols and test the efficiency on a PC. The test result shows that our protocols are efficient.关键词：cryptography;secure two-party computation;multiset;homomorphic encryption;encoding scheme76|173|5更新时间：2025-07-08
- Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09064830号-19
京公网安备11010802024621 - It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
- Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
0