Description of Provably Secure Signcryption Schemes
نویسندگان
چکیده
In this report we provide a detailed description of four signcryption schemes all of which have been proven secure. The first two of the schemes are based on discrete logarithm on finite fields and the other two schemes are based on elliptic curves. We also discuss issues on the implementation of signcryption schemes.
منابع مشابه
Artemia: a family of provably secure authenticated encryption schemes
Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...
متن کاملEfficient and Identity-based Signcryption with Provably-secure
The idea of signcryption is to provide a method to encrypt and sign data together, so it is more efficient than using an encryption scheme combined with a signature scheme. We present an identitybased signcryption solution, which is one of the most efficient, provably-secure schemes proposed to date. Our scheme admits provable security in the random oracle model under the bilinear DiffieHellman...
متن کاملBuilding Better Signcryption Schemes with Tag-KEMs
Signcryption schemes aim to provide all of the advantages of simultaneously signing and encrypting a message. Recently, Dent [8, 9] and Bjørstad [4] investigated the possibility of constructing provably secure signcryption schemes using hybrid KEM-DEM techniques [7]. We build on this work by showing that more efficient insider secure hybrid signcryption schemes can be built using tag-KEMs [1]. ...
متن کاملOn the Security of ID Based Signcryption Schemes
A signcryption scheme is secure only if it satisfies both the confidentiality and the unforgeability properties. All the ID based signcryption schemes presented in the standard model till now do not have either the confidentiality or the unforgeability or both of these properties. Cryptanalysis of some of the schemes have been proposed already. In this work, we present the security attack on ‘S...
متن کاملEfficient and Provably Secure Multi-receiver Identity-Based Signcryption
In this paper, we propose an efficient multi-receiver identity based signcryption scheme which only needs one pairing computation to signcrypt a message for n receivers and can provide confidentiality and authenticity simultaneously in the multi-receiver setting. We compare our scheme with several multi-receiver constructions from the security and efficiency points of view and argue that our pr...
متن کامل