18 results with keyword: 'provable secure identity based generalized signcryption scheme'
We say that identity based generalized signcryption in encryption mode is IND-(IDGSC-IN-EN)-CCA secure if no polynomially bounded adversary A has a non-negligible advantage in Game
N/A
– Must be the same algorithm as Gen.. For example, when considering confidentiality of Generalized Signcryption in encryption-mode, we must note adversary can get both Decryption
N/A
In Section 2 , we define the identity based generalized signcryption scheme and propose a simplified security model for identity based generalized signcryption (IBGSC).. Section
N/A
Along with this we also have proposed two schemes of which first one is an Identity based Generalized Signcryption Scheme and second one is a Certificateless Generalized
N/A
In this study, we propose an authenticated group communication scheme which is secure against an adaptive chosen ciphertext attack using identity-based signcryption.. The
N/A
This paper presents an identity based generalized signcryption scheme based on bilinear pairing and discusses its security for message confidentiality non repudiation and
N/A
based signature encryption (IBSE) similar to Boyen’s one ([15]) but providing much better security guarantees or into a strongly secure monolithic identity based signcryption
N/A
Also, we proposed the first provably secure identity based online/offline signcryption scheme which does not require the knowledge of the message and receiver.. We proved the
N/A
The number of computations for the signature-then-encryption method using Boneh-Franklin ID- based encryption scheme [4] and Hess’s signature scheme [5], and the comparison of the
N/A
Finally, we have proposed a new identity based signcryption scheme that offers the property of public verifiability and third party verification linking message to the ciphertext and
N/A
ECGSC proposed in this paper has four advantages: (1) based on standard signature ECDSA; (2) is an efficient scheme in computation and communication (storage) cost; (3) is a
N/A
Now we show how to design an algorithm F in a chosenmessage and given identity attack to our scheme by running the ESUF-IBSCMP-CMA attacker A that makes qhi queries to random oracles
N/A
Unfortunately, the properties of public verifiability and forward security are mutually exclusive in the Libert-Quisquater scheme; in fact, Libert and Quisquater [9] leave it as an
N/A
In this paper, we give the formal definition and security notions of multi-receiver Id-based generalized signcryption and propose a concrete scheme which needs only one
N/A
The number of attendees and audience reported reflects somewhat how well the Louisiana State Museum is fulfilling its mission to present exhibits and programming in an educational
N/A
signcryption scheme which only takes four pairing operations for any group size, the proposed scheme is proven to be indistinguishable against adaptive chosen
N/A
We show how to transform the binary tree based signcryption scheme to a plain strongly forward secure signcryption scheme with evolving secret keys in Sec.. Last, a third party
N/A