Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th 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
A Signcryption Scheme with Signature Directly Verifiable by Public Key
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Formal Proofs for the Security of Signcryption
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
The random oracle methodology, revisited
Journal of the ACM (JACM)
Signature Scheme in Multi-User Setting
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Insider-secure Hybrid Signcryption SchemeWithout Random Oracles
ARES '07 Proceedings of the The Second International Conference on Availability, Reliability and Security
Insider-secure Signcryption KEM/Tag-KEM Schemes without Random Oracles
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Signcryption Scheme in Multi-user Setting without Random Oracles
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Efficient Signcryption Key Encapsulation without Random Oracles
Information Security and Cryptology
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Two birds one stone: signcryption using RSA
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Efficient proxy signcryption scheme with provable CCA and CMA security
Computers & Mathematics with Applications
An Efficient Multi Recipient Signcryption Scheme Offering Non Repudiation
CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. The performance advantage of signcryption over the signature-then-encryption method makes signcryption useful in many applications, such as electronic commerce, mobile communications, and smart cards. In this paper, we propose an efficient signcryption scheme in the standard model. We prove that our scheme satisfies the confidentiality and strong unforgeability. Compared with the Tan's scheme, our scheme has | G | + | p | (320) bits shorter ciphertext, 2 | p | − | G | (160) bits shorter private key, and | GT | + | G | (1184) bits shorter public key. In addition, in the Tan's scheme, a user must hold two public key/private key pairs at one time if it were both sender and receiver. Our scheme only needs a public key/private key pair, which is more practical for application. Copyright © 2011 John Wiley & Sons, Ltd.