Efficient Signcryption Key Encapsulation without Random Oracles

Authors:
Fagen Li;Masaaki Shirase;Tsuyoshi Takagi
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China 610054 and State Key Laboratory of Information Security, Graduate School of Chi ...;School of Systems Information Science, Future University-Hakodate, Hakodate, Japan 041-8655;School of Systems Information Science, Future University-Hakodate, Hakodate, Japan 041-8655
Venue:
Information Security and Cryptology
Year:
2009

Citing 18
Cited 3

Signature schemes based on the strong RSA assumption

CCS '99 Proceedings of the 6th 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
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
The Cramer-Shoup Strong-RSASignature Scheme Revisited

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

SIAM Journal on Computing
Signature Scheme in Multi-User Setting

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Formal Proofs for the Security of Signcryption

Journal of Cryptology
Tag-KEM/DEM: A New Framework for Hybrid Encryption

Journal of Cryptology
Generic Constructions of Identity-Based and Certificateless KEMs

Journal of Cryptology
Cryptanalysis and improvement of a multi-receiver identity-based key encapsulation at INDOCRYPT 06

Proceedings of the 2008 ACM symposium on Information, computer and communications 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
Chosen-ciphertext secure key-encapsulation based on gap hashed Diffie-Hellman

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
A signature scheme with efficient protocols

SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Multi-receiver identity-based key encapsulation with shortened ciphertext

INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Hybrid signcryption schemes with insider security

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
Hybrid signcryption schemes with outsider security

ISC'05 Proceedings of the 8th international conference on Information Security
Building better signcryption schemes with Tag-KEMs

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy

Signcryption with non-interactive non-repudiation without random oracles

Transactions on computational science X
Efficient signcryption in the standard model

Concurrency and Computation: Practice & Experience
Constructing practical signcryption KEM from standard assumptions without random oracles

ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Tan proposed an insider secure signcryption key encapsulation mechanism (KEM) and an insider secure signcryption tag-KEM. His schemes are secure without random oracles (in the standard model). In this paper, we proposed a more efficient construction for signcryption KEM and tag-KEM. We prove their semantic security and existential unforgeability in the standard model. Compared to Tan's schemes, our corresponding schemes have 20% faster speed in the key encapsulation, 33% faster speed in the key decapsulation, 33% shorter public key, 60% shorter private key, and |p | bits shorter ciphertext.