An Identity-Based Strong Designated Verifier Proxy Signature Scheme

In a strong designated verifier proxy signature scheme, a proxy signer can generate proxy signature on behalf of an original signer, but only the designated verifier can verify the validity of the proxy signature. In this paper, we first define the security requirements for strong designated verifier proxy signature schemes. And then we construct an identity-based strong designated verifier proxy signature scheme. We argue that the proposed scheme satisfies all of the security requirements.

Threshold Subliminal Channel Based on Designated Verifier Signature

The subliminal channel is used to send a secret message to an authorized receiver; the message cannot he discovered by any unauthorized receivers. Designated verifier signature （DVS） provide authentication of a message, we design a DVS scheme with message recovery mechanism and use it as a subliminal channel. In order to share a message among n users securely and allows t or more users can reconstruct the secret in dynamic groups, we combine both subliminal channel and （t, n） threshold cryptography. Then we proposed a threshold subliminal channel which can convey a subliminal message to a group of users based on message-recovery designated verifier signatures. Reconstructing the subliminal message relies on the cooperation of t or more users in the group and they can verify the validity of the subliminal message. Security and performance analysis show that the proposed scheme is secure and efficient.

Certificateless universal designated verifier signature schemes

Universal designated verifier signature schemes allows a signature holder to designate the signature to a desire designated verifier, in such a way that only designated verifier can verify this signature, but is unable to convince anyone else of this fact. The previous constructions of universal designated verifier signature rely on the underlying public key infrastructure, that needs both signers and verifiers to verify the authenticity of the public keys, and hence, the certificates are required. This article presents the first model and construction of the certificateless universal designated verifier signature scheme, in which the certificates are not needed. The proposed scheme satisfies all the requirements of the universal designated verifier signature in the certificateless system. Security proofs are provided for the scheme based on the random oracle model, assuming that the Bilinear diffie-hellman （BDH） problem is hard to solve.

Cloud data auditing with designated verifier

An auditing scheme is a good way to prove owner＇s data outsourced to the cloud are kept intact, and a scheme capable of giving public verifiability service is a good option that some researchers have managed to build for the last few years. However, in a public auditing scheme everybody does verification of data and a possibility of leaking some secrete information to the public verifiers is an issue that data owners are unhappy with this scenario. For example, the data owner does not want anybody else to know he has the data stored in the cloud server. Motivated by the issue of privacy associated with public auditing system, we proposed a designated verifier auditing （DVA） scheme based on Steinfeld et al.＇s universal designated verifier （DV） signature scheme. Our DVA scheme authorizes a third party auditor with private verification capability. It provides private verification because the scheme involves private key of the verifier. Moreover, we present the batch auditing scheme to improve auditing efficiency. Through rigorous security analysis we showed that our scheme is provably secure in the random oracle model assuming that the computational Diffie-Hellman （CDH） problem is hard over the group of bilinear maps.

A short non-delegatable strong designated verifier signature

A non-delegatable strong designated verifier signature （NSDVS） enforces verification of a signature by a designated verifier only. The concept is useful in various commercial cryptographic applications such as copyright protection, e-voting, and e-libraries. This paper reports the shortest NSDVS so far that consists of only two elements. The scheme is inspired by an identification scheme and Cramer et al.＇s OR-proof technique where a prover can prove that he knows at least one out two secrets. It is solidified by a symmetric key based group to group encryption algorithm. Two implementations of the algorithm are reported. The scheme is provably secure with respect to its properties of unforgeability, non-transferability, privacy of signer＇s identity, and non-delegatability.

Two t-out-of-n Oblivious Transfer Schemes with Designated Receiver

Oblivious transfer （OT） protocol is a fundamental cryptographical tool and widely used as a building block of secure computation. In this work, we propose two efficient t-out-of-n oblivious transfer schemes with the designated receiver. A common advantage of the two schemes is efficient. The total computation cost of the sender and the receiver is n ＋ 2t ＋ 1 modular exponentiations in first scheme that is three-round, and the total one of the sender and receiver is n ＋ 3t modular exponentiations in second scheme that is two-round. Another advantage of both schemes is designable.

