A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Public-key cryptosystems provably secure against chosen ciphertext attacks
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Security of Signed ElGamal Encryption
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
The Decision Diffie-Hellman Problem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Encryption Modes with Almost Free Message Integrity
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Formal Proofs for the Security of Signcryption
Journal of Cryptology
Distributed signcryption scheme on hyperelliptic curve
CNIS '07 Proceedings of the Fourth IASTED International Conference on Communication, Network and Information Security
On the security of a group signcryption scheme from distributed signcryption scheme
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Certificate-based signcryption with enhanced security features
Computers & Mathematics with Applications
| Hi-index | 0.00 |
A distributed signcryption scheme was proposed by Mu and Varadharajan [18] in 2000. Since then some more distributed signcryption schemes have been proposed [11,13]. But formal security models and security proofs have not been presented in any of these schemes. In this paper, we propose formal security model for distributed signcryption for confidentiality and unforgeability. We also modify schemes proposed by Mu & Varadharajan [18] and Gupta et al [11] to achieve formally provable security. We show that these modified schemes provide confidentiality against chosen ciphertext attack and unforgeability against chosen message attack.