Time filter

Source Type

Yan L.,Beijing University of Technology | Yan L.,Beijing Key Laboratory of Trusted Computing | Yan L.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | Zhang J.,Beijing University of Technology | And 3 more authors.
Beijing Gongye Daxue Xuebao/Journal of Beijing University of Technology | Year: 2017

The risk of the key authentication information being bypassed and the potential safety hazard of booting data being tampered with both exist in the booting mechanism of the traditional operating system. Based on the theory of trusted computing, combined with the technology of smart card with CD-ROM file system, a scheme of trusted boot based on general smart card was proposed. Without changing the structure of hardware and firmware of the smart card and terminal device, through the transformation of storage data in the smart card and disk booting data, the security objective of binding the user's identity information, the smart card and the terminal device were achieved. The trusted computing mechanism was extended from power on to the application layer to ensure that the initial state of operating system was trustworthy. Through the analysis of security and performance, the security of terminal device bootstrap was proven, which has been verified in practical applications. © 2017, Editorial Department of Journal of Beijing University of Technology. All right reserved.


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 4 more authors.
Information Sciences | Year: 2016

We investigate the application of quantum cellular automata in image encryption and propose a novel quantum gray-scale image encryption algorithm based on one-dimensional quantum cellular automata. The quantum image encryption algorithm can be realized by subtly constructing the evolution rules of one-dimensional quantum cellular automata. Because all quantum operations are invertible, the quantum image decryption algorithm is the inverse of the encryption algorithm. The proposed quantum image encryption algorithm has an algorithm complexity of Θ(n), lower than the algorithm complexity, Θ(n2) of existing quantum image encryption schemes based on quantum Fourier transform. Supported by detailed numerical simulation and theoretical analysis, our proposal has outperformed its classical counterpart and other image encryption schemes in terms of the security, computational complexity, and robustness. And it also provides a clue of introducing quantum cellular automata into image encryption. © 2016 Elsevier Inc. All rights reserved.


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 4 more authors.
Quantum Information Processing | Year: 2016

Cluster states can be exploited for some tasks such as topological one-way computation, quantum error correction, teleportation and dense coding. In this paper, we investigate and propose an arbitrated quantum signature scheme with cluster states. The cluster states are used for quantum key distribution and quantum signature. The proposed scheme can achieve an efficiency of 100 %. Finally, we also discuss its security against various attacks. © 2016, Springer Science+Business Media New York.


Jiang N.,Beijing University of Technology | Jiang N.,Purdue University | Jiang N.,Beijing Key Laboratory of Trusted Computing | Jiang N.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 3 more authors.
Quantum Information Processing | Year: 2016

Quantum image processing (QIP) means the quantum-based methods to speed up image processing algorithms. Many quantum image processing schemes claim that their efficiency is theoretically higher than their corresponding classical schemes. However, most of them do not consider the problem of measurement. As we all know, measurement will lead to collapse. That is to say, executing the algorithm once, users can only measure the final state one time. Therefore, if users want to regain the results (the processed images), they must execute the algorithms many times and then measure the final state many times to get all the pixels’ values. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image matching algorithm. Unlike most of the QIP algorithms, our scheme interests only one pixel (the target pixel) instead of the whole image. It modifies the probability of pixels based on Grover’s algorithm to make the target pixel to be measured with higher probability, and the measurement step is executed only once. An example is given to explain the algorithm more vividly. Complexity analysis indicates that the quantum scheme’s complexity is (Formula presented.) in contradistinction to the classical scheme’s complexity (Formula presented.), where m and n are integers related to the size of images. © 2016 Springer Science+Business Media New York


Jiang N.,Beijing University of Technology | Jiang N.,Purdue University | Jiang N.,Beijing Key Laboratory of Trusted Computing | Jiang N.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 2 more authors.
International Journal of Theoretical Physics | Year: 2016

Quantum image processing has been a hot topic as a consequence of the development of quantum computation. Many quantum image processing algorithms have been proposed, whose efficiency are theoretically higher than their corresponding classical algorithms. However, most of the quantum schemes do not consider the problem of measurement. If users want to get the results, they must measure the final state many times to get all the pixels’ values. Moreover, executing the algorithm one time, users can only measure the final state one time. In order to measure it many times, users must execute the algorithms many times. If the measurement process is taken into account, whether or not the algorithms are really efficient needs to be reconsidered. In this paper, we try to solve the problem of measurement and give a quantum image location algorithm. This scheme modifies the probability of pixels to make the target pixel to be measured with higher probability. Furthermore, it only has linear complexity. © 2016 Springer Science+Business Media New York


Yan L.,Beijing University of Technology | Yan L.,Beijing Key Laboratory of Trusted Computing | Yan L.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | Zhang J.,Beijing University of Technology | And 2 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2016