Universal Designated Multi Verifier Signature Scheme without Random Oracles

In this paper, we re-formalize the security notions of universal designated multi verifier signature （UDMVS） schemes. Then the first UDMVS scheme is presented in the standard model （i.e. without random oracles） based on Waters＇ signature scheme. In this setting, a signature holder can to designate the signature to multi verifiers. Moreover, the security of our proposed scheme is based on the Gap Bilinear Difffie-Hellman assumption.

Deployment of Effective Testing Methodology in Automotive Software Development

Software development in automotive industry has bestowed greater comforts and conveniences to mankind. A remarkable progress in this field often faces a setback due to minor defects in the software. So there is recurring need for standardization and implementation of testing strategies. But the process of creation of test scripts to check if the software created complies with its specifications and requirements is both time- and resource-consuming. Generating a short but effective test suite usually requires a lot of manual work and expert knowledge. Patronizing research work in this field is the need of the hour. This paper solves the problem by using Model-Based Testing where test harness and evaluation are performed economically through automation. Simulink Design Verifier and Reactis are the tools used to carry out this purpose in Adaptive Front Light System. The resulting outputs obtained from Simulink Design Verifier and Reactis using Model-Based Testing prove that short test suites can be generated for the model where full model coverage can be achieved easily through automation. The outputs of these test cases when compared with the expected outputs confirm that the model developed is working as per the requirements.

New concurrent digital signature scheme based on the computational Diffie-Hellman problem

Based on strong designated verifiers signatures,a new fair concurrent signature scheme is proposed. Compared with the previous concurrent signature schemes,even if a keystone must be chosen by the initial signer,the matching signer will easily get the keystone through an extraction algorithm. Due to the property of strong designate verifying,the initial signer couldn＇t make use of the keystone prepared carefully to deceive the matching signer. Then the matching signer is able to participate actively the signature scheme. Besides,there aren＇t bilinear operations in the keystone algorithm to deliver the keystone efficiently. Therefore the efficiency of our signature scheme is also improved.

SEVERAL CRYPTOGRAPHIC APPLICATIONS OF ∑-PROTOCOL

∑-protocol has been proved to be a very powerful cryptographic tool and widely used in nnmerous important cryptographic applications. In this paper, the authors make use of ∑-protocol as a main tool to resolve the following difficult problems 1-3 and to construct three ettlcient cryptographic protocols 4 6：1） How to construct a protocol for proving a secret integer to be a Blum integer with form PQ, where P, Q are two different primes and both -- 3（mod 4）;2） How to construct a protocol for proving a secret polynomial with exact degree t - 1 iil a （t, n）- threshold secret sharing scheme：3） How to construct witness indistinguishable and witness hiding protocol not from zero-knowledge proof;4） A publicly verifiable secret sharing scheme with information-theoretic security;5） A delegateable signature scheme under the existence of one-way permutations;6） Non-interactive universal designated verifier signature schemes.

System-level simulation of microbolometer and read-out integrated circuit

A method for system-level simulation between microbolometer designing and Read-Out Integrated Circuit(ROIC) was studied. Three-dimensional(3D) structure modeling of the microbolometer was built. Thermal capacity, thermal conductivity and resistance of the model were obtained from thermoelectric coupling Finite Element Method(FEM) based on the model. An electrical equipment circuit of microbolometer which contains these three parameters was established. By using Verilog-AMS language, the electrical equipment circuit was described as a reduced-order macro-model. Then, the reduced-order macromodel was compiled in cadence to form IP unit of microbolometer, which could be used and identified in cadence. Systemlevel simulation between microbolometer and ROIC was accomplished. Key performances of the device, including input and output characteristics, were obtained in simulation and verified by experimental results.