Efficient strong privacy protection and transferable attribute-based ticket scheme by Huamin FENG, Rui SHI, Feng YUAN, Yanjun LI, Yang YANG

“…To solve the problems of efficiency, flexibility, and privacy protection faced by electronic tickets, an efficient and transferable attribute-based ticket scheme with strong privacy protection was proposed.Firstly, a ticket issuing algorithm based on attribute disclosure was constructed by combining attribute-based credentials and set commitment.Secondly, the structure-preserving signature on equivalence class and dynamic malleable signature were used to reduce the computational complexity of the ticket issuance, and the ticket transfer and ticket verification with constant complexity were realized.In addition, to prevent the possibility of malicious verifiers guessing user information according to the seller’s identity, the scheme not only realized the anonymity of the user, but also realized the anonymity of the seller in the ticket verification for the first time.Finally, the security definition of the scheme was given, and its security was reduced to either well-known complexity cryptography assumptions or the security of proven cryptography primitives.Comparison and experimental results demonstrate that the proposed scheme is flexible and efficient.…”
Get full text

Physical-layer security transmission method based on spatial modulation with finite alphabet inputs by Bo CUI, Lu LIU, Xiang-yu LI, Liang JIN

“…Addressing the problem of wireless physical layer security transmission for finite alphabet input systems,a spatial modulation secure transmission method is proposed.On the basis of information theory,the method utilizes the receive antenna indices of multiple-input multiple-output (MIMO) system to bear information,and randomizes the eavesdropper’s equivalent channel by switching the receive antennas,which can guarantee physical layer security transmission.First,the different receiving performances of the legitimate user and eavesdropper are analyzed in the spatial modulation secure transmission system.Second,the mutual information and secrecy mutual information of the transmission system are calculated,and two sufficient conditions that ensure positive secrecy mutual information are pointed out.Finally,an estimation algorithm of mutual information is provided.Moreover,the symmetry of finite alphabet set is exploited to decrease the computational complexity.Theoretical analysis and numerical simulation results verify the availability of the security transmission method.…”
Get full text

Verifiable access control scheme based on unpaired CP-ABE in fog computing by Jiangtao DONG, Peiwen YAN, Ruizhong DU

“…Fog computing extends computing power and data analysis applications to the edge of the network, solves the latency problem of cloud computing, and also brings new challenges to data security.Attribute encryption based on ciphertext strategy (CP-ABE) is a technology to ensure data confidentiality and fine-grained access control.The excessive computational overhead of bilinear pairing restricts its application and development.In response to this, a verifiable access control scheme was proposed based on unpaired CP-ABE in fog computing.In order to make CP-ABE more efficient, simple scalar multiplication in elliptic curve encryption was used to replace bilinear pairing, thereby reducing the overall computational overhead.Decryption operations were outsourced to fog nodes to reduce user computational complexity, and based on the tamper-proof and traceable characteristics of the blockchain, the correctness of the access transaction was verified and the access authorization process was recorded.Security and performance analysis shows that the scheme is safe under the elliptic curve decision-making DBDH (Diffie-Hellman) assumption, and the calculation efficiency is higher.…”
Get full text

Programmed Tool for Quantifying Reliability and Its Application in Designing Circuit Systems by N. S. S. Singh

“…However, the process of computing reliability has become very time consuming and troublesome as the computational complexity grows exponentially with the dimension of circuit systems. …”
Get full text

A Combined ESPRIT-MUSIC Method for FDA-MIMO Radar with Extended Range Ambiguity Using Staggered Frequency Increment by Yuwei Song, Guimei Zheng, Guoping Hu

“…For the problem of joint angle and range estimation with frequency diverse array (FDA), MIMO radar, staggered frequency increment is proposed to expand the range ambiguity and the joint algorithm of ESPRIT and MUSIC is proposed to reduce the computational complexity. The uniformly weighted beampattern of FDA is a SINC-like function. …”
Get full text

Covariance matrix opportunistic cooperative spectrum sensing of high detection probability by Shunlan LIU, Jing WANG, Jianrong BAO

“…Moreover, the proposed algorithm has high energy efficiency as well as the moderate computational complexity, so it is especially suited for the spectrum cognition applications in the new generation wireless communication.…”
Get full text