The trusted boot is a hot spot in trusted computing field. User’s identity authentication and trusted measurement are used to deal with security threats. But it is difficult to implement the general trusted boot based on hardware, which can be bypassed easily by software. In order to solve the above problem, a scheme of trusted boot is presented based on the universal smart card. It does not change the hardware and the firmware of the smart card and the terminal device. The core method combines user’s identity authentication with trusted measurement. It binds user’s identity, smart card and terminal device to ensure the trusted boot of terminal device. The trusted computing mechanism can be extended from power on to the application layer. Ultimately, experiments prove the security of boot and simplification of the implementation. © Springer International Publishing Switzerland 2016.


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 4 more authors.
Quantum Information Processing | Year: 2015

All existing quantum oblivious transfer protocols can be achieved when all the members have to be quantum. So what will happen if not all the members are quantum? In this paper, we propose two novel protocols for all-or-nothing oblivious transfer and one-out-of-two oblivious transfer respectively by using single qubit states. Our contribution lies in the fact that the message receiver Bob can use fewer quantum resources so that our protocols relax the requirements of protocol implementation in practice. We analyze the security of the protocols and prove that they are secure against Bob who even has the quantum attack capability. © 2015, Springer Science+Business Media New York.


Yang Y.-G.,Beijing University of Technology | Yang Y.-G.,Chinese Academy of Sciences | Yang Y.-G.,Beijing Key Laboratory of Trusted Computing | Yang Y.-G.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 2 more authors.
Optik | Year: 2015

Image matching, also known as correspondence problem, can be defined as the establishment of the cor-respondence between two or more digital images depicting at least partly the same scene. In this paper,we propose a method for matching gray-scale images consisting of quantum information. Quantum tem-plate image is directly mapped with quantum reference image, i.e., the quantum register representingeach corresponding pixel of the quantum template image is subtracted from that of the quantum refer-ence image by running a quantum subtracter. According to the quantum measurement results, we cansave the gray-scale difference and sum all the differences. Then we compare the sum with Tolerancevalue. If the sum is smaller than Tolerance value, then quantum image matching succeeds. Experimen-tal simulations show that the proposed approach can distinguish any two quantum gray-scale imagessuccessfully. Compared to the schemes based on flexible representation of quantum images (FRQI), ourapproach based on novel enhanced quantum representation of digital images (NEQR) has the advantagesof retrieving the original classical image accurately from the quantum image so that it can be generalizedto the case where the dimension of quantum template image is smaller than that of quantum referenceimage. © 2015 Elsevier GmbH. All rights reserved.


Lin L.,Beijing University of Technology | Lin L.,Beijing Key Laboratory of Trusted Computing | Lin L.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | Ni J.,Beijing University of Technology | And 6 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2016

With the rapid development of Android-based smart phones and pads, android applications show explosive growth. Because third-party application market regulation is lax, many normal applications are embedded malicious code and then many security issues occur. The existing antivirus software cannot intercept malicious behaviors from those repackaged applications in many cases. To solve these problems, we propose a new method called RbacIP, which integrates RBAC into intercept and disposal process of malicious android applications. In RbacIP, the malicious behaviors of applications are monitored by inserting Linux kernel function call dynamically. Exploiting the Netlike technology, the information of malicious behaviors are feedback from the kernel layer to the user layer. On the user layer, depending on the roles assigned, android applications are authorized to the corresponding permissions. According to the characteristics of RBAC, it can achieve the minimum authorization for malicious applications. Meanwhile, to balance the user experience and his privacy protection needs, users are allowed to make fine-grained decision based on RBAC policy, rather than permit or prohibit. Finally, we implemented RbacIP in real android platform. Comprehensive experiments have been conducted, which demonstrate the effectiveness of the proposed method by the comparison with traditional HIPS systems at the malicious programs detection performance and resource consumption. © Springer International Publishing Switzerland 2016.


Duan L.,Beijing University of Technology | Duan L.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | Ge H.,Beijing University of Technology | Ge H.,National Engineering Laboratory for Critical Technologies of Information Security Classified Protection | And 3 more authors.
Bio-medical materials and engineering | Year: 2015

This paper aims to solve automated feature selection problem in brain computer interface (BCI). In order to automate feature selection process, we proposed a novel EEG feature selection method based on decision tree (DT). During the electroencephalogram (EEG) signal processing, a feature extraction method based on principle component analysis (PCA) was used, and the selection process based on decision tree was performed by searching the feature space and automatically selecting optimal features. Considering that EEG signals are a series of non-linear signals, a generalized linear classifier named support vector machine (SVM) was chosen. In order to test the validity of the proposed method, we applied the EEG feature selection method based on decision tree to BCI Competition II datasets Ia, and the experiment showed encouraging results.

Loading National Engineering Laboratory for Critical Technologies of Information Security Classified Protection collaborators
Loading National Engineering Laboratory for Critical Technologies of Information Security Classified Protection collaborators