High Security Identity Tags Using Spiral Resonators

A highly compact chipless tag based on Frequency coding technique using Spiral Resonators is proposed in this paper.Spirals are well known metamaterial structures and thus capable of sharp resonance,and hence Spiral Resonators can serve as a good candidate for RF Identity Tags.The bit capacity of the proposed tag is 10 bits per sqcm.The prototype of the tag is fabricated on a low-cost substrate of dielectric constant 4.4 and loss tangent 0.02.The overall dimension of tag is 15.4 x 3 x 1.6mm3.Two methods for reading the tags are also discussed in this paper.Scope for bit enhancement is also provided.

Design of secure operating systems with high security levels

Numerous Internet security incidents have shown that support from secure operating systems is paramount to fighting threats posed by modern computing environments. Based on the requirements of the relevant national and international standards and criteria, in combination with our experience in the design and development of the ANSHENG v4.0 secure operating system with high security level （hereafter simply referred to as ANSHENG OS）, this paper addresses the following key issues in the design of secure operating systems with high security levels： security architecture, security policy models, and covert channel analysis. The design principles of security architecture and three basic security models： confidentiality, integrity, and privilege control models are discussed, respectively. Three novel security models and new security architecture are proposed. The prominent features of these proposals, as well as their applications to the ANSHENG OS, are elaborated. Cover channel analysis （CCA） is a well-known hard problem in the design of secure operating systems with high security levels since to date it lacks a sound theoretical basis and systematic analysis approach. In order to resolve the fundamental difficulties of CCA, we have set up a sound theoretical basis for completeness of covert channel identification and have proposed a unified framework for covert channel identification and an efficient backward tracking search method. The successful application of our new proposals to the ANSHENG OS has shown that it can help ease and speedup the entire CCA process.

A hybrid biometric identification framework for high security applications

Research on biometrics for high security applica- tions has not attracted as much attention as civilian or foren- sic applications. Limited research and deficient analysis so far has led to a lack of general solutions and leaves this as a challenging issue. This work provides a systematic analy- sis and identification of the problems to be solved in order to meet the performance requirements for high security applica- tions, a double low problem. A hybrid ensemble framework is proposed to solve this problem. Setting an adequately high threshold for each matcher can guarantee a zero false accep- tance rate （FAR） and then use the hybrid ensemble framework makes the false reject rate （FRR） as low as possible. Three ex- periments are performed to verify the effectiveness and gener- alization of the framework. First, two fingerprint verification algorithms are fused. In this test only 10.55% of fingerprints are falsely rejected with zero false acceptance rate, this is sig- nificantly lower than other state of the art methods. Second, in face verification, the framework also results in a large re- duction in incorrect classification. Finally, assessing the per- formance of the framework on a combination of face and gait verification using a heterogeneous database show this frame- work can achieve both 0% false rejection and 0% false accep- tance simultaneously.

Secured Data Transmission Using Modified LEHS Algorithm in Wireless Sensor Network

In the ancient block Hill cipher, the cipher text is obtained by multiplying the blocks of the plain text with the key matrix. To strengthen the keymatrix, a double guard Hill cipher was proposed with two key matrices, a private key matrix and its modified key matrix along with permutation. In the ancient block Hill cipher, the cipher text is obtained by multiplying the blocks of the plain text with the key matrix. To strengthen the key matrix, a double guard Hill cipher was proposed with two key matrices, a private key matrix and its modified key matrix along with permutation. In this paper a novel modification is performed to the double guard Hill cipher in order to reduce the number of calculation to obtain the cipher text by using non-square matrices. This modified double guard Hill cipher uses a non-square matrix of order (p × q) as its private keymatrix.

Single-Cycle Bit Permutations with MOMR Execution

Secure computing paradigms impose new architectural challenges for general-purpose processors. Cryptographic processing is needed for secure communications, storage, and computations. We identify two categories of operations in symmetric-key and public-key cryptographic algorithms that are not common in previous general-purpose workloads： advanced bit operations within a word and multi-word operations. We define MOMR （Multiple Operands Multiple Results） execution or datarich execution as a unified solution to both challenges. It allows arbitrary n-bit permutations to be achieved in one or two cycles, rather than O（n） cycles as in existing RISC processors. It also enables significant acceleration of multiword multiplications needed by public-key ciphers. We propose two implementations of MOMR： one employs only hardware changes while the other uses Instruction Set Architecture （ISA） support. We show that MOMR execution leverages available resources in typical multi-issue processors with minimal additional cost. Multi-issue processors enhanced with MOMR units provide additional speedup over standard multi-issue processors with the same datapath. MOMR is a general architectural solution for word-oriented processor architectures to incorporate datarich operations.