A peak-to-average power ratio reduction method for mixed-numerology multi-carrier systems by Nan SHI, Xiaoran LIU, Jun XIONG, Xiaoying ZHANG, Jibo WEI

“…In order to support diverse service demands of communication scenarios, 5G adopts the mixed-numerology system based on orthogonal frequency division multiplexing (OFDM).The mixed-numerology systems still have the problem of high peak-to-average power ratio (PAPR).Furthermore, its design structure makes it difficult to apply traditional PAPR suppression methods straight forwardly, in which mixed signals are generated by superimposing multiple sub-signals with different parameters.An optimization model for minimizing PAPR in mixed-numerology systems was established based on tone reservation method.Utilizing the characteristic of single-peak of time-domain kernel, the multiple copies were generated in different numerologies based on the peak position of the mixed signal.The mixed time-domain kernel was then superimposed to reduce the peaks of the mixed signal.Since the proposed algorithm didn’t require inverse fast Fourier transform (IFFT)/ fast Fourier transform (FFT) operations during iteration, it had relatively low computational complexity.Simulation results show that the proposed algorithm effectively reduces the PAPR of mixed signals.…”
Get full text

Fast Block Partitioning Algorithm for HEVC Based on Spatial Correlation and Image Texture by Yingbiao Yao, Xiaojuan Li

“…Compared with HM13.0, experimental results reveal that the proposed algorithm can save about 20% computational complexity on average whereas the average bit rate increment is 0.84% and the decrement of PSNR is 0.04 dB.…”
Get full text

Low-Complexity Online Synthesis for AMIDAR Processors by Stefan Döbrich, Christian Hochberger

“…In this paper, we show that even a relative simplistic synthesis approach with low computational complexity can have a strong impact on the performance of compute intensive applications.…”
Get full text

Analysis the self-similarity of network traffic in fractional Fourier transform domain by Tong GUO, Ju-long LAN, Wan-wei HUANG, Zhen ZHANG

“…Statistical characteristics of network traffic data in FrFT domain were analyzed,which indicates the self-simi-larity feature.Further,Hurst parameter estimation methods based on modified ensemble empirical mode decomposi-tion-detrended fluctuation analysis (MEEMD-DFA) and adaptive estimator with weighted least square regression (WLSR) were presented,which aimed at displaying network traffic in “time” or “frequency” domain of FrFT domain separately.Experimental results demonstrate that the MEEMD-DFA method has more accurate estimate precision but higher com-putational complexity than existing common methods.The overall robustness of adaptive estimator is more satisfactory than that of the other methods in simulation,while it has lower computational complexity.Thus,it can be used as a real-time online Hurst parameter estimator for traffic data.…”
Get full text

Malicious domain name detection method based on associated information extraction by Bin ZHANG, Renjie LIAO

“…To improve the accuracy of malicious domain name detection based on the associated information, a detection method combining resolution information and query time was proposed.Firstly, the resolution information was mapped to nodes and edges in a heterogeneous information network, which improved the utilization rate.Secondly, considering the problem of high computational complexity in extracting associated information with matrix multiplication, an efficiency breadth-first network traversal algorithm based on meta-path was proposed.Then, the query time was used to detect the domain names lacking meta-path information, which improved the coverage rate.Finally, domain names were vectorized by representation learning with adaptive weight.The Euclidean distance between domain name feature vectors was used to quantify the correlation between domain names.Based on the vectors learned above, a supervised classifier was constructed to detect malicious domain names.Theoretical analysis and experimental results show that the proposed method preforms well in extraction domain name associated information.The coverage rate and F1 score are 97.7% and 0.951 respectively.…”
Get full text

Improved integral attack——random linear distinguish and key recovery attack by Shaoyu DU

“…Based on the integral attack and collision attack of four rounds of AES, a random linear distinguish attack against four rounds of SP block ciphers was proposed, which took advantage of the non-uniformity of linear biases’ distribution between some blocks of plaintext and inner state.Combined with precomputation, a key recovery attack against four rounds of AES-like block ciphers was proposed.For LED-64, the results of distinguish attack and key recovery attack were given.Therein for LED-64 of 1-Step, the probability of successful distinguish attack is 85% under the condition that the data complexity is 2⁸ and the computational complexity is 2¹⁶ basic operation.For LED-64 of 2-Step, the calculation complexity of the key recovery attack under the condition of related key is 2¹⁴ basic operation, the data complexity is 2⁸, and the precomputation storage complexity is 2³⁸ half bytes.…”
Get full text

Fast two dimensional to three dimensional registration of fluoroscopy and CT-scans using Octrees on segmentation maps by Luca Bertelli, Frédéric Gibou

“…The DRR generation process is the bottleneck of any three dimensional to two dimensional registration system, since its computational complexity scales with the number of voxels in the Computed Tomography Data, which can be of the order of tens to hundreds of millions. …”
Get full text

Enhanced YOLOv5s for PCB Defect Detection with Coordinate Attention and Internal Convolution by Zhijun Xiao

“…This model aims to improve the detection accuracy of small defects while reducing computational complexity. Experiments on the PCB defect dataset demonstrate that the proposed CA-CBAM-IOYOLOv5s model achieves higher accuracy (97.8%), recall (98.6%), and F1 score (98.3%) compared to the basic YOLOv5s and other state-of-the-art models. …”
Get full text

Perfect space-time block codes and high performance decoding algorithm by HU Jun-feng1, YANG Yuan1, ZHANG Hai-lin1

“…Based on the structure of perfect space-time block codes（STBC）,an equivalent vertical Bell Laboratories layered space-time（V-BLAST） decoding model was given.Minimum mean-square error decision feedback equalizer（MMSE-DFE） was used to preprocess this model and a decoder with boundary controlled Fano tree search algorithm was proposed.This decoder achieves almost maximum likelihood（ML） decoding performance and applies for any antenna configurations.For a wide range of signal-to-noise ratio（SNR）,the decoder has lower computational complexity than that of previously proposed near-ML decoders.Operating in complex number field,the decoder is robust for any constellations.The decoder can apply for any multi-input multi-output（MIMO） systems that can be transformed into an equivalent V-BLAST model.Simulation results demonstrate the excellent performance of the proposed decoder.…”
Get full text

Scalable Alternating Projection and Proximal Splitting for Array Pattern Synthesis by Yubing Han, Chuan Wan

“…Finally, the selection of the weighted matrix and computational complexity are discussed briefly. Several typical linear and planar synthesis examples with or without the embedded element patterns are provided to demonstrate the effectiveness and power of the proposed method.…”
Get full text

An Efficient 2-D DOA Estimation for a Cylindrical Conformal Array with Unknown Mutual Coupling by Chao Liu, Shunian Yin

“…The proposed method can well calibrate the mutual coupling effect of a cylindrical array with a low computational complexity. The final simulation results corroborate our analysis.…”
Get full text

Low complexity acquisition algorithm for GPS signals with low SNR and high dynamic by Zhu-lin XIONG, Ce-lun LIU, Jian-ping AN, Ze-bin XIE

“…The results show that compared with the traditional periodogram algorithm, the proposed algorithm has much lower computational complexity and a little performance loss.…”
Get full text

Deep Learning-Based Prediction of Physical Stability considering Class Imbalance for Amorphous Solid Dispersions by Hanbyul Lee, Junghyun Kim, Suyeon Kim, Jimin Yoo, Guang J. Choi, Young-Seob Jeong

“…Furthermore, it significantly reduces the computational complexity of both training and test processes.…”
Get full text

Blind data recovery of single-channel mixed signals based on Turbo equalization and channel estimation by Dong-ling ZHANG, Yong YANG, Jing LI, Lin-dong GE

“…The timing synchronization is the key technique of the single-channel blind signal receiver.The single-channel blind recovery algorithm based on Turbo equalization was proposed,which does not require the timing synchronization.In the algorithm,the timing offset is taken as inter-symbol interference channel,which can improve the restorability of source signals by the feedback soft information between channel estimation and the turbo equalization.The primary works include the research on initial blind equalization algorithm,the channel estimation algorithm,MMSE equalization algorithm for the mixed signals and the soft information interaction among those three algorithms.The proposed algorithm has low computational complexity and small computational load,which can be applied to high-order modulated signals.Simulation results show that,good performance could be achieved for BPSK,QPSK and 8PSK modulated signals.In addition,the proposed algorithm is suitable for both equal power and unequal power signals.…”
Get full text