Efficient signcryption without random oracles

Authors:
Qianhong Wu;Yi Mu;Willy Susilo;Fangguo Zhang
Affiliations:
Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Center for Information Security Research, School of Information Technology and Computer Science, University of Wollongong, Wollongong, Australia;Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, P.R. China
Venue:
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Year:
2006

Citing 16
Cited 2

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing

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
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
Short Signatures from the Weil Pairing

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
How to Go Beyond the Black-Box Simulation Barrier

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Lower Bounds for Non-Black-Box Zero Knowledge

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the (In)security of the Fiat-Shamir Paradigm

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The random oracle methodology, revisited

Journal of the ACM (JACM)
Two birds one stone: signcryption using RSA

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Improved identity-based signcryption

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Short signature and universal designated verifier signature without random oracles

ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Improved signcryption from q-Diffie-Hellman problems

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
A general construction for simultaneous signing and encrypting

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding

Towards confidentiality of ID-Based signcryption schemes under without random oracle model

PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
Certificate-based signcryption with enhanced security features

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Signcryption is an asymmetric cryptographic method that simultaneously provides confidentiality and authenticity at a lower computational and communication overhead. A number of signcryption schemes have been proposed in the literature, but they are only proven to be secure in the random oracle model. In this paper, under rational computational assumptions, we propose a signcryption scheme from pairings that is proven secure without random oracles. The scheme is also efficient and comparable to the state-of-the-art signcryption schemes from pairings that is secure in the random oracle model.