Scheme In Standard Model Research Articles

Certificateless Proxy Signcryption in the Standard Model for a UAV Network

As we all know, the random oracle model (ROM) is a simulation of the hash function and cannot replace the actual computation of hash function and the public-key cryptography scheme, which was proved to be secure in ROM may be insecure when instantiating random oracles with concrete hash functions in practical applications. So far as we know, certificateless proxy signcryption (CLPSC) scheme’s security is only proved by applying ROM. Therefore, it is quite important to construct a CLPSC scheme in the standard model (SM). In this article, we propose the first CLPSC scheme in SM, which can achieve public verifiability and we prove that this scheme is EUF-CMA-CLPSC security and IND-CCA-CLPSC security against type I adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {A}_{I}$ </tex-math></inline-formula> and Type II adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {A}_{II}$ </tex-math></inline-formula> . Additionally, we compare our scheme’s performance with several previous schemes’ performance in terms of calculation, communication, and security. The results show that our CLPSC scheme has better security performance, which is suitable for a unmanned aerial vehicle network.

Understanding signcryption security in standard model

AbstractSigncryption is an advanced technique that combines both signature and encryption in one step which costs lower than any ordinary signature‐then‐encryption technique. Many ID‐based signcryption () techniques have been constructed, but they are considered secure in the random Oracle (RO) model, where the proofs in this environment are criticized as it always depends on the assumption that Oracle is truly random. This assumption of RO is not possible in reality. Therefore, many of the ID‐based signcryptions were proposed in the widely accepted standard model. As signcryption schemes have much important application, the verification of their correctness, security, and performance are required. In this article, we have discussed two important security features in the standard model under decision bilinear Diffie‐Hellman (DBDH) and computational Diffie‐Hellman(CDH) assumptions, namely, (a) indistinguishable against chosen cipher text attack and (b) indistinguishable against chosen‐plaintext attack. To understand the security of existing schemes, we present cryptanalysis, which illustrates weak security. The study on performance is also performed to analyze the communication and computational efficiency. The study of performance and security analysis helps us to understand the requirement of signcryption scheme in standard model.

On-line/Off-line Identity-based Signature Scheme with Strong Unforgeability in the Standard Model

To solve the problems of low efficiency of the strong unforgeable identity-based signature scheme, a new strong unforgeable on-line/off-line identity-based signature scheme in standard model is proposed. Our new scheme uses the chameleon hash function and divides the signature algorithm into two stages: on-line stage and off-line stage. Our scheme generates signatures in a very short time, which efficiently improves the performance of the signature. The analysis results show that the proposed scheme not only has higher security, but also has lower computation cost.

Certificateless multi-signcryption scheme in standard model

A signcryption scheme can realise the security objectives of encryption and signature simultaneously, which has lower computational cost and communication overhead than the sign-then-encrypt approach. To adapt multi-user settings and solve key escrow problem of ID-based multi-signcryption schemes, we defined the formal model of certificateless multi-signcryption scheme and proposed a certificateless multi-signcryption scheme in the standard model. The scheme is proved secure against adaptive chosen ciphertext attacks and adaptive chosen message attacks under decisional bilinear Diffie-Hellman assumption and computational Diffie-Hellman assumption respectively.

Certificateless multi-signcryption scheme in standard model

Certificateless multi-signcryption scheme in standard model

Homomorphic Signatures from Chameleon Hash Functions

Homomorphic signature schemes provide a feasible solution to the authenticity problem on an untrusted server, such as cloud. In a homomorphic signature scheme, given a $n$-length signed dataset $\delta=\{\delta_1, \delta_2,\delta_3, \cdots, \delta_k\} $ and its corresponding message set $\mu=\{\mu_1, \mu_2,\mu_3, \cdots, \mu_k\} $, anyone can publicly perform computations and produce a new signature $\delta^{'}$ for the messages $\mu^{'}=f(\mu_1, \mu_2,\mu_3, \cdots, \mu_k)$, where $f$ is a function or a circuit. If the generated homomorphic signature $\delta^{'}$ is valid, then the owner of the dataset (such as cloud users) convinces that $\mu^{'}$ is indeed the correct output of the function $f$ over the original messages even if he forgets it. In this work, the main contribution is to build a bridge between leveled Fully Homomorphic Signature Scheme (FHSS) and Homomorphic Chameleon Hash Function (HCHF), which is a new cryptographic primitive introduced by us based on prior works. We first present the definition and specific construction of HCHF and then use this forceful technique to construct leveled fully homomorphic signature schemes for any polynomial-depth circuit. In our standard model scheme, the size of evaluated homomorphic signature grows polynomially in the depth of the circuit. The security of our scheme is based on the property of collision resistance of HCHF, which can be reduced to the Small Integer Solution (SIS) in hard random lattices. DOI: http://dx.doi.org/10.5755/j01.itc.46.2.14320

Efficient chosen ciphertext secure key encapsulation mechanism in standard model over ideal lattices

ABSTRACTKey encapsulation mechanism (KEM) is an important key distribution mechanism that not only allows both sender and receiver to safely share a random session key, but also can be mainly applied to construct a hybrid public key encryption scheme. In this paper, we give an positive answer to the question of if it is possible to build an efficient KEM over lattices. More precisely, we design an efficient KEM scheme in standard model based on ideal lattices. We prove that the proposed scheme captures indistinguishability against active chosen ciphertext attacks (IND-CCA) under the ring learning with errors problem, or more formally, IND-CCA security. Compared with the current CCA secure KEM schemes based on lattices in the standard model, our scheme has shorter public key, secret key and encapsulation ciphertext. In addition, our KEM scheme realizes IND-CCA security in the standard model.

Efficient provably secure certificateless signcryption scheme in standard model

At present,most of the existing certificateless signcryption schemes proven secure are proposed in the random oracle.Concerning the problem that this kind of schemes usually can not construct the corresponding instance in the practical application,a certificateless signcryption scheme was designed in the standard model.By analyzing several certificateless signcryption schemes in the standard model,it was pointed out that they were all insecure.Based on Au's scheme(AU M H,LIU J K,YUEN T H,et al.Practical hierarchical identity based encryption and signature schemes without random oracles.http://eprint.iacr.org/2006/368.pdf),a new proven secure certificateless signcryption scheme was proposed in the standard model by using bilinear pairing technique of elliptic curves.In the end,it is proved that the scheme satisfies indistinguishability against adaptive chosen ciphertext attack and existential unforgeability against adaptive chosen message and identity attack under the complexity assumptions,such as Decisional Bilinear Diffie-Hellman(DBDH) problem.Therefore,the scheme was secure and reliable.

New provable secure public key encryption scheme in standard model

The public key encryption schemes with semantic security against adaptively chosen cipertext attacks in the standard model suffer from the drawbacks of low efficiency or strong computational assumptions.Concerning these problems,a new provable secure public key encryption scheme was proposed based on the newly introduced d-decisional Diffie-Hellman problem.To obtain the security and efficiency,the methodology of Hash proof system was adopted in the construction and security proof of the scheme.The intractability of the d-decisional Diffie-Hellman problem was between that of the computational Diffie-Hellman problem and decisional Diffie-Hellman problem.The efficiency of the scheme surpassed that of the schemes based on the computational Diffie-Hellman problem and approximated with the schemes based on the decisional Diffie-Hellman problem.Therefore,the proposed scheme has reached a good compromise between efficiency and computational assumption.Moreover,it can select different d for different security demand of applications.

Efficient threshold signature scheme in standard model

To improve the computational efficiency in the threshold signature scheme,the authors proposed a new threshold signature scheme based on bilinear pairing via combining Gennaro's(GENNARO R,JAREAKI S,KRAWCZYK H,et al.Secure distributed key generation for discrete-log based cryptosystem.Journal of Cryptology,2007,20(1): 51-83) distributed secret key generation solution and Gu's(GU K,JIA W J,JIANG C L.Efficient and secure identity-based signature scheme.Journal of Software,2011,22(6): 1350-1360) signature scheme in the standard model.There was no trusted dealer for secret key share distribution and each party could verify the validity of some important information,which guaranteed the proposed scheme can avoid the malicious private key generator attack and public key share replacing attack.The comparison results with two previous threshold signature schemes show that the proposed scheme needs less pairing computation and raises the computational efficiency.

Independent Verification of Proxy Multi-Signature without Random Oracle

Privacy has become one of the most important human rights of the modern age. In a proxy multi-signature scheme, the verifier need get all the original signers’ public keys together to verify its validity. However, the relationships between the proxy signer and the original signers would be leaked in the verification process. In this paper, we propose a secure proxy multi-signature scheme in standard model with the property of independent verification. In the scheme, the verifier can verify the signature using the public keys of the special original signers, rather than collecting all the original signers’ public keys.

Efficient and secure identity-based multi-signcryption scheme in standard model

Faced with the inefficiency problem of current identity-based multi-signcryption schemes,an efficient and secure identity-based multi-signcryption scheme was proposed.The new scheme eliminated the number of multiplicative operations,and increased the procedure of key verification.Furthermore,through security and efficiency analysis in the standard model,the new scheme is proved secure under computational Diffie-Hellman assumption and reduces the calculation work.Compared with the known schemes,the new scheme is more secure and efficient.

Certificateless signcryption scheme in standard model

Most of the current identity-based signature schemes are secure in the random oracle model but many of them have security problem.In this paper an efficient and provably secure identity-based certificateless signcryption scheme was proposed.The scheme was proved secue in the standard model and reduced the q-Augmented Bilinear Diffie-Hellman Exponent q-ABDHE problem.Compared with the known identity-based scheme in the standard model the proposed scheme has shorter signature length and less operation.

POLARIZATION ASYMMETRY AND THE HIGGS BOSON PRODUCTION MECHANISMS

We calculate the cross-section of Higgs boson production in the reaction [Formula: see text] for the case of left and right longitudinally polarized initial electron beam. A complete set of signal and irreducible background diagrams is considered. It is shown that the ratio of cross-sections with left and right initial beam polarization provides a sensitive critical test since it exhibits the interplay of bremsstrahlung and fusion mechanisms of Higgs boson production inherent to the Standard Model scheme.

B-tagging at LHC

The review of the recent progress in the area of b-tagging studies at LHC is presented. Vertex b-tagging will be the major tool for the search for low mass Higgs both in the Standard Model scheme and in its supersymmetric extensions at LHC experiments. The simulation results indicate that the rejection of gluon and light quark jets of R q g-jet = 50 with b-tagging efficiency ϵ b-jet = 50% can be achieved at LHC experiments